ybtoj·并查集【模板】

Description–

高效进阶「图论」第1章 并查集课堂过关 例题1

---

代码–

#include <iostream>
#include <cstdio>

using namespace std;

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

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

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i)
	  f[i] = i;
	for (int i = 1; i <= m; ++i)
	{
		scanf("%d%d%d", &z, &x, &y);
		if (z == 1)
		{
		    f[find(x)] = f[find(y)];
		}
		else
		{
			if (find(x) == find(y))
			  printf("Y\n");
			else printf("N\n");
		}
	}
	
	return 0;
}