LA -3644 X-Plosives -并查集

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <vector>
using namespace std; 
 
int fa[100005];

int find(int x)
{
	if (fa[x]==x) return x;
	return fa[x]=find(fa[x]);
}

int main()
{
	int a,b,i;
	for (i=1;i<=100005;i++)
		fa[i]=i;

	int cun=0;
	while(scanf("%d",&a)!=EOF)
	{

		if (a!=-1)
		{
			scanf("%d",&b);
			int fx=find(a);
			int fy=find(b);
			if (fx!=fy)
			{
				if (fa[fx]!=fx)
				fa[fy]=fx;
				else
				fa[fx]=fy;
			}
			else
			{
				cun++;
			}
			continue;
		}
		printf("%d\n",cun);
		cun=0;
		for (i=1;i<=100005;i++)
		fa[i]=i;

	}
 
	
	return 0;
}