-
Notifications
You must be signed in to change notification settings - Fork 0
/
fertilizingpastures.java
79 lines (70 loc) · 2.12 KB
/
fertilizingpastures.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
import java.util.*;
import java.io.*;
public class fertilizingpastures {
static ArrayList<Integer>[] adj;
static long[] A;
static long[][] dp;
static long[] sum, sz, dep;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int T = Integer.parseInt(st.nextToken());
adj = new ArrayList[N];
A = new long[N];
sum = new long[N];
sz = new long[N];
dep = new long[N];
dp = new long[N][2];
for(int i = 0; i < N; i++) adj[i] = new ArrayList<>();
for(int b = 1; b < N; b++) {
st = new StringTokenizer(br.readLine());
int a = Integer.parseInt(st.nextToken())-1;
A[b] = Long.parseLong(st.nextToken());
adj[a].add(b);
adj[b].add(a);
}
br.close();
dfs(0, -1);
if(T == 0) System.out.println((sz[0]-1)*2 + " " + dp[0][0]);
else System.out.println((sz[0]-1)*2-dep[0] + " " + dp[0][1]);
}
public static void dfs(int curr, int par) {
sum[curr] = A[curr];
sz[curr] = 1;
ArrayList<Integer> cs = new ArrayList<>();
for(int to: adj[curr]) {
if(to == par) continue;
dfs(to, curr);
sum[curr] += sum[to];
sz[curr] += sz[to];
dp[curr][0] += dp[to][0];
dep[curr] = Math.max(dep[curr], dep[to]+1);
cs.add(to);
}
Collections.sort(cs, (a, b) -> Long.compare(sum[b] * sz[a], sum[a] * sz[b]));
long elapsed = 1;
long[] ps = new long[cs.size()], save = new long[cs.size()];
for(int i = 0; i < cs.size(); i++) {
int to = cs.get(i);
ps[i] = sum[to]; if(i > 0) ps[i] += ps[i-1];
dp[curr][0] += sum[to] * elapsed;
save[i] = sum[to] * elapsed;
elapsed += sz[to] * 2;
}
if(cs.size() == 0) ;
else {
dp[curr][1] = Long.MAX_VALUE;
for(int i = 0; i < cs.size(); i++) {
int to = cs.get(i);
if(dep[to] == dep[curr]-1) {
long newTime = dp[curr][0];
newTime -= dp[to][0] + save[i];
newTime += dp[to][1] + sum[to] * (elapsed - sz[to] * 2);
newTime -= (ps[cs.size()-1] - ps[i]) * sz[to] * 2;
dp[curr][1] = Math.min(dp[curr][1], newTime);
}
}
}
}
}