Task: | Laskettelukeskus |
Sender: | YourUncle |
Submission time: | 2023-11-04 16:11:52 +0200 |
Language: | Python3 (CPython3) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.02 s | 1, 2 | details |
#2 | WRONG ANSWER | 0.02 s | 1, 2 | details |
#3 | WRONG ANSWER | 0.02 s | 1, 2 | details |
#4 | WRONG ANSWER | 0.32 s | 2 | details |
#5 | WRONG ANSWER | 0.31 s | 2 | details |
#6 | ACCEPTED | 0.02 s | 1, 2 | details |
#7 | ACCEPTED | 0.30 s | 2 | details |
#8 | ACCEPTED | 0.02 s | 1, 2 | details |
#9 | ACCEPTED | 0.27 s | 2 | details |
#10 | WRONG ANSWER | 0.02 s | 1, 2 | details |
#11 | WRONG ANSWER | 0.28 s | 2 | details |
#12 | ACCEPTED | 0.02 s | 1, 2 | details |
#13 | ACCEPTED | 0.29 s | 2 | details |
Code
class Tree:def __init__(self, value=None, children=None):self.value = valueself.children = []if children is not None:self.child(children)def child(self, children):for i in children:self.children.append(i)def __str__(self):return "...".join([str(i.value) for i in self.children])def go_deep(self, root):if root.children == []:# print("leaf", root.value)return root.valueif root.children != []:summa = 0for i in root.children:summa += self.go_deep(i)if summa < root.value:return root.valuereturn summadef stupid():amount = int(input())rinteet = {key:[] for key in range(1, amount+1)}for i in range(amount-1):edge = input().split()rinteet[int(edge[0])].append(edge[1])leafs = [i[0] for i in rinteet.items() if i[1]==[]]values = input().split()summa = 0for i in leafs:summa+=int(values[i-1])# print(leafs)print(summa)stupid()# amount = int(input())# rinteet = [Tree() for x in range(amount)]# for i in range(amount-1):# edge = input().split()# rinteet[int(edge[0])-1].child([rinteet[int(edge[1])-1]])# values = input().split()# # print(values)# for i, v in enumerate(values):# rinteet[i].value = int(v)# # for i in rinteet:# # print(i.value, i)# print(rinteet[0].go_deep(rinteet[0]))# t = Tree(0)# t.child([Tree(2), Tree(4, [Tree(3, [Tree(3), Tree(4)]), Tree(1)])])# print(t.children)# print(t.go_deep(t))
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 |
---|
2225 |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 36 36 56 56 59 36 97 ... |
correct output |
---|
2808 |
user output |
---|
2576 |
Test 4
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 1 45452 1 74209 45452 78960 45452 79820 ... |
correct output |
---|
28399367694319 |
user output |
---|
24984447276402 |
Test 5
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 1 31165 1 23263 31165 89516 31165 53122 ... |
correct output |
---|
28546840313799 |
user output |
---|
25050581666373 |
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: ACCEPTED
input |
---|
100000 1 2 2 3 3 4 4 5 ... |
correct output |
---|
1000000000 |
user output |
---|
1000000000 |
Test 10
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 2 1 3 2 4 2 5 ... |
correct output |
---|
2809 |
user output |
---|
2652 |
Test 11
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 1 2 1 3 2 4 2 5 ... |
correct output |
---|
26053917212428 |
user output |
---|
24999206822515 |
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 |