"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<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn=100010;
int h[maxn]={0},cp[maxn]={0},a[maxn];
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
int a,b;
scanf("%d%d",&a,&b);
h[a]=i+1;
h[b]=i+1;
}
int m;
scanf("%d",&m);
vector<int> ans;
for(int i=0;i<m;i++)
{
scanf("%d",&a[i]);
if(h[a[i]]==0)
ans.push_back(a[i]);
else
{
cp[h[a[i]]]++;
}
}
for(int i=0;i<m;i++)
{
if(h[a[i]]!=0&&cp[h[a[i]]]!=2)
ans.push_back(a[i]);
}
sort(ans.begin(),ans.end());
printf("%d\n",ans.size());
for(int i=0;i<ans.size();i++)
{
printf("%05d",ans[i]);
if(i<ans.size()-1)printf(" ");
else printf("\n");
}
return 0;
}