Submission #20211491

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
P = $<.read.split.map(&:to_i)
C = Array.new(P.size+1){ [] }
P.each.with_index(1).reverse_each{|p,v|
  even,odd = C[v].partition{ _3<1 }
  ao = tk = 0
  odd.sort_by!{ _2-_1 }
  while 1 < odd.size
    (o00,o01),(o10,o11) = odd.shift(2)
    ao += o00+o11
    tk += o01+o10
  end
  unless odd.empty?
    o0,o1 = odd[0]
    ao += o0
    tk += o1
  end
  even.each(&[lambda{|(e0,e1)|
    ao += e0
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

P = $<.read.split.map(&:to_i)

C = Array.new(P.size+1){ [] }
P.each.with_index(1).reverse_each{|p,v|
	even,odd = C[v].partition{ _3<1 }
	ao = tk = 0

	odd.sort_by!{ _2-_1 }
	while 1 < odd.size
		(o00,o01),(o10,o11) = odd.shift(2)
		ao += o00+o11
		tk += o01+o10
	end
	unless odd.empty?
		o0,o1 = odd[0]
		ao += o0
		tk += o1
	end

	even.each(&[lambda{|(e0,e1)|
		ao += e0
		tk += e1
	},lambda{|(e0,e1)|
		e0,e1 = e1,e0 if e0<e1
		ao += e0
		tk += e1
	}][odd.size&1])

	C[p] << [ao,tk+1,1-odd.size&1]
}

(_,e1),(_,o1) = C[-1]
p(o1||e1)

Submission Info

Judge Result