1671. Anansi's Cobweb（并查集）

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<stdlib.h>
using namespace std;
#define N 100010
int p
,father
,a,b,f
;
int pp
;
struct node
{
int x,y;
}ed
;
int find(int x)
{
if(father[x]!=x)
father[x] = find(father[x]);
return father[x];
}
void add(int a,int b)
{
int x = find(a);
int y = find(b);
if(x!=y)
father[x] = y;
}
int main()
{
int i,n,m,q;
while(scanf("%d%d",&n,&m)!=EOF)
{
memset(f,0,sizeof(f));
for(i =1; i <= n ; i++)
father[i] = i;
for(i = 1; i <= m ; i++)
{
scanf("%d%d",&ed[i].x,&ed[i].y);
}
scanf("%d",&q);
for(i = 1; i <= q ;i++)
{
scanf("%d",&p[i]);
f[p[i]] = 1;
}
for(i = 1; i <= m ; i++)
{
if(!f[i])
add(ed[i].x,ed[i].y);
}
int num = 0;
for(i = 1; i <= n ; i++)
if(father[i]==i)
num++;
pp[1] = num;
int o = 1;
for(i = q ; i>1 ; i--)
{
int x = find(ed[p[i]].x);
int y = find(ed[p[i]].y);
if(x==y)
{
pp[++o] = num;
continue;
}
else
{
father[x] = y;
num--;
pp[++o] = num;
}
}
for(i = o ; i > 1 ; i--)
printf("%d ",pp[i]);
printf("%d\n",pp[1]);
}
return 0;
}