Laskettelukeskus

# memory optimization
class Node
  def initialize(required)
    @required = required
    @children = []
    @total = 0
  end
 
  def make(required)
    n = Node.new(required)
    @children << n
    return n
  end
 
  def go_down
    @children.each { |child| @total += child.go_down }
    if @required > @total
      @total = @required
    end
    return @total
  end
end
 
count = gets.chomp.to_i
 
rows = []
(count - 1).times do
  rows << gets.chomp.split(" ").map(&:to_i)
end
 
requireds = gets.chomp.split(" ").map(&:to_i)
 
root = Node.new(requireds[0])
nodes = {1 => root}
rows.each do |a, b|
  req = requireds[b - 1]
  nodes[b] = nodes[a].make(req)
end
 
puts root.go_down

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: ACCEPTED

Test 5

Group: 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: RUNTIME ERROR

input/code.rb:16:in `block in go_down': stack level too deep (SystemStackError)
	from inpu...

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED