-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathWar.java
89 lines (78 loc) · 2.26 KB
/
War.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
81
82
83
84
85
86
87
88
import java.util.*;
public class War {
private final int[] friends;
private final int n;
public War(int n) {
this.n = n;
friends = new int[2 * (n + 1)];
for (int i = 0; i < 2 * (n + 1); ++i) {
friends[i] = i;
}
}
public int enemy(int i) {
return i + n;
}
public int find(int i) {
if (friends[i] != i) {
friends[i] = find(friends[i]);
}
return friends[i];
}
public void union(int i, int j) {
if (find(i) != find(j)) {
friends[find(j)] = find(i);
}
}
private boolean setFriends(int i, int j) {
if (areEnemies(i, j)) {
return false;
}
union(i, j);
union(enemy(i), enemy(j));
return true;
}
private boolean setEnemies(int i, int j) {
if (areFriends(i, j)) {
return false;
}
union(i, enemy(j));
union(j, enemy(i));
return true;
}
private boolean areFriends(int i, int j) {
return find(i) == find(j) ||
find(enemy(i)) == find(enemy(j));
}
private boolean areEnemies(int i, int j) {
return find(i) == find(enemy(j)) ||
find(j) == find(enemy(i));
}
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
War war = new War(s.nextInt());
while (s.hasNextInt()) {
switch (s.nextInt()) {
case 0:
return;
case 1:
if (!war.setFriends(s.nextInt(), s.nextInt())) {
System.out.println(-1);
}
break;
case 2:
if (!war.setEnemies(s.nextInt(), s.nextInt())) {
System.out.println(-1);
}
break;
case 3:
System.out.println(war.areFriends(s.nextInt(), s.nextInt()) ? 1 : 0);
break;
case 4:
System.out.println(war.areEnemies(s.nextInt(), s.nextInt()) ? 1 : 0);
break;
default:
throw new IllegalArgumentException();
}
}
}
}