Submission #52179331

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
N = gets.to_i
E = Array.new(N+1){[]}
(N-1).times{
  a,b = gets.split.map(&:to_i)
  E[a]<<b
  E[b]<<a
}
C = 0,*gets.split.map(&:to_i)
S = [0]*(N+1)
F = lambda{|a,p|
  E[a].each{|b|
    next if b==p
    c,s = F[b,a]
    C[a] += c
    S[a] += s
  }
  next C[a],S[a]+C[a]
}
C[0],S[0] = F[1,0]
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

N = gets.to_i
E = Array.new(N+1){[]}
(N-1).times{
	a,b = gets.split.map(&:to_i)
	E[a]<<b
	E[b]<<a
}
C = 0,*gets.split.map(&:to_i)
S = [0]*(N+1)

F = lambda{|a,p|
	E[a].each{|b|
		next if b==p
		c,s = F[b,a]
		C[a] += c
		S[a] += s
	}
	next C[a],S[a]+C[a]
}
C[0],S[0] = F[1,0]

G = lambda{|a,p|
	c,s = C[a],S[a]
	pc,ps = C[p]-c,S[p]-s-c
	C[a] += pc
	S[a] += ps+pc
	E[a].each{|b|
		next if b==p
		G[b,a]
	}
}
G[1,0]

p S.min

Submission Info

Judge Result