Judging Troubles (multiset查找) 分类: ACM STL
来源:互联网 发布:php开发网站兼容问题 编辑:程序博客网 时间:2024/05/18 03:39
Judging Troubles
Time Limit: 5000ms, Special Time Limit:12500ms, Memory Limit:65536KB
Total submit users: 91, Accepted users: 72
Problem 13352 : No special judgement
Problem description
The NWERC organisers have decided that they want to improve the automatic grading of the submissions for the contest, so they now use two systems: DOMjudge and Kattis. Each submission is judged by both systems and the grading results are compared to make sure that the systems agree. However, something went wrong in setting up the connection between the systems, and now the jury only knows all results of both systems, but not which result belongs to which submission! You are therefore asked to help them figure out how many results could have been consistent.
Input
The input consists of:
• one line with one integer n (1 ≤ n ≤ 10^5), the number of submissions;
• n lines, each with a result of the judging by DOMjudge, in arbitrary order;
• n lines, each with a result of the judging by Kattis, in arbitrary order.
Each result is a string of length between 5 and 15 characters (inclusive) consisting of lowercase letters.
Output
Output one line with the maximum number of judging results that could have been the same for both systems.
Sample Input
5
correct
wronganswer
correct
correct
timelimit
wronganswer
correct
timelimit
correct
timelimit
Sample Output
4
Problem Source
NWERC 2014
题意就是看看给出的两个评测系统的n的结果,让你求有多少个是相同的提交。
用multiset,也可以用map做
#include<stdio.h>#include<string.h>#include<set>#include<vector> #include<algorithm>#include<iostream>#include<string>#include<stdlib.h> #define maxn 100000+100 using namespace std;char str[maxn];char ch[maxn];string ss;int main(){ int n; multiset<string>S; scanf("%d",&n); getchar(); for(int i=0;i<n;i++) { scanf("%s",str); S.insert(str); } //printf("%d\n",S.size()); int count=0; for(int i=0;i<n;i++) { scanf("%s",ch); multiset<string>::iterator it; it=S.find(ch); if(it!=S.end()) { count++; S.erase(it); } } printf("%d\n",count); return 0;}//map版本#include<stdio.h>#include<string.h>#include<set>#include<vector>#include<algorithm>#include<iostream>#include<string>#include<stdlib.h>#include<map>#define maxn 100000+100using namespace std;char str[maxn];char ch[maxn];string ss;int main(){ int n; map<string,int>S; S.clear(); scanf("%d",&n); getchar(); for(int i=0;i<n;i++) { scanf("%s",str); S[str]++; } //printf("%d\n",S.size()); int count=0; for(int i=0;i<n;i++) { scanf("%s",ch) ; if(S[ch]>0) { count++; S[ch]--; } } printf("%d\n",count); return 0;}
版权声明:本文为博主原创文章,未经博主允许不得转载。
- Judging Troubles (multiset查找) 分类: ACM STL
- Judging Troubles (multiset查找)
- ACM 贪心 STL multiset 二分查找 hdu4268
- UVALive 6678 Judging Troubles
- HNU Judging Troubles (字典树)
- UVALive6959 Judging Troubles map应用
- multiset(STL)的使用
- UVA - 11020 (STL multiset)
- uva11020 Efficient Solutions(STL multiset的应用+二分查找函数)
- STL MultiSet
- stl multiset
- STL multiset
- Multiset(中)——STL中的multiset
- Multiset(中)——STL中的multiset
- STL之set&multiset容器(笔记)
- HDU Bombing (STL multiset+map)
- (STL之set与multiset)SPOJ
- STL之set/multiset(二)
- Buildings 分类: ACM 多校 2015-07-23 22:09
- Delicious Apples(多校联合训练) 分类: ACM 多校 201
- Crazy Search(POJ1200) 分类: poj 2015-07-25 10:15 6
- HNU Knockout Racing 分类: ACM 2015-08-03 13:35 1人
- Joke with permutation 分类: ACM 2015-08-03 14:09 1
- Judging Troubles (multiset查找) 分类: ACM STL
- Cent Savings (DP) 分类: ACM dp 2015-08-0
- 背包问题------ 分类: ACM 2015-08-03 20:57 1人阅读 评论(0
- 最小生成树 克鲁斯卡尔(Kruskal)算法求最小生成树
- 优先队列实现哈弗曼最小权值
- 二维hash(Uva 12886)
- Concert Tour(Uvalive 6853)
- ACM数论中的常见的模板和结论
- 1279 扔盘子(51nod)