并查集

#include<iostream>
#include<cstdio>
using namespace std;
int f[10005]; 
inline int find(int x){
	if(x != f[x]) f[x] = find(f[x]);
	return f[x];
}//路径压缩
void join(int a, int b){
     if(find(a) != find(b)) f[find(a)] = find(b);
}//合并
int main(){
	int n, m,z,x,y;
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		f[i] = i;
	}//并查集初始化
	for(int i = 0; i < m; i++){
		scanf("%d%d%d",&z,&x,&y);
		if(z == 1){
			join(x,y);
		}
		if(z == 2){
			if(find(x) == find(y)){
				printf("Y\n");
			}else{
				printf("N\n");
			}
		}
	}
	return 0;
}