CSES - Datatähti 2024 alku - Results
Submission details
Task:Laskettelukeskus
Sender:clearcast
Submission time:2023-11-08 18:32:42 +0200
Language:PyPy3
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.04 s1, 2details
#20.04 s1, 2details
#30.04 s1, 2details
#40.18 s2details
#50.18 s2details
#6ACCEPTED0.04 s1, 2details
#7ACCEPTED0.17 s2details
#8ACCEPTED0.04 s1, 2details
#9ACCEPTED0.18 s2details
#100.04 s1, 2details
#110.18 s2details
#120.04 s1, 2details
#130.18 s2details

Code

#Tässä ongelmana se, että jos on monta rinnettä, jotka lähtee samasta rinteestä. Pitää viel testaa toimiiko monet yksittäiset peräkkäiset rinteet
#otetaan syöte vastaan ja lisätään listoihin a, b ja c
a = [int(x) for x in input().split()]
b=[]
c=[]
for i in range(1,a[0]):
    e = [int(x) for x in input().split()]
    #print("e on:",e)
    for i in e:
        #print("i on:",i)
        b.append(i)
        #print("b on:",b)
e = [int(x) for x in input().split()]
for i in e:
    c.append(i) 
#print(b)
#print(c)
l=0
lauseke=0
d=0
valmis=False
#tehdään looppi, joka jatkuu kunnes vikassa listassa on vain 1 arvo
while len(c)>1:
    #tsekataan montako [1,2,1,3,3,4,3,5] [5,2,2,0,1] [5]
    while valmis!=True:
        #print("l",l)
        #print("1",b)
        if len(b)>2:
            if b[-2-2*l]==b[-4-2*l]:
                l+=1
            else:
                valmis=True
            if l==a[0]-2:
                valmis=True
        else:
            l=0
            valmis=True
    if l>=1:
        #print(b)
        #print(c)
        lauseke=c[b[-1]-1]
        d=3
        for i in range(1,l+1):
            lauseke+=c[b[-d]-1]
            d+=2
        if lauseke<=c[b[-2]-1]:
            for i in range(0,4):
                #print(b)
                b.pop()
            for i in range(1,l+2):
                c.pop()
        else:
            for i in range(1,3+2*l):
                b.pop()
            for i in range(1,l+2):
                c.pop()
            c[-1]=lauseke
    else:
        if c[-1]<=c[-2]:
            c.pop()
            b.pop()
            b.pop()
        else:
            c[-2]=c[-1]
            c.pop()
            b.pop()
            b.pop()
    #print("jep")
print(c[0])    

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
100

Test 3

Group: 1, 2

Verdict:

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

correct output
2808

user output
100

Test 4

Group: 2

Verdict:

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

correct output
28399367694319

user output
999991792

Test 5

Group: 2

Verdict:

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

correct output
28546840313799

user output
999999562

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:

input
100
1 2
1 3
2 4
2 5
...

correct output
2809

user output
100

Test 11

Group: 2

Verdict:

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

correct output
26053917212428

user output
999994445

Test 12

Group: 1, 2

Verdict:

input
100
1 2
1 3
2 4
2 5
...

correct output
5000

user output
100

Test 13

Group: 2

Verdict:

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

correct output
50000000000000

user output
1000000000