Task: | Laskettelukeskus |
Sender: | rottis |
Submission time: | 2023-10-30 17:43:08 +0200 |
Language: | Ruby |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.07 s | 1, 2 | details |
#2 | WRONG ANSWER | 0.07 s | 1, 2 | details |
#3 | WRONG ANSWER | 0.07 s | 1, 2 | details |
#4 | WRONG ANSWER | 0.55 s | 2 | details |
#5 | WRONG ANSWER | 0.55 s | 2 | details |
#6 | ACCEPTED | 0.07 s | 1, 2 | details |
#7 | ACCEPTED | 0.48 s | 2 | details |
#8 | ACCEPTED | 0.07 s | 1, 2 | details |
#9 | RUNTIME ERROR | 0.43 s | 2 | details |
#10 | ACCEPTED | 0.07 s | 1, 2 | details |
#11 | ACCEPTED | 0.52 s | 2 | details |
#12 | ACCEPTED | 0.07 s | 1, 2 | details |
#13 | ACCEPTED | 0.51 s | 2 | details |
Code
class Nodeattr_accessor :leaf, :parent, :count, :totaldef initialize(parent, count)@parent = parent@count = count@total = 0@leaf = true@children = []enddef make(count)n = Node.new(self, count)@children << n@leaf = falsereturn nenddef add(num)@total += numif !parent.nil?parent.add(num)endenddef go_down_and_inc_as_needed@children.each { |child| child.go_down_and_inc_as_needed }if count > totaladd(count - total)endendendcount = gets.chomp.to_irows = [[1, 1]](count-1).times dorows << gets.chomp.split(" ").map(&:to_i)endc = gets.chomp.split(" ").map(&:to_i)c.each_with_index do |x, i|rows[i] << xend#puts rows.to_snodes = {}nodes[1] = Node.new(nil, rows[0][2])rows[1..-1].each do |row|nodes[row[1]] = nodes[row[0]].make(row[2])end#puts nodesnodes[1].go_down_and_inc_as_neededputs nodes[1].total# walk from 1, dfs, calc running total, when going up if running total < c then self.add_recursive
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 1 2 1 3 3 4 3 5 ... |
correct output |
---|
6 |
user output |
---|
6 |
Test 2
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 73 1 64 64 23 1 88 ... |
correct output |
---|
2675 |
user output |
---|
2677 |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 36 36 56 56 59 36 97 ... |
correct output |
---|
2808 |
user output |
---|
2767 |
Test 4
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 1 45452 1 74209 45452 78960 45452 79820 ... |
correct output |
---|
28399367694319 |
user output |
---|
28391116899623 |
Test 5
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 1 31165 1 23263 31165 89516 31165 53122 ... |
correct output |
---|
28546840313799 |
user output |
---|
28485551969153 |
Test 6
Group: 1, 2
Verdict: ACCEPTED
input |
---|
100 1 79 79 9 79 45 45 10 ... |
correct output |
---|
0 |
user output |
---|
0 |
Test 7
Group: 2
Verdict: ACCEPTED
input |
---|
100000 1 66038 1 56789 56789 7403 66038 69542 ... |
correct output |
---|
0 |
user output |
---|
0 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
input |
---|
100 1 2 2 3 3 4 4 5 ... |
correct output |
---|
100 |
user output |
---|
100 |
Test 9
Group: 2
Verdict: RUNTIME ERROR
input |
---|
100000 1 2 2 3 3 4 4 5 ... |
correct output |
---|
1000000000 |
user output |
---|
(empty) |
Error:
input/code.rb:26:in `each': stack level too deep (SystemStackError) from input/code.rb:26...
Test 10
Group: 1, 2
Verdict: ACCEPTED
input |
---|
100 1 2 1 3 2 4 2 5 ... |
correct output |
---|
2809 |
user output |
---|
2809 |
Test 11
Group: 2
Verdict: ACCEPTED
input |
---|
100000 1 2 1 3 2 4 2 5 ... |
correct output |
---|
26053917212428 |
user output |
---|
26053917212428 |
Test 12
Group: 1, 2
Verdict: ACCEPTED
input |
---|
100 1 2 1 3 2 4 2 5 ... |
correct output |
---|
5000 |
user output |
---|
5000 |
Test 13
Group: 2
Verdict: ACCEPTED
input |
---|
100000 1 2 1 3 2 4 2 5 ... |
correct output |
---|
50000000000000 |
user output |
---|
50000000000000 |