題目:
https://www.nowcoder.com/practice/e7ed657974934a30b2010046536a5372
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
| #include <bits/stdc++.h>
#define MAXN 1000005
using namespace std;
vector<int> v(MAXN), f(MAXN), sz(MAXN);
int find(int a){
return ((f[a] == a) ? a : (f[a] = find(f[a])));
}
bool isSameSet(int a, int b){
return find(a) == find(b);
}
void Union(int a, int b){
int fa = find(a);
int fb = find(b);
if(fa != fb){
if(sz[fa] >= sz[fb]){
sz[fa] += sz[fb];
f[fb] = fa;
}
else{
sz[fb] += sz[fa];
f[fa] = fb;
}
}
}
int main(){
int n, m;
cin >> n >> m;
for(int i=0; i<=n; ++i){
f[i] = i;
sz[i] = 1;
}
int op, x, y;
while(m--){
cin >> op >> x >> y;
if(op == 1){
if(isSameSet(x, y)) printf("Yes\n");
else printf("No\n");
}
else Union(x, y);
}
return 0;
}
|
