1121. Damn Single (25)

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
#include <iostream> 
#include <cmath> 
#include <fstream>
using namespace std;
int main(){
	int N;
	cin>>N;
	int i;
	int a[100000]={0}; 
	int b[100001]={100000}; 
	int A,B;
	for(i=0;i<N;i++){
		scanf("%d %d",&A,&B);
		b[A]=B;
		b[B]=A;
	} 
	int count=0;
	int M;
	cin>>M;
	for(i=0;i<M;i++){
		cin>>A;
		if(a[A]==0){
			count++;
			a[A]=1;
			a[b[A]]=-1;
		}
		else if(a[A]==-1){
			a[b[A]]=0;
			count--;
		}
	}
	int fir=0,j=0;
	cout<<count<<endl;
	for(i=0;j<count;i++){
		if(a[i]==1){
			if(fir==0)
			fir=1;
			else
			cout<<" ";
		printf("%05d",i);
		j++;
	}
	}
}
感想：今天考的乙级的最后一题，卡了我半个小时。。。没有啥特殊的点，小心点就能过