a1121 Damn Single （set）

1121 Damn Single (25 分)

"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 (≤ 50,000), 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 (≤ 10,000) 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

题意：给出每队情侣的双方名字。有m个人参加宴会，问m个人中有多少个是一个人来的，按照id递增顺序输出。

思路：建立一个couple数组，初始化为-1，储存每对情侣的信息。couple[a]=[b]表示a的爱人是b。

qury[],用来保存所有客人。

对所有客人都标记为true，如果某人的爱人不为true，代表ta独身一人参加，则插入集合中，最后输出集合。

#include <iostream>
#include "set"

using namespace std;
int couple[100010];
bool aa[100010];
int main() {
    int n;
    int a,b;
    cin>>n;
    fill(couple,couple+100010,-1);
    for (int i = 0; i < n; ++i) {
        cin>>a>>b;
        couple[a]=b;
        couple[b]=a;
    }
    int k,m;
    cin>>k;
    int qury[k];
    set<int> ans;
    for (int i = 0; i < k; ++i) {
        cin>>m;
        qury[i]=m;
        aa[m]= true; //给每个客人标记为true
    }
    for (int i = 0; i < k; ++i) {
        int temp=qury[i];  //客人
        int wf=couple[temp];  //客人的爱人
        if (!aa[wf]) ans.insert(temp);  //如果客人的爱人是false，说明客人的爱人不在客人名单里，说明是独身一人。
    }
    cout<<ans.size()<<endl;
    for (auto i = ans.begin(); i !=ans.end() ; ++i) {
        if (i==ans.begin()) printf("%05d",*i);
        else printf(" %05d",*i);
    }
}