Submission details
Task:Card game
Sender:aalto25b_001
Submission time:2025-09-13 17:55:36 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#30.04 sdetails
#40.05 sdetails
#50.07 sdetails
#60.58 sdetails
#7--details
#8--details
#9--details
#10--details
#110.04 sdetails
#12ACCEPTED0.04 sdetails
#13ACCEPTED0.04 sdetails
#14--details
#15--details

Code

cards = int(input())

values = [int(x) for x in input().split()]

values = values[1:-1]
valuessorted = [x for x in values]
valuessorted.sort()
total = 0
forbidden = set()

while len(valuessorted) > 1:
    highest = valuessorted.pop(-1)
    indexes = [i for i, x in enumerate(values) if x == highest]
    for index in indexes:
        if index not in forbidden:
            total += highest
            forbidden.update([index-2, index-1, index, index+1, index+2])
            break
    # if values.index(highest) > 0 and values[values.index(highest) - 1] != -1: 
    #     valuessorted.remove(values[values.index(highest) - 1])
    #     values[values.index(highest) - 1] = -1
    # if values.index(highest) > 1 and values[values.index(highest) - 2] != -1: 
    #     valuessorted.remove(values[values.index(highest) - 2])
    #     values[values.index(highest) - 2] = -1
    # if values.index(highest) < len(values) - 1 and values[values.index(highest) + 1] != -1: 
    #     valuessorted.remove(values[values.index(highest) + 1])
    #     values[values.index(highest) + 1] = -1
    # if values.index(highest) < len(values) - 2 and values[values.index(highest) + 2] != -1: 
    #     valuessorted.remove(values[values.index(highest) + 2])
    #     values[values.index(highest) + 2] = -1
    # values[values.index(highest)] = -1

print(total)


Test details

Test 1

Verdict: ACCEPTED

input
5
9 4 1 6 6

correct output
6

user output
6

Test 2

Verdict: ACCEPTED

input
6
5 6 2 4 10 1

correct output
16

user output
16

Test 3

Verdict:

input
10
8 9 10 2 7 1 10 10 1 4

correct output
26

user output
20

Test 4

Verdict:

input
100
1 8 8 5 7 10 9 4 8 10 6 3 8 7 ...

correct output
243

user output
227

Test 5

Verdict:

input
1000
10 7 5 6 5 2 5 3 2 2 1 6 8 7 8...

correct output
2230

user output
2118

Test 6

Verdict:

input
10000
9 1 8 2 6 5 1 3 3 10 6 3 9 3 1...

correct output
22363

user output
21210

Test 7

Verdict:

input
100000
5 5 4 6 8 7 9 6 3 2 5 8 7 3 5 ...

correct output
226636

user output
(empty)

Test 8

Verdict:

input
1000000
5 8 5 7 9 1 9 10 3 6 1 8 3 9 7...

correct output
2259395

user output
(empty)

Test 9

Verdict:

input
1000000
4 5 3 5 4 3 6 7 10 6 3 9 7 9 1...

correct output
2260761

user output
(empty)

Test 10

Verdict:

input
1000000
10 3 6 7 7 10 4 4 5 2 9 4 6 10...

correct output
2260407

user output
(empty)

Test 11

Verdict:

input
3
87 3 123

correct output
3

user output
0

Test 12

Verdict: ACCEPTED

input
2
175 95

correct output
0

user output
0

Test 13

Verdict: ACCEPTED

input
1
42

correct output
0

user output
0

Test 14

Verdict:

input
1000000
1000 1000 1000 1000 1000 1000 ...

correct output
333333000

user output
(empty)

Test 15

Verdict:

input
1000000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
333333

user output
(empty)