CSES - Datatähti 2024 alku - Results
Submission details
Task:Laskettelukeskus
Sender:Terror2654
Submission time:2023-11-12 14:29:02 +0200
Language:Python3 (PyPy3)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1, 2details
#20.04 s1, 2details
#30.04 s1, 2details
#4--2details
#5--2details
#6ACCEPTED0.04 s1, 2details
#7--2details
#8ACCEPTED0.05 s1, 2details
#9--2details
#10ACCEPTED0.04 s1, 2details
#11--2details
#12ACCEPTED0.04 s1, 2details
#13--2details

Code

n = int(input())
graph = [[]for i in range(n+1)]
up = [[]for i in range(n+1)]
leafs = []
for i in range(n-1):
  j, r  = map(int,input().split())
  if j not in leafs and j!=1:
      leafs.append(j)
  elif r not in leafs and r!=1:
      leafs.append(r)
  graph[j].append(r)
  up[r].append(j)
l = list(map(int,input().split()))
l1=l[0]
l2=l[1]
l[0]=0
def go_up(leaf):
    if leaf>0:
        st = leaf
        while True:
            st = up[st][0]
            if st != 1:
                l[st-1]-=l[leaf-1]
            else:
                break
        l[0]-=l[leaf-1]
        l[leaf-1]=0

if len(l)==2:
    print(max(l1,l2))
else:
    i=0
    while len(leafs)!=0:
        leaf = leafs[i]
        if l[leaf-1]>=0 and len(graph[leaf]) == 0:
            go_up(leaf)
            if up[leaf][0] not in leafs and up[leaf][0]!=1:
                leafs.append(up[leaf][0])
            graph[up[leaf][0]].remove(leaf)
        leafs.remove(leaf)
        i=0
    print(max(abs(l[0]),l1))

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:

input
100
1 73
1 64
64 23
1 88
...

correct output
2675

user output
2641

Test 3

Group: 1, 2

Verdict:

input
100
1 36
36 56
56 59
36 97
...

correct output
2808

user output
2753

Test 4

Group: 2

Verdict:

input
100000
1 45452
1 74209
45452 78960
45452 79820
...

correct output
28399367694319

user output
(empty)

Test 5

Group: 2

Verdict:

input
100000
1 31165
1 23263
31165 89516
31165 53122
...

correct output
28546840313799

user output
(empty)

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:

input
100000
1 66038
1 56789
56789 7403
66038 69542
...

correct output
0

user output
(empty)

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:

input
100000
1 2
2 3
3 4
4 5
...

correct output
1000000000

user output
(empty)

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:

input
100000
1 2
1 3
2 4
2 5
...

correct output
26053917212428

user output
(empty)

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:

input
100000
1 2
1 3
2 4
2 5
...

correct output
50000000000000

user output
(empty)