#include<cstdio>
#include<set>
#include<algorithm>
using namespace std;
int n,m;
const int maxn = 100010;
int ans[maxn];
int notsingle[maxn] = { 0 };
int hashtable[maxn] = { 0 };
set<int> s;
int main()
{
int a, b;
scanf("%d", &n);
fill(notsingle, notsingle + maxn, 0);
fill(hashtable, hashtable + maxn, 0);
for (int i = 1; i <= n; i++)
{
scanf("%d%d", &a, &b);
notsingle[a] = notsingle[b] = i;
}
scanf("%d", &m);
for (int i = 0; i < m; i++)
{
scanf("%d", &ans[i]);
hashtable[notsingle[ans[i]]]++;
}
for (int i = 0; i < m; i++)
{
if (hashtable[notsingle[ans[i]]] != 2) s.insert(ans[i]);
}
printf("%d\n", s.size());
int num = 0;
for (set<int>::iterator it = s.begin(); it != s.end(); it++)
{
printf("%05d", *it);//记得是%05d
num++;
if (num != s.size()) printf(" ");
}
printf("\n");
return 0;
}
A1121 Damn Single (25 分)
最新推荐文章于 2021-02-25 16:55:55 发布