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
    Copy
    3
    2 3 2
    2
    3 2
    2 3
    output
    Copy
    2
    input
    Copy
    6
    6 3 1 1 3 7
    5
    1 2 3 4 5
    2 3 4 5 1
    output
    Copy
    1
    Note

    In the first sample, scientists must go to the movie with the index 2, as in such case the 1-th and the 3-rd scientists will be very pleased and the 2-nd scientist will be almost satisfied.

    In the second test case scientists can go either to the movie with the index 1 or the index 3. After viewing any of these movies exactly twoscientists will be very pleased and all the others will be not satisfied.

     题意:有n个人来看电影,每个人会的语言是ai,电影院有m种电影,电影的语音和字幕分别是bi和ci,求选那种电影会让n个人尽量多的可以看得懂字幕或者听到的语音

    题解:用map映射匹配一下保存最大值即可

    代码如下:

    #include<bits/stdc++.h>
    using namespace std;
    const int maxn = 2e5+5;
    int a[maxn];
    int b[maxn];
    int c[maxn];
    map<int,int> mp;
    int main(){
        int n,m;
        scanf("%d",&n);
        for(int i = 1;i<=n;i++){
            scanf("%d",&a[i]);
            mp[a[i]]++;
        }
        scanf("%d",&m);
        for(int i=1;i<=m;i++){
            scanf("%d",&b[i]);
        }
        for(int i=1;i<=m;i++){
            scanf("%d",&c[i]);
        }
        int ans=1;
        int maxx=-1;
        for(int i=1;i<=m;i++){
            if(maxx<mp[b[i]]){
                maxx=mp[b[i]];
                ans=i;
            }
        }
        int maxxx=-1;
        for(int i=1;i<=m;i++){
            if(mp[b[i]]==maxx){
                if(maxxx<mp[c[i]]){
                    maxxx=mp[c[i]];
                    ans=i;
                }
            }
        }
        cout<<ans<<endl;
    }
    View Code
    每一个不曾刷题的日子 都是对生命的辜负 从弱小到强大,需要一段时间的沉淀,就是现在了 ~buerdepepeqi
  • 相关阅读:
    ACR2010_TNF拮抗剂促进SpA患者椎体侵蚀的修复
    2010年10月第1期(ACR2010专刊AS篇)_中信国健临床通讯目录
    ACR2010_中轴型SpA患者使用TNF拮抗剂治疗后放射学进展与全身炎症消退相关
    ACR2010_小剂量依那西普对达到缓解的AS患者有效
    ACR2010_在高风险人群中应用新版RA分类标准可能发现更多临床前RA
    ACR2010_常规医疗环境下TNF拮抗剂对RA骨侵蚀的修复作用
    ACR2010_HLA B27阳性的极早期AS患者停用TNF拮抗剂后疗效持续: 3个月随机安慰剂对照试验后随访40周
    .net委托与事件 中庸
    筛选法因子之和
    POJ2488 A Knight's Journey 解题报告
  • 原文地址:https://www.cnblogs.com/buerdepepeqi/p/9453606.html
Copyright © 2011-2022 走看看