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
| class Solution {
private static int N = 100010, M = 2 * N, INF = 0x3f3f3f3f;
private static int[] he = new int[N], e = new int[M], ne = new int[M];
private static int[] dist = new int[N];
int index;
private void add(int a, int b) {
e[index] = b;
ne[index] = he[a];
he[a] = index++;
}
public int networkBecomesIdle(int[][] edges, int[] patience) {
int n = patience.length;
Arrays.fill(he, -1);
Arrays.fill(dist, INF);
for (int[] edge : edges) {
add(edge[0], edge[1]);
add(edge[1], edge[0]);
}
Deque<Integer> queue = new ArrayDeque<>();
queue.offer(0);
dist[0] = 0;
while (!queue.isEmpty()) {
int cur = queue.poll();
for (int i = he[cur]; i != -1; i = ne[i]) {
int j = e[i];
if (dist[j] != INF) continue;
dist[j] = dist[cur] + 1;
queue.offer(j);
}
}
int ans = 0;
for (int i = 1; i < n; ++i) {
int d = dist[i] * 2, t = patience[i];
int cur = d <= t ? d : (d - 1) / t * t + d;
if (cur > ans) ans = cur;
}
return ans + 1;
}
}
|
wechat
