PAT 甲级 1121. Damn Single (25)

最新推荐文章于 2022-11-22 09:54:50 发布

原创最新推荐文章于 2022-11-22 09:54:50 发布 · 244 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

PAT甲级同时被 2 个专栏收录

132 篇文章

订阅专栏

set

4 篇文章

订阅专栏

本文介绍了一种用于识别派对中单身人士的算法。该算法通过输入已知情侣的ID来找出独自参加派对的人，并按ID升序输出。

“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 <cstring>
#include <set>
#include <cstdio>
using namespace std;

int main()
{
    int n,m;
    int a,b;
    int couple[100000];
    memset(couple,-1,sizeof(couple));
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>a>>b;
        couple[a]=b;
        couple[b]=a;
    }
    cin>>m;
    int guest[m];
    for(int i=0;i<m;i++)
    {
       cin>>guest[i];
    }
    set<int> s;
    for(int i=0;i<m;i++)
    {
        if(couple[guest[i]]==-1)
            s.insert(guest[i]);
            else{
                    int j;
                for(j=0;j<m;j++)
                {
                    if(guest[j]==couple[guest[i]])
                        break;
                }
                if(j==m)
                s.insert(guest[i]);
            }
    }
    printf("%d\n",s.size());
    for(set<int>::iterator it=s.begin();it!=s.end();it++){
            if(it!=s.begin())
            printf(" ");
        printf("%05d",*it);
    }
    return 0;
}