Ural 1671. Anansi's Cobweb

PRO IS HERE

Union_Find set:

并查集。

注意我们从后往前加边，离线算法。

如果有某条边删除两次以上，只保留较早的那个删除操作，实现时用vis判断。

CODE:

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<sstream>
#include<iostream>
using namespace std;

#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define DOR(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define bug puts("Fuck");
#define LL long long
#define pb push_back
#define mp make_pair

#define nMax 100010
#define eps 1e-8
#define inf 0x7fffffff

struct E{
	int u,v;
	void read(){scanf("%d%d",&u,&v);}
} e[nMax];

int fa[nMax];
int n,m,q;
int find(int x){
	if(x==fa[x]) return fa[x];
	return fa[x] = find(fa[x]);
}
void init(int n){
	FOR(i,1,n) fa[i]=i;
}
int Union(E e){
	int x=find(e.u),y=find(e.v);
	if(x==y) return 0;
	else fa[y]=x;
	return 1;
}
int ans[nMax],b[nMax],vis[nMax];


int main(){
#ifndef ONLINE_JUDGE
	freopen("input.txt","r",stdin);
//	freopen("output.txt","w",stdout);
#endif
	while(~scanf("%d%d",&n,&m)){
		FOR(i,1,m) e[i].read();
		scanf("%d",&q);
		FOR(i,1,m) vis[i]=0;
		FOR(i,1,q) {
		    scanf("%d",&b[i]);
		    if(vis[b[i]]==1) b[i]=0;
		    else vis[b[i]]=1;
		}
		init(n);
		FOR(i,1,m) if(!vis[i]) n-=Union(e[i]);
		ans[q]=n;
		DOR(i,q,2){
			if(b[i])n-=Union(e[b[i]]) ;
			ans[i-1]=n;
		}
		FOR(i,1,q) {
			if(i>1) printf(" ");
			printf("%d",ans[i]);
		}printf("\n");
	}

	return 0;
}