BZOJ 1015 [JSOI2008]星球大战starwar【并查集】

想了很久。

无解。

然后看了题解。

看到最上面四个字：“逆向处理”

然后瞬间懂完了！

正难则反！！！！

然后就是一道水题了！！！

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define db double
#define sg string
#define ll long long
#define rel(i,x,y) for(ll i=(x);i<(y);i++)
#define rep(i,x,y) for(ll i=(x);i<=(y);i++)
#define red(i,x,y) for(ll i=(x);i>=(y);i--)
#define res(i,x) for(ll i=head[x];i;i=nxt[i])
using namespace std;

const ll N=4e5+5;
const ll Inf=1e18;
const db Eps=1e-10;

ll n,m,k,ret,f[N],ans[N],vis[N],atk[N];
ll cnt,from[N],to[N],nxt[N],head[N];

inline ll read() {
	ll x=0;char ch=getchar();bool f=0;
	while(ch>'9'||ch<'0'){if(ch=='-')f=1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return f?-x:x;
}

ll find(ll x) {
	return f[x]==x?x:f[x]=find(f[x]);
}

void merge(ll x,ll y) {
	ll fx=find(x),fy=find(y);
	f[fx]=fy;
}

void ins(ll x,ll y) {
	++cnt;from[cnt]=x;to[cnt]=y;nxt[cnt]=head[x];head[x]=cnt;
}

int main() {
	n=read(),m=read();
	
	rep(i,1,n) f[i]=i;
	
	rep(i,1,m) {
		ll x=read()+1,y=read()+1;
		ins(x,y);ins(y,x);
	}
	
	k=read();
	
	rep(i,1,k) 	atk[i]=read()+1,vis[atk[i]]=1;
	
	ret=n-k;
	
	rep(i,1,cnt) {
		ll x=from[i],y=to[i];
		if(!vis[x]&&!vis[y]&&find(x)!=find(y)) merge(x,y),ret--;
	}
	
	ans[++ans[0]]=ret;

	red(i,k,1) {
		ret++;
		ll x=atk[i];vis[x]=0;
		res(j,x) {
			ll y=to[j];
			if(!vis[y]&&find(x)!=find(y)) merge(x,y),ret--;
		}
		ans[++ans[0]]=ret;
	}
	
	red(i,ans[0],1) printf("%lld\n",ans[i]);

	return 0;
}