pat 甲1121. Damn Single (水题)

1121. Damn Single (25)

时间限制

300 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

"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:

3
11111 22222
33333 44444
55555 66666
7
55555 44444 10000 88888 22222 11111 23333

Sample Output:

5
10000 23333 44444 55555 88888

tips:当时有两个小的测试点没过

1.五位数字忘记补全前导零导致格式错误；

2.在存情侣关系时使用到了map，因为map的插入操作复杂度为logN，导致一个测试点超时

代码如下;

#include<iostream>
#include<set>
#include<algorithm>
using namespace std;

int couple[100005];
set<int>s;
int book[100005];
int a[10002];
int b[10002],size;
int main()
{
	int n;cin>>n;
	for(int i=1;i<=n;i++)
	{
		int x,y;cin>>x>>y;
		couple[x]=y;couple[y]=x;
	}
	
	int k;cin>>k;
	for(int i=1;i<=k;i++)
	{
		cin>>a[i];
		book[a[i]]=1;
	}
	for(int i=1;i<=k;i++)
	{
		if(!book[couple[a[i]]])s.insert(a[i]);//b[size++]=a[i];
	}
	cout<<s.size()<<endl;
	int flag=1;
	for(auto it=s.begin();it!=s.end();++it)
	{
		printf("%s%05d",flag?"":" ",*it);flag=0;
	}
	
	return 0;
}