-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q1717.java
80 lines (64 loc) · 1.67 KB
/
Q1717.java
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
package forRank;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
public class Q1717 {
private static int n;
private static int m;
private static int parent[];
private static int level[];
private static void init(){
parent = new int[n + 1];
level = new int[n + 1];
for (int i = 1; i <= n; i++) {
parent[i] = i;
level[i] = 1;
}
}
private static int find(int u){
if(parent[u] == u)
return u;
return parent[u] = find(parent[u]);
}
private static void merge(int u, int v){
u = find(u);
v = find(v);
if(u == v)
return;
if(level[u] > level[v]){
int temp = u;
u = v;
v = temp;
}
parent[u] = v;
if(level[u] == level[v])
level[v]++;
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenizer st = new StringTokenizer(br.readLine());
n = Integer.parseInt(st.nextToken());
m = Integer.parseInt(st.nextToken());
init();
for (int i = 0; i < m; i++) {
st = new StringTokenizer(br.readLine());
int cmd = Integer.parseInt(st.nextToken());
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
if(cmd == 0){
merge(a, b);
} else if(cmd == 1){
if(find(a) == find(b))
bw.write("YES\n");
else
bw.write("NO\n");
}
}
br.close();
bw.close();
}
}