P3144 [USACO16OPEN]Closing the Farm S(逆并查集)

P3144 [USACO16OPEN]Closing the Farm Shttps://www.luogu.com.cn/problem/P3144

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)

int n, m;
int pre[MAXN];
int find(int x) {
	if (pre[x] == x) {
		return x;
	}
	return pre[x] = find(pre[x]);
}

inline void unite(int x, int y) {
	x = find(x);
	y = find(y);
	pre[x] = y;
}

int x[MAXN], y[MAXN];
int rec[MAXN];
bool broken[MAXN];
int ans[MAXN];
int main() {
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= m; i++) {
		scanf("%d %d", x + i, y + i);
	}
	for (int i = 1; i <= n; i++) {
		pre[i] = i;
	}
	for (int i = 1; i <= n; i++) {
		scanf("%d", rec + i);
		broken[rec[i]] = true;
	}
	for (int i = n; i >= 1; i--) {
		broken[rec[i]] = false;
		for (int j = 1; j <= m; j++) {
			if (!broken[x[j]] && !broken[y[j]]) {
				unite(x[j], y[j]);
			}
		}
		for (int j = 1; j <= n; j++) {
			if (pre[j] == j && !broken[j]) {
				ans[i]++;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		//printf("%d\n", ans[i]);
		if (ans[i] == 1) {
			printf("YES\n");
		} else {
			printf("NO\n");
		}
	}
	return 0;
}