0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-27 09:11:58 +00:00
OI-codes/Luogu/problem/P3367/P3367.cpp

28 lines
463 B
C++
Raw Normal View History

2020-11-01 13:54:10 +00:00
#include<bits/stdc++.h>
using namespace std;
int f[1000005];
int find(int x) {
return f[x] == x ? x : f[x] = find(f[x]);
}
int main() {
int n, m, z, x, y;
cin >> n >> m;
for(int i = 0; i < n ; i++) {
f[i] = i;
}
while(m--) {
cin >> z >> x >> y;
if(z == 1) {
f[find(x)] = find(y);
}
else {
cout << (find(x) == find(y) ? "Y" : "N") << endl;
}
}
return 0;
}