题目大意
给出n个点,依次摧毁k个点,求每次摧毁后连通块的个数
题解
正难则反,采用离线做法,求出摧毁后连通块的个数,倒着将摧毁的点重新插入,使用并查集维护,即可求出答案。
code
#include<set>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define fo(i,j,k) for(int i=j;i<=k;i++)
#define fd(i,j,k) for(int i=j;i>=k;i--)
using namespace std;
int const maxn=400000,maxm=200000;
int n,m,k,cntgra,to[maxm*2+10],next[maxm*2+10],begin[maxn+10],destroy[maxn+10],father[maxn+10],
ans[maxn+10];
bool destroied[maxn+10];
void insert(int u,int v){
to[++cntgra]=v;
next[cntgra]=begin[u];
begin[u]=cntgra;
}
int getfather(int x){
if(father[x]==0)return x;
return father[x]=getfather(father[x]);
}
int main(){
scanf("%d%d",&n,&m);
fo(i,1,m){
int x,y;scanf("%d%d",&x,&y);x++;y++;
insert(x,y);
insert(y,x);
}
scanf("%d",&k);
fo(i,1,k){
scanf("%d",&destroy[i]);destroy[i]++;
destroied[destroy[i]]=1;
}
int block=n-k;
fo(i,1,n)
for(int j=begin[i];j;j=next[j])
if((!destroied[i])&&(!destroied[to[j]])){
int fi=getfather(i),fj=getfather(to[j]);
if(fi!=fj){
block--;
father[fi]=fj;
}
}
fd(i,k,0){
ans[i]=block++;
int now=destroy[i];
destroied[now]=0;
for(int j=begin[now];j;j=next[j])
if((!destroied[now])&&(!destroied[to[j]])){
int fi=getfather(now),fj=getfather(to[j]);
if(fi!=fj){
block--;
father[fi]=fj;
}
}
}
fo(i,0,k)printf("%d\n",ans[i]);
return 0;
}