PAT (Advanced Level) Practise 1121 Damn Single (25)

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

_Occult_

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

阅读量530

点赞数

分类专栏： PAT甲级 -----------杂题-----------

本文链接：https://blog.csdn.net/jtjy568805874/article/details/53609880

版权

-----------杂题----------- 同时被 2 个专栏收录

234 篇文章 0 订阅

订阅专栏

PAT甲级

135 篇文章 0 订阅

订阅专栏

1121. 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
统计是单身狗的人，另一半没来也算TAT
简单题，直接标记一下就好了。
#include<cmath>
#include<queue>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define ms(x,y) memset(x,y,sizeof(x))
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define loop(i,j,k) for (int i=j;i!=-1;i=k[i])
#define inone(x) scanf("%d",&x)
#define intwo(x,y) scanf("%d%d",&x,&y)
#define inthr(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define lson x<<1,l,mid
#define rson x<<1|1,mid+1,r
const int N = 1e5 + 10;
const int INF = 0x7FFFFFFF;
int n, f[N], x, y;
int a[N], g[N];
int b[N], c;

int main()
{
  inone(n);
  rep(i, 1, n)
  {
    intwo(x, y);
    f[x] = y; f[y] = x;
  }
  inone(n);
  rep(i, 1, n) inone(a[i]), g[a[i]] = 1;
  rep(i, 1, n) if (!g[f[a[i]]]) b[c++] = a[i];
  sort(b, b + c);
  printf("%d\n", c);
  rep(i, 0, c - 1)
  {
    printf("%s%05d", i ? " " : "", b[i]);
  }
  return 0;
}