Ningbo [1220] SPY(题目有点难懂,读懂题目题很简单)
2014-02-15 10:29
393 查看
1、http://cdn.ac.nbutoj.com/Problem/view.xhtml?id=1220
2、题目:
问题描述
The National Intelligence Council of X Nation receives a piece of credible information that Nation Y will send spies to steal Nation X’s
confidential paper. So the commander of
The National Intelligence Council take measures
immediately, he will investigate people who will come into NationX. At the same time, there are two List in the Commander’s hand, one is full of spies that Nation Y will send to Nation X, and the other
one is full of spies that Nation X has sent to Nation Y before. There may be some overlaps of the two list. Because the spy may act two roles at the same time, which means that he may be the one that is sent from Nation X to Nation Y, we just call this type
a “dual-spy”. So Nation Y may send “dual_spy” back to Nation X, and it is obvious now that it is good for Nation X, because “dual_spy” may bring back NationY’s confidential paper without worrying to be detention by NationY’s frontier
So the commander decides to seize those that are sent by NationY, and let the ordinary people and the “dual_spy” in at the same time .So can you decide a list that should be caught by the Commander?
A:the list contains that will come to the NationX’s frontier.
B:the list contains spies that will be sent by Nation Y.
C:the list contains spies that were sent to NationY before.
输入
There are several test cases.
Each test case contains four parts, the first part contains 3 positive integers A, B, C, and A is the number which will come into the frontier. B is the number that will be sent by Nation Y, and C is the number that NationX has sent to NationY before.
The second part contains A strings, the name list of that will come into the frontier.
The second part contains B strings, the name list of that are sent by NationY.
The second part contains C strings, the name list of the “dual_spy”.
There will be a blank line after each test case.
There won’t be any repetitive names in a single list, if repetitive names appear in two lists, they mean the same people.
输出
Output the list that the commander should caught (in the appearance order of the lists B).if no one should be caught, then , you should output “No enemy spy”.
样例输入
样例输出
提示
来源
3、AC代码:
2、题目:
[1220] SPY
时间限制: 1000 ms 内存限制: 131072 K问题描述
The National Intelligence Council of X Nation receives a piece of credible information that Nation Y will send spies to steal Nation X’s
confidential paper. So the commander of
The National Intelligence Council take measures
immediately, he will investigate people who will come into NationX. At the same time, there are two List in the Commander’s hand, one is full of spies that Nation Y will send to Nation X, and the other
one is full of spies that Nation X has sent to Nation Y before. There may be some overlaps of the two list. Because the spy may act two roles at the same time, which means that he may be the one that is sent from Nation X to Nation Y, we just call this type
a “dual-spy”. So Nation Y may send “dual_spy” back to Nation X, and it is obvious now that it is good for Nation X, because “dual_spy” may bring back NationY’s confidential paper without worrying to be detention by NationY’s frontier
So the commander decides to seize those that are sent by NationY, and let the ordinary people and the “dual_spy” in at the same time .So can you decide a list that should be caught by the Commander?
A:the list contains that will come to the NationX’s frontier.
B:the list contains spies that will be sent by Nation Y.
C:the list contains spies that were sent to NationY before.
输入
There are several test cases.
Each test case contains four parts, the first part contains 3 positive integers A, B, C, and A is the number which will come into the frontier. B is the number that will be sent by Nation Y, and C is the number that NationX has sent to NationY before.
The second part contains A strings, the name list of that will come into the frontier.
The second part contains B strings, the name list of that are sent by NationY.
The second part contains C strings, the name list of the “dual_spy”.
There will be a blank line after each test case.
There won’t be any repetitive names in a single list, if repetitive names appear in two lists, they mean the same people.
输出
Output the list that the commander should caught (in the appearance order of the lists B).if no one should be caught, then , you should output “No enemy spy”.
样例输入
8 4 3 Zhao Qian Sun Li Zhou Wu Zheng Wang Zhao Qian Sun Li Zhao Zhou Zheng 2 2 2 Zhao Qian Zhao Qian Zhao Qian
样例输出
Qian Sun Li No enemy spy
提示
无
来源
辽宁省赛2010
3、AC代码:
#include<stdio.h> #include<math.h> #include<iostream> #include<string.h> #include<algorithm> using namespace std; char sa[1005][100],sb[1005][100],sc[1005][100]; int a,b,c; int checka(int p) { for(int i=0;i<a;i++) { if(strcmp(sa[i],sb[p])==0) return 1; } return 0; } int checkc(int p) { for(int i=0;i<c;i++) { if(strcmp(sc[i],sb[p])==0) return 1; } return 0; } int main() { while(scanf("%d%d%d",&a,&b,&c)!=EOF) { for(int i=0;i<a;i++) { scanf("%s",sa[i]); } for(int i=0;i<b;i++) scanf("%s",sb[i]); for(int i=0;i<c;i++) scanf("%s",sc[i]); int flag=0; for(int i=0;i<b;i++) { if(checka(i)==1 && checkc(i)==0 && flag==0) printf("%s",sb[i]),flag=1; else if(checka(i)==1 && checkc(i)==0 && flag==1) printf(" %s",sb[i]); } if(flag==1) printf("\n"); else printf("No enemy spy\n"); } return 0; }
相关文章推荐
- poj 2996详解(题目很简单只是要认真看清楚题目,我写的代码有点长了,嘻嘻)
- uva 10688 - The Poor Giant(区间DP,较难,题目难懂,状态转移难。。。)
- 3244 Difference between Triplets 好题啊 有点类似求SIGMA(线段和)的题目
- 类的继承关系,多态的体现,我的觉得题目还是有点欠缺
- 非洲小孩题意有点难懂
- 淘宝遇到对手了,抢网模式分析-这题目取得有点大(转载)
- 牵扯较多属性和方法的类题目,很简单的题目本来不想发的,如果有同学学到这个题目感觉太长不愿敲代码,copy走我的即可~不过还是建议自己打一打
- HDU3910(数学期望题,题目难懂)
- hdu 1317 XYZZY 国产SPFA算法AC,,题目输入部分真特么难懂。。内有解析
- URAL 1029 很简单的DP..就是题目难得看懂..
- hdu 2854 (好难懂的题目啊)
- 转换说明符!! hdu 1720 题目很水不重要. 但是c和c++ 按进制输入的不同感觉有点意思
- NBUT 1220 SPY 2010辽宁省赛
- list:题目很简单,我被绕进去了,弄了两个小时才弄出来。
- 牵扯较多属性和方法的类题目,很简单的题目本来不想发的,如果有同学学到这个题目感觉太长不愿敲代码,copy走我的即可~不过还是建议自己打一打
- NBUT[1220] SPY
- 能源物联网中如何处理上报的大量数据问题的思路分析(题目有点长,但是我不介意它更长)--后续会继续补充
- poj 1120题目难懂啊
- AcMore-1485(很简单的一道贪心题目)
- 能源物联网中如何处理上报的大量数据问题的思路分析(题目有点长,但是我不介意它更长)--后续会继续补充