zoukankan      html  css  js  c++  java
  • CodeForces 670C Cinema(排序,离散化)

    C. Cinema
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Moscow is hosting a major international conference, which is attended by n scientists from different countries. Each of the scientists knows exactly one language. For convenience, we enumerate all languages of the world with integers from 1 to 109.

    In the evening after the conference, all n scientists decided to go to the cinema. There are m movies in the cinema they came to. Each of the movies is characterized by two distinct numbers — the index of audio language and the index of subtitles language. The scientist, who came to the movie, will be very pleased if he knows the audio language of the movie, will be almost satisfied if he knows the language of subtitles and will be not satisfied if he does not know neither one nor the other (note that the audio language and the subtitles language for each movie are always different).

    Scientists decided to go together to the same movie. You have to help them choose the movie, such that the number of very pleased scientists is maximum possible. If there are several such movies, select among them one that will maximize the number of almost satisfied scientists.

    Input

    The first line of the input contains a positive integer n (1 ≤ n ≤ 200 000) — the number of scientists.

    The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109), where ai is the index of a language, which the i-th scientist knows.

    The third line contains a positive integer m (1 ≤ m ≤ 200 000) — the number of movies in the cinema.

    The fourth line contains m positive integers b1, b2, ..., bm (1 ≤ bj ≤ 109), where bj is the index of the audio language of the j-th movie.

    The fifth line contains m positive integers c1, c2, ..., cm (1 ≤ cj ≤ 109), where cj is the index of subtitles language of the j-th movie.

    It is guaranteed that audio languages and subtitles language are different for each movie, that is bj ≠ cj.

    Output

    Print the single integer — the index of a movie to which scientists should go. After viewing this movie the number of very pleased scientists should be maximum possible. If in the cinema there are several such movies, you need to choose among them one, after viewing which there will be the maximum possible number of almost satisfied scientists.

    If there are several possible answers print any of them.

    Examples
    input
    3
    2 3 2
    2
    3 2
    2 3
    
    output
    2
    
    input
    6
    6 3 1 1 3 7
    5
    1 2 3 4 5
    2 3 4 5 1
    
    output

    1

    bi为第一关键字,ci为第二关键字,排序,先离散化一下

    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    #include <stdio.h>
    #include <math.h>
    #include <map>
    
    using namespace std;
    #define MAX 200000
    int a[MAX+5];
    int n,m;
    struct Node
    {
        int pos;
        int x,y;
    }b[MAX+5];
    map<int,int> m1;
    int num[MAX+5];
    int cmp(Node x,Node y)
    {
        if(num[x.x]==num[y.x])
            return num[x.y]>num[y.y];
        return num[x.x]>num[y.x];
    }
    
    int main()
    {
        scanf("%d",&n);
        m1.clear();
        int cnt=1;
        int x;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&x);
            if(!m1.count(x))
            {
                m1[x]=cnt;
                a[i]=cnt++;
            }
            else
                a[i]=m1[x];
        }
        memset(num,0,sizeof(num));
        for(int i=1;i<=n;i++)
            num[a[i]]++;
        scanf("%d",&m);
        for(int i=1;i<=m;i++)
        {
            scanf("%d",&x);
            b[i].x=m1[x];
            b[i].pos=i;
        }
        for(int i=1;i<=m;i++)
            {
                scanf("%d",&x);
                b[i].y=m1[x];
            }
    
        sort(b+1,b+m+1,cmp);
        printf("%d
    ",b[1].pos);
        return 0;
    
    }


  • 相关阅读:
    第009题 智猜年龄——问经理三女儿年龄各多少
    第008题 求最大值——10个1加乘的最大数字
    第007题 天平称物——最少砝码称出最多质量
    第006题 天平找次——至少称几次找到次品
    第005题 青蛙过河——十只青蛙如何顺利过去
    第004题 过河问题——如何过河用时最短
    第003题 过河问题——三对老虎如何安全过河
    第002题 打水问题——9升和4L的桶如何打6升水
    基于博弈论分析在线教育网站和慕课的产生
    C++左右括号匹配问题(并给出括号的位置 并且允许非括号字符插入)修改版
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228641.html
Copyright © 2011-2022 走看看