并查集
因为删点很难搞,我们考虑倒过来加点,这样就很简单了。并查集直接上就行了。
注意一些细节。
代码:
#include<cctype>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define N 400005
#define F inline
using namespace std;
struct edge{ int next,to; }ed[N];
int n,m,k,q,sum,h[N],a[N],fa[N],ans[N];
bool f[N];
F char readc(){
static char buf[100000],*l=buf,*r=buf;
if (l==r) r=(l=buf)+fread(buf,1,100000,stdin);
if (l==r) return EOF; return *l++;
}
F int _read(){
int x=0; char ch=readc();
while (!isdigit(ch)) ch=readc();
while (isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=readc();
return x;
}
F void writec(int x){ if (x>9) writec(x/10); putchar(x%10+48); }
F int _write(int x){ writec(x),putchar('\n'); }
F void addedge(int x,int y){ ed[++k]=(edge){h[x],y},h[x]=k; }
F int findfa(int x){ return x==fa[x]?x:fa[x]=findfa(fa[x]); }
int main(){
sum=n=_read(),m=_read();
for (int i=1,x,y;i<=m;i++)
x=_read()+1,y=_read()+1,addedge(x,y),addedge(y,x);
q=_read(),sum-=q;
for (int i=1;i<=q;i++) a[i]=_read()+1,f[a[i]]=true;
for (int i=1;i<=n;i++) fa[i]=i;
for (int x=1;x<=n;x++)
if (!f[x])
for (int i=h[x],fx,fy,v;i;i=ed[i].next)
if (!f[v=ed[i].to]&&(fx=findfa(x))!=(fy=findfa(v)))
fa[fx]=fy,sum--;
for (int x=q;x;x--){
f[a[x]]=false; int num=0;
for (int i=h[a[x]],fx,fy,v;i;i=ed[i].next)
if (!f[v=ed[i].to]&&(fx=findfa(a[x]))!=(fy=findfa(v)))
fa[fx]=fy,ans[x]=sum,num++;
ans[x]=sum,sum=sum-num+1;
}
printf("%d\n",sum);
for (int i=1;i<=q;i++) _write(ans[i]);
return 0;
}