PAT 1121 Damn Single
来源:互联网 发布:编程教学的app 编辑:程序博客网 时间:2024/06/06 08:49
1121. Damn Single (25)
"Damn Single (单身狗)" is the Chinese nickname for someone who is being single. You are supposed to find those who are alone in a big party, so they can be taken care of.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (<=50000), the total number of couples. Then N lines of the couples follow, each gives a couple of ID's which are 5-digit numbers (i.e. from 00000 to 99999). After the list of couples, there is a positive integer M (<=10000) followed by M ID's of the party guests. The numbers are separated by spaces. It is guaranteed that nobody is having bigamous marriage (重婚) or dangling with more than one companion.
Output Specification:
First print in a line the total number of lonely guests. Then in the next line, print their ID's in increasing order. The numbers must be separated by exactly 1 space, and there must be no extra space at the end of the line.
Sample Input:311111 2222233333 4444455555 66666755555 44444 10000 88888 22222 11111 23333Sample Output:
510000 23333 44444 55555 88888
#include <cstdio>#include <cstring>#include <vector>#include <map>#include <algorithm>#include <iostream>using namespace std;int main(){int n,count=0;string a,b;map<string,string> c;map<string,int> d;vector<string> re;cin>>n;for(int i=1;i<=n;i++){cin>>a>>b;c.insert(pair<string,string>(a,b));c.insert(pair<string,string>(b,a));}cin>>n;for(int i=1;i<=n;i++){cin>>a;d[a]=1;}int flag=0;map<string,int> ::iterator it;for(it=d.begin();it!=d.end();it++){if(d.count(c[it->first])==0){count++;re.push_back(it->first);}}cout<<count<<endl;for(int i=0;i<re.size();i++){cout<<re.at(i)<<(i==re.size()-1?'\n':' ');}return 0;}
- PAT 1121 Damn Single
- 【PAT】1121. Damn Single
- PAT A1121. Damn Single
- PAT--1121. Damn Single (25)
- PAT A1121 damn single (25)
- PAT A1121. Damn Single (25)
- PAT (Advanced Level) Practise 1121Damn Single (25)
- PAT (Advanced Level) Practise 1121 Damn Single (25)
- PAT - 甲级 - 1121. Damn Single (25)
- pat甲级 1121. Damn Single (25)
- pat 甲1121. Damn Single (水题)
- PAT甲级练习1121. Damn Single (25)
- PAT (Advanced Level) 1121. Damn Single (25)
- PAT甲级 1121. Damn Single (25)
- 【PAT】【Advanced Level】1121. Damn Single (25)
- PAT 甲级 1121. Damn Single (25)
- 1121. Damn Single (25)-PAT甲级真题
- PAT (Advanced Level) Practise 1121. Damn Single (25)
- python 利用爬山法和迪杰斯特拉算法求解TSP最短路径
- Hanoi塔
- Git 分支管理-解决合并冲突
- 向指定URL发送GET,POST方法的请求
- 283. Move Zeroes
- PAT 1121 Damn Single
- jenkins设置smtp发送邮件通知
- view-基本属性
- cloudtack基本概念入门
- WebMagic-使用入门
- Mac 键盘快捷键
- 安卓开发-RecyclerView添加头(轮播图)
- 我的第一篇文章
- 20个很棒的android开源项目帮助你提升开发技能