并查集

动图解释：

Code：

 

#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define MAX 10005
using namespace std;

int p[MAX];

void init(int n)
{
	for (int i = 1; i <= n; i++)
		p[i] = i;
}

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

void unit(int x, int y)
{
	int a = find(x);
	int b = find(y);
	if (a == b)
		return;
	p[b] = p[a];
}

int same(int x, int y)
{
	return find(x) == find(y);
}

int main()
{
	ios::sync_with_stdio(0);
	int n, q, com;
	cin >> n >> q;
	init(n);
	while (q--) {
		int x, y;
		cin >> com >> x >> y;
		if (com == 0)
			unit(x, y);
		else
			cout << same(x, y) << endl;
	}
	return 0;
}