P3367

#include <bits/stdc++.h>
using namespace std;
//模板并查集
typedef long long ll;
const int N = 1e4 + 10;
int n, m, u, v, op;
int fa[10000];

//找老大的过程中要压缩路径
int Find(int x) {
	if (fa[x] == x) {
		return x;
	} else {
		return fa[x] = Find(fa[x]);
	}
}
void Union(int a, int b) {
	int faa = Find(a);
	int fab = Find(b);
	if (faa != fab) {
		fa[fab] = faa;
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> m >> n;
	for (int i = 1; i <= n; i++) {
		fa[i] = i;
	}
	while (m--) {
		cin >> op >> u >> v;
		if (op == 1) {
			Union(n, v);
		} else {
			if (Find(u) == Find(v)) {
				cout << "Y\n";
			} else {
				cout << "N\n";
			}
		}
	}
	return 0;
}

测试点信息 3ms/556.00KB WA #1 Wrong Answer.

#2 Runtime Error.

#3 Wrong Answer.

#4 Wrong Answer.

#5 Wrong Answer.

#6 Wrong Answer.

#7 Wrong Answer.

#8 Wrong Answer.

#9 Runtime Error.

#10 Runtime Error.