并查集模板

#include <iostream>
using namespace std;

int n, m, z, x, y, f[10010];

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

int main()
{
//freopen("a.in", "r", stdin);
//freopen("a.out", "w", stdout);

	cin >> n >> m;
	for (int i = 1; i <= n; ++ i) f[i] = i;
	while (m --)
	{
		cin >> z >> x >> y;
		if (z == 1)
		{
			f[find(x)] = find(y);
		}
		else
		{
			if (find(x) == find(y))
			{
				cout << 'Y' << endl;
			}
			else
			{
				cout << 'N' << endl;
			}
		}
	}
	return 0;
}