RE 求调（调到不 RE 就行，不用调过），全部 RE 了

P3367 【模板】并查集

#include <bits/stdc++.h>
using namespace std;

const int N = 1e4+10;
int n, m, op, x, y, fa[N];

int findfa(int p) {
	if(fa[p] == p) return p;
	findfa(fa[p]);
}

int main() {
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; i++)
		fa[i] = i;
	while(m--) {
		scanf("%d%d%d", &op, &x, &y);
		if(op == 1) {
			int X = findfa(x);
			int Y = findfa(y);
			if(X != Y) fa[Y] = X;
		} else {
			if(findfa(x) == findfa(y))
				printf("Y\n");
			else printf("N\n");
		}
	}
	return 0;
}