SPY NBUT - 1220---题解
2017-09-05 18:04
176 查看
Description:
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.
Input
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
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”.
Sample Input
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
Sample Output
Qian Sun Li
No enemy spy
总结:
1、注意,以B的顺序输出。
2、尝试使用vector,map应该更简单。
代码:
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.
Input
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
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”.
Sample Input
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
Sample Output
Qian Sun Li
No enemy spy
总结:
1、注意,以B的顺序输出。
2、尝试使用vector,map应该更简单。
代码:
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <algorithm> #include <string> #include <cstring> #include <math.h> #include <vector> using namespace std; int main() { //freopen("in.txt","r",stdin); int A,B,C; vector<string> As,Bs; vector<bool> flagB; string s; bool start=false; while(~scanf("%d%d%d",&A,&B,&C)) { As.clear(); Bs.clear(); flagB.clear(); start=false; for(int i=0;i<A;i++) { cin>>s; As.push_back(s); } for(int i=0;i<B;i++) { cin>>s; Bs.push_back(s); flagB.push_back(false); for(int j=0;j<As.size();j++) if(s==As[j]) { flagB[i]=true; break; } } for(int i=0;i<C;i++) { cin>>s; for(int j=0;j<Bs.size();j++) if(s==Bs[j]) { flagB[j]=false; break; } } for(int i=0;i<Bs.size();i++) { if(flagB[i]==true) { if(!start) { cout<<Bs[i]; start=true; } else cout<<" "<<Bs[i]; } } if(!start) cout<<"No enemy spy"; cout<<endl; } return 0; }
相关文章推荐
- nbut [1220] SPY
- NBUT 1220 SPY
- NBUT 1220 SPY
- NBUT 1220 SPY 2010辽宁省赛
- Ningbo [1220] SPY(题目有点难懂,读懂题目题很简单)
- NBUT Summer Contest-1题解报告
- NBUT Summer Contest-2 题解报告
- ★UVa 1025---A Spy in the Metro 题解 (简单dp)
- NBUT[1220] SPY
- 【题解Part 3】NBUT 2012 Weekly - 27th Oct for 12x
- NOJ [1220] SPY
- spy——[1220] SPY
- 题目观察记录(无代码 or 题解 but 持续更新)
- NBUT 1220 SPY
- 城市里的间谍(A Spy in the Metro UVa 1025)最详细题解
- SetNeedsDisplay but drawRect not called
- [LeetCode]题解(python):115-Distinct Subsequences
- VK Cup 2012 Qualification Round 2部分题解(C,D,E)
- Javascript学习笔记:闭包题解(1)
- Keeping, but not backng up, downloaded data in iOS5