第十一章模拟19 AcWing 1614. 单身狗-CSDN博客

本文链接：https://blog.csdn.net/T_Y_F_/article/details/128111705

第十一章模拟19 AcWing 1614. 单身狗

原题链接

[AcWing 1614. 单身狗](AcWing 1614. 单身狗)

算法标签

模拟哈希表

思路

依题意模拟

代码

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define int long long
#define xx first
#define yy second
#define ump unordered_map
#define us unordered_set
#define pq priority_queue
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>=b;--i)
using namespace std;
typedef pair<int, int> PII;
const int N=50005, M=10005, inf=0x3f3f3f3f3f3f3f3f, mod=1e9+7;
const double Exp=1e-8;
//int t, n, m, cnt, ans; 
int res[N];
struct Cou{
    int a, b;
}c[N];
inline int rd(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
   return s*w;
}
void put(int x) {
    if(x<0) putchar('-'),x=-x;
    if(x>=10) put(x/10);
    putchar(x%10^48);
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n=rd();
	rep(i, 0, n){
	    c[i].a=rd(), c[i].b=rd();
	}
	us<int> s;
	int m=rd();
	while(m--){
	    int id=rd();
	    s.insert(id);
	}
	rep(i, 0, n){
	    int a=c[i].a, b=c[i].b;
	    if(s.count(a)&&s.count(b)){
	        s.erase(a), s.erase(b);
	    }
	}
	int k=0;
	for(auto x:s){
	    res[k++]=x;
	}
	sort(res, res+k);
	printf("%lld\n", k);
	if(k){
	    printf("%05lld", res[0]);
	    rep(i, 1, k){
	        printf(" %05lld", res[i]);
	    }
	}
	return 0;
}