luogu P1197 星球大战

离线做相反处理 并查集 

#include <iostream>
#include <cstdio>
using namespace std;
int read()
{
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')  f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return f*x;
}
const int N=500000;
int n,m,k,fa[N],had[N],to[N],nxt[N],p;
int a1,b1,a[N],ans[N],sum;
bool f[N];
void add(int x,int y)
{
	nxt[++p]=had[x];
	to[p]=y;
	had[x]=p;
}
int find(int x)
{
	if(fa[x]==x)  return x;
	return fa[x]=find(fa[x]);
}
int main()
{
	sum=n=read();  m=read();
	for(int i=1;i<=n;i++)  fa[i]=i;
	for(int i=1;i<=m;i++)
	{
		a1=read()+1;  b1=read()+1;
		add(a1,b1);  add(b1,a1);
	}
	k=read();
	for(int i=1;i<=k;i++)
	{
		a[i]=read()+1;
		f[a[i]]=1;
		sum--;
	}
	for(int i=1;i<=n;i++)
	{
		if(f[i])  continue;
	    for(int j=had[i];j;j=nxt[j])
	    {
	    	if(f[to[j]])  continue;
	  		a1=find(i);  b1=find(to[j]);
	  		if(a1==b1)  continue;
	  		fa[b1]=a1;
	  		sum--;
		}
	}
	for(int i=k;i;i--)
	{
	    ans[i]=sum;
		sum++;  f[a[i]]=0;
		for(int j=had[a[i]];j;j=nxt[j])
	    {
	    	if(f[to[j]])  continue;
	  	    a1=find(a[i]);  b1=find(to[j]);
	  	    if(a1==b1)  continue;
	  	    fa[b1]=a1;
	  	    sum--;
	    }
	}
	cout<<sum<<"\n";
	for(int i=1;i<=k;i++)  cout<<ans[i]<<"\n";
	return 0;
}