Luogu1197 [JSOI2008]星球大战

题目链接

https://www.luogu.org/problemnew/show/P1197

题解

并查集水过。。。
想必顺着题意只能暴力了，因为涉及到拆点很麻烦
所以我们反着来（笑）
仔细想想，反着来不就是建点了吗///233
于是并查集判断联通块，OK大功告成
eg:那个数据范围是真的坑！！！
1 <= n <= 2m 硬生生看成 1 <= m <= 2n
60分RE了半天...

#include<cstdio>
#include<cstring>
const int MAXN = 400001; //n <= 2m！！！

int fir[MAXN], nxt[MAXN << 1], to[MAXN << 1], from[MAXN << 1], cnt;
int fa[MAXN], goal[MAXN], tot, ans[MAXN];
bool flag[MAXN];

inline int read(){
	int k = 0; char ch = getchar();
	while(ch < '0' || ch > '9') ch = getchar();
	while(ch >= '0' && ch <= '9') {k = k*10 + ch - '0'; ch = getchar();}
	return k;
}

inline void add_edge(int a, int b){
	from[cnt] = a; to[cnt] = b; nxt[cnt] = fir[a]; fir[a] = cnt++;
}

int get(int t){
	if(fa[t] != t) fa[t] = get(fa[t]);
	return fa[t]; 
}

inline bool Connect(int a, int b){
	int A = get(a), B = get(b);
	if(A != B){
		fa[A] = B;
		tot--; //联通块个数-1 
	}
}

int main(){
	freopen("in.txt", "r", stdin);
	memset(fir, -1, sizeof(fir));
	int n = read(), m = read();
	for(int i = 0; i < n; i++){
		fa[i] = i;
	}
	for(int i = 1; i <= m; i++){
		int a = read(), b = read();
		add_edge(a, b);
		add_edge(b, a);
	}
	
	int k = read();
	tot = n - k;
	
	for(int i = 1; i <= k; i++){
		goal[i] = read(); //第i次的目标 
		flag[goal[i]] = true;
	}
	
	for(int i = 0; i < m; i++){
		int u = from[i << 1], v = to[i << 1];
		if(!flag[u] && !flag[v])
			Connect(u, v);
	}
	
	ans[k] = tot;
	for(int j = k; j >= 1; j--){
		int u = goal[j]; //修好第j个 
		flag[u] = false;
		tot++; //联通块+1 
		for(int i = fir[u]; i != -1; i = nxt[i]){
			int v = to[i];
			if(!flag[v])
				Connect(u, v); //连接 
		}
		ans[j - 1] = tot; //注意，修好第j个被破坏的，得出结果是第j-1次后剩下的联通块个数 
	}
	for(int i = 0; i <= k; i++)
		printf("%d\n", ans[i]);
	return 0;
}