-
Notifications
You must be signed in to change notification settings - Fork 0
/
balancingtree.java
61 lines (47 loc) · 1.48 KB
/
balancingtree.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
//
import java.util.*;
import java.io.*;
public class balancingtree {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int T = Integer.parseInt(st.nextToken());
int B = Integer.parseInt(st.nextToken());
for(int t = 0; t < T; t++) {
st = new StringTokenizer(br.readLine());
int N = Integer.parseInt(st.nextToken());
int[] P = new int[N];
int[] L = new int[N], R = new int[N];
int[] mn = new int[N], mx = new int[N];
st = new StringTokenizer(br.readLine());
for(int i = 1; i < N; i++)
P[i] = Integer.parseInt(st.nextToken())-1;
int res = 0;
int gMn = Integer.MAX_VALUE, gMx = Integer.MIN_VALUE;
for(int i = 0; i < N; i++) {
st = new StringTokenizer(br.readLine());
L[i] = Integer.parseInt(st.nextToken());
R[i] = Integer.parseInt(st.nextToken());
if(i == 0) {
mn[i] = R[i];
mx[i] = L[i];
}
mn[i] = Math.min(mn[P[i]], R[i]);
mx[i] = Math.max(mx[P[i]], L[i]);
gMn = Math.min(mn[i], gMn);
gMx = Math.max(gMx, mx[i]);
res = Math.max(res, mx[i] - mn[i]);
}
res = Math.max(res, (gMx-gMn+1)/2);
System.out.println(res);
if(B == 1) {
for(int i = 0; i < N; i++) {
System.out.print(Math.max(Math.min(res + gMn, R[i]), L[i]));
if(i < N-1) System.out.print(" ");
}
System.out.println();
}
}
br.close();
}
}