-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathKefaAndPark.java
134 lines (105 loc) · 3.48 KB
/
KefaAndPark.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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class KefaAndPark {
public static void main(String[] args) {
FastReader fr = new FastReader();
int numVerticies = fr.nextInt();
int maxConsecutiveCats = fr.nextInt();
ArrayList<ArrayList<Integer>> tree = new ArrayList<ArrayList<Integer>>();
Set<Integer> restaurantsCanVisit = new HashSet<>();
int[] isCat = new int[numVerticies + 1];
for (int i = 1; i <= numVerticies; i++) {
isCat[i] = fr.nextInt();
}
for (int i = 0; i <= numVerticies; i++) {
tree.add(new ArrayList<>());
}
for (int i = 0; i < numVerticies - 1; i++) {
int x = fr.nextInt();
int y = fr.nextInt();
tree.get(x).add(y);
tree.get(y).add(x);
}
Set<Integer> visited = new HashSet<>();
findAllRoutes(tree, visited, restaurantsCanVisit, 1, isCat, maxConsecutiveCats, 0);
System.out.println(restaurantsCanVisit.size());
}
public static void findAllRoutes(ArrayList<ArrayList<Integer>> tree, Set<Integer> visited, Set<Integer> restaurantsCanVisit, int currNode, int[] isCat, int maxConsecutiveCats, int consectutiveCats) {
visited.add(currNode);
if (isCat[currNode] == 1) {
consectutiveCats++;
} else {
consectutiveCats = 0;
}
if (consectutiveCats > maxConsecutiveCats) {
return;
}
if (currNode != 1 && tree.get(currNode).size() == 1) {
restaurantsCanVisit.add(currNode);
return;
}
for (int childNode : tree.get(currNode)) {
if (!visited.contains(childNode)) {
findAllRoutes(tree, visited, restaurantsCanVisit, childNode, isCat, maxConsecutiveCats, consectutiveCats);
}
}
}
/** HELPER */
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(
new InputStreamReader(System.in));
}
int[] nextLineAsIntArray(int n) {
int[] result = new int[n];
for (int i = 0; i < n; i++) {
result[i] = nextInt();
}
return result;
}
long[] nextLineAsLongArray(int n) {
long[] result = new long[n];
for (int i = 0; i < n; i++) {
result[i] = nextLong();
}
return result;
}
String next()
{
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
}
catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() { return Integer.parseInt(next()); }
long nextLong() { return Long.parseLong(next()); }
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try {
str = br.readLine();
}
catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}