并查集【模版】

https://www.luogu.org/problem/P3367

#include<bits/stdc++.h>
using namespace std;

int f[10005];

int find(int a)
{
	if(f[a]==a) return a;
	return f[a]=find(f[a]);
}

int main()
{
	int N,M;
	cin >> N >> M;
	for(int i=1;i<=N;i++)
	{
		f[i]=i;
	}
	while(M--)
	{
		int z,x,y;
		cin >> z >> x >> y ;
		if(z==1)
		{
			f[find(x)]=find(y);
		}
		else
		{
			if(find(x)==find(y))
			printf("Y\n");
			else
			printf("N\n");
		}
	}
	return 0;
}