"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 題目大意 給出n對夫妻,再給出m個參加party的人,問這m個人中單身的人有幾個並且按從小到大的順序輸出這幾個人。 解題思路 用一個數組mp[]來存儲n對夫妻的信息,用vis[]來存儲參加party的人。 對每個參加party的人:(1)沒有配偶;(2)有配偶但是配偶沒在party中;(3)有配偶並且配偶也在party中。 顯然對於(1)(2)是應該輸出的。即mp==-1和!vis[]的人。 代碼
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <cstdlib>
#include <climits>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
const int MAXN = 100000 + 5;
const int MAXM = 10000 + 5;
const int INF = 0x7f7f7f7f;
template <class XSD> inline XSD f_min(XSD a, XSD b) { if (a > b) a = b; return a; }
template <class XSD> inline XSD f_max(XSD a, XSD b) { if (a < b) a = b; return a; }
int n, m;
int mp[MAXN], digit[MAXM];
int vis[MAXN];
void Getdata(int n){
int x, y;
memset(vis, 0, sizeof vis);
memset(mp, -1, sizeof mp);
for(int i=0; i<n; i++){
scanf("%d%d", &x, &y);
mp[x] = y;
mp[y] = x;
}
scanf("%d", &m);
for(int i=0; i<m; i++) {
scanf("%d", &digit[i]);
vis[digit[i]] = 1;
}
}
void Solve(){
int ans[MAXM], cnt=0;
for(int i=0; i<m; i++){
int x=digit[i], y=mp[x];
if(y==-1) ans[cnt++]=x;//沒有伴侶
else{
if(!vis[y]) ans[cnt++]=x;//有伴侶,但是沒來
}
}
printf("%d\n", cnt);
sort(ans, ans+cnt);
for(int i=0; i<cnt; i++) printf("%05d%c", ans[i], i==(cnt-1)?'\n':' ');
}
int main(){
while(~scanf("%d", &n)){
Getdata(n);
Solve();
}
return 0;
}