离线并查集
代码
//By AcerMo
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int M=400005;
int n,m,fa[M],t,num;
int jud[M],vis[M],ans[M],siz[M];
struct edge
{
int fr,to,id;
edge(){id=0;}
friend bool operator <(edge a, edge b)
{
return a.id<b.id;
}
}e[M];
inline int read()
{
int x=0;char ch=getchar();
while (ch>'9'||ch<'0') ch=getchar();
while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x;
}
inline int find(int x)
{
if (x!=fa[x]) fa[x]=find(fa[x]);
return fa[x];
}
inline void unionn(int x,int y)
{
if (siz[x]<=siz[y]) siz[y]+=siz[x],fa[x]=y;
else siz[x]+=siz[y],fa[y]=x;
return ;
}
inline void constt()
{
for (int i=0;i<=n;i++) fa[i]=i,siz[i]=1;
return ;
}
int main()
{
n=read();m=read();num=n;constt();
for(int i=1;i<=m;i++)
e[i].fr=read(),e[i].to=read();
t=read();
for(int i=1;i<=t;i++)
jud[i]=read(),vis[jud[i]]=t-i+1;
for(int i=1;i<=m;i++)
e[i].id=max(vis[e[i].fr],vis[e[i].to]);
sort(e+1,e+1+m);
for(int i=0,j=1;i<=t;i++)
{
for(;e[j].id==i;j++)
{
int r1=find(e[j].fr);
int r2=find(e[j].to);
if (r1!=r2) unionn(r1,r2),num--;
}
ans[i]=num-(t-i);
}
for(int i=t;i>=0;i--) printf("%d\n",ans[i]);
return 0;
}