这里有一只正在打板的蒟蒻

#include<iostream>
#include<cmath>
#define maxn 999999
using namespace std;
int n, m,f[maxn];
int find(int a) {
	if (f[a] == a) {
		return a;
	}
	else {
		f[a] = find(f[a]);
	}
}
int main() {
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		f[i] = i;
	}
	for(int i = 0; i < m; i++) {
		int x, y, z;
		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;
}