Submission #14435898

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
A = gets.split.map(&:to_i)
E = Array.new(N){ [] }
(N-1).times{
  u,v = gets.split.map(&:to_i)
  E[u-1]<<v-1
  E[v-1]<<u-1
}
B = [nil]*N
F = lambda{|u,a|
  next if B[u]
  i = a.bsearch_index{|_| A[u]<=_ }||a.size
  z,a[i] = a[i],A[u]
  B[u] = a.size
  E[u].each{|v|
    F[v,a]
  }
  if z
    a[i] = z
  else
    a.pop
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

N = gets.to_i
A = gets.split.map(&:to_i)
E = Array.new(N){ [] }
(N-1).times{
	u,v = gets.split.map(&:to_i)
	E[u-1]<<v-1
	E[v-1]<<u-1
}
B = [nil]*N
F = lambda{|u,a|
	next if B[u]
	i = a.bsearch_index{|_| A[u]<=_ }||a.size
	z,a[i] = a[i],A[u]
	B[u] = a.size
	E[u].each{|v|
		F[v,a]
	}
	if z
		a[i] = z
	else
		a.pop
	end
}
F[0,[]]
p(*B)

Submission Info

Judge Result