1121 Damn Single

1121 Damn Single
“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
分析：先用map类型存储情侣双方的值。
输入M个数据，先判断是否在情侣中，如果不在，则是单身。
在情侣中，再判断情侣是否在party中，如果不在，则视为单身。
参考代码：

#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<map>
#include<set>
#define N 100008
int a[N];
using namespace std;
int main()
{memset(a, 0, sizeof(int)*(N));map<int, int>couple;set<int>s;int n,m, man, woman;scanf("%d", &n);for (int i = 1; i <= n; i++) {scanf("%d%d", &man, &woman);couple[man] = woman;couple[woman] = man;s.insert(man);s.insert(woman);}scanf("%d", &m);vector<int>res(m);for (int i = 0; i < m; i++) {scanf("%d", &res[i]);a[res[i]] = 1;}vector<int>v;sort(res.begin(), res.end());int flag = 0,  cnt = 0;for (auto val : res) {   //遍历flag = 0;if (s.count(val) == 0)flag = 1;else {int partner = couple[val];if (a[partner] == 0)flag = 1;}if (flag) {cnt++;v.push_back(val);}}printf("%d\n", cnt);flag = 0;if(cnt)for (auto val : v) {if (flag)printf(" "); printf("%05d", val);flag = 1;}return 0;
}

1121 Damn Single相关推荐

PAT甲级1121 Damn Single ：[C++题解]哈希表、结构体
文章目录题目分析题目来源题目分析来源:acwing 思路:一对伴侣存入一个结构体中.查询的集合放入哈希表unordered_set<int> S;中.然后遍历每一对伴侣,如果同时存 ...
1121 Damn Single （25 分）
1121 Damn Single (25 分) "Damn Single (单身狗)" is the Chinese nickname for someone who is bei ...
PAT 1121 Damn Single
1121 Damn Single "Damn Single (单身狗)" is the Chinese nickname for someone who is being sing ...
PAT 甲级 1121 Damn Single
1121 Damn Single (25 point(s)) "Damn Single (单身狗)" is the Chinese nickname for someone who ...
1121. Damn Single (25)
1121. Damn Single (25) 时间限制 300 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue "Dam ...
1121 Damn Single (25分)
1121 Damn Single (25分) "Damn Single (单身狗)" is the Chinese nickname for someone who is bein ...
PAT 甲级1121 Damn Single
1121 Damn Single "Damn Single (单身狗)" is the Chinese nickname for someone who is being sing ...
PAT——1121 Damn Single 甲级
1121 Damn Single 题目题意代码解析 AC代码参考题目 https://pintia.cn/problem-sets/994805342720868352/problems/99 ...
PAT甲级 1121. Damn Single (25)
1121. Damn Single (25) 时间限制 300 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue "Dam ...

1121 Damn Single

1121 Damn Single相关推荐

最新文章

热门文章