1121. Damn Single (25)（单身狗）

1. 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<algorithm>#include<cstdio>using namespace std;int dame[100005];int person[100005];int ans[100005];int index1=0;int n,m,a,b;int f(int num){    for (int i=0;i<m;i++)    {        if (person[i]==num)            return 1;    }    return 0;}int main(){    cin>>n;    for (int i=0;i<100005;i++)        dame[i]=-1;    for(int i=0;i<n;i++)    {        cin>>a>>b;        dame[a]=b;        dame[b]=a;    }    cin>>m;    for (int i=0;i<m;i++)    {        cin>>person[i];    }    sort(person,person+m);    for (int i=0;i<m;i++)    {        if (f(dame[person[i]])!=1)        {            ans[index1++]=person[i];        }    }    cout<<index1<<endl;    if (index1==0) return 0;    printf("%05d",ans[0]);    for (int i=1;i<index1;i++)    {         printf(" %05d",ans[i]);    }    return 0;}