PAT (Advanced Level) Practise 1121 Damn Single (25)
2016-12-13 15:07
477 查看
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:
510000 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
, x, y;
int a
, g
;
int b
, 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;
}
相关文章推荐
- PAT (Advanced Level) Practise 1121 Damn Single (25)
- PAT (Advanced Level)1121. Damn Single (25)第二个测 4000 试点过不去,求助
- 【PAT】【Advanced Level】1121. Damn Single (25)
- 1016. Phone Bills (25)——PAT (Advanced Level) Practise
- 1070. Mooncake (25)【贪心】——PAT (Advanced Level) Practise
- 1074. Reversing Linked List (25)【链表翻转】——PAT (Advanced Level) Practise
- 1017. Queueing at Bank (25) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1006 Sign In and Sign Out (25)
- PAT (Advanced Level) Practise 1082 Read Number in Chinese (25)
- PAT (Advanced Level) Practise 1025 PAT Ranking (25)
- PAT (Advanced Level) Practise 1075 PAT Judge (25)
- PAT (Advanced Level) Practise 1109 Group Photo (25)
- PAT (Advanced Level) Practise 1020. Tree Traversals (25)
- 1028. List Sorting (25)【排序】——PAT (Advanced Level) Practise
- 1043. Is It a Binary Search Tree (25)【二叉树】——PAT (Advanced Level) Practise
- 1071. Speech Patterns (25)【字符串操作】——PAT (Advanced Level) Practise
- 1075. PAT Judge (25)【排序】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1007 Maximum Subsequence Sum (25)
- PAT (Advanced Level) Practise 1089 Insert or Merge (25)
- PAT (Advanced Level) Practise 1083 List Grades (25)