Codeforces Round #350 (Div. 2) C. Cinema 水题
2016-05-06 15:12
441 查看
C. Cinema
题目连接:
http://www.codeforces.com/contest/670/problem/CDescription
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.
Sample Input
32 3 2
2
3 2
2 3
Sample Output
2题意
每个电影有两种语言,一个主要语言,和一个次要语言每一个教授知道一门语言
现在这些教授决定去看一场电影了,他们想选择一场教授们懂得的主要语言最多的,如果一样多,就次要尽量多的电影去看
但是必须选一场
问你是哪场?
题解:
用map记录一下教授的语言,然后直接for一遍每一个电影就好了代码
#include<bits/stdc++.h> using namespace std; const int maxn = 2e5+6; map<int,int>H; int ans1=0,ans2=0,ans3=1,n,m,x,a[maxn],b[maxn]; int main() { scanf("%d",&n); for(int i=1;i<=n;i++)scanf("%d",&x),H[x]++; scanf("%d",&m); for(int i=1;i<=m;i++)scanf("%d",&a[i]); for(int i=1;i<=m;i++)scanf("%d",&b[i]); for(int i=1;i<=m;i++) { if(ans1<H[a[i]]) { ans1=H[a[i]],ans2=H[b[i]],ans3=i; } else if(ans1==H[a[i]]&&ans2<H[b[i]]) { ans1=H[a[i]],ans2=H[b[i]],ans3=i; } } cout<<ans3<<endl; }
相关文章推荐
- C# Graphics绘图 picBox
- Android LED控制
- 线程池的使用(二)
- Hadoop:Hadoop单机伪分布式的安装和配置
- Hadoop:Hadoop单机伪分布式的安装和配置
- Maven修改本地仓库路径
- Ucore_lab6
- DIV+CSS 清除浮动常用方法总结
- mysql更改最大打開文件數
- 迷宫问题
- 根据wsdl生成客户端Bean的两种方式
- spring事务管理
- 使用sklearn做特征工程
- Jayant Sinha:破产法案清零;将有助于提高商业便利
- [VMware]设置VM虚拟机随系统自动启动
- 解决umount.nfs: /data: device is busy 问题
- 经典排序算法:
- [LeetCode28]
- fetch API 简单解读
- 为什么VSAN中虚拟机磁盘速度慢