"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 23333Sample Output:
5 10000 23333 44444 55555 88888
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int N=100010;
int m,n,i;
int couple[N];
bool jud[N];
int main()
{
#ifndef ONLINE_JUDGE
freopen("data.in","r",stdin);
#endif
cin>>m;
for(i=0;i<m;i++)
{ int a,b;
cin>>a>>b;
couple[a]=b;
couple[b]=a;
}
cin>>n;
for(i=0;i<n;i++)
{ int dog;
cin>>dog;
jud[dog]=1;
}
vector<int> ans;
for( i = 0; i < N; ++i){
if(jud[i] && jud[couple[i]]==0) ans.push_back(i);
}
cout<<ans.size()<<endl;
for(i=0;i<ans.size();i++)
{printf("%05d",ans[i]);
if(i!=ans.size()-1)
cout<<" ";
}
return 0;
}