Submission details
Task:Ladders
Sender:aalto25f_004
Submission time:2025-10-08 17:08:43 +0300
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.04 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.04 sdetails
#6ACCEPTED0.04 sdetails
#7ACCEPTED0.04 sdetails
#80.04 sdetails
#9ACCEPTED0.04 sdetails
#10ACCEPTED0.04 sdetails
#110.04 sdetails
#12ACCEPTED0.04 sdetails
#13ACCEPTED0.04 sdetails
#14ACCEPTED0.04 sdetails
#15ACCEPTED0.04 sdetails
#16ACCEPTED0.04 sdetails
#17ACCEPTED0.04 sdetails
#18ACCEPTED0.04 sdetails
#190.04 sdetails
#20ACCEPTED0.04 sdetails
#210.04 sdetails
#22ACCEPTED0.04 sdetails
#23ACCEPTED0.04 sdetails
#24ACCEPTED0.04 sdetails
#25ACCEPTED0.04 sdetails
#26ACCEPTED0.04 sdetails
#27ACCEPTED0.04 sdetails
#28ACCEPTED0.04 sdetails
#290.04 sdetails
#30ACCEPTED0.04 sdetails
#310.04 sdetails
#32ACCEPTED0.04 sdetails
#330.04 sdetails
#34ACCEPTED0.04 sdetails
#35ACCEPTED0.04 sdetails
#360.04 sdetails
#37ACCEPTED0.04 sdetails
#38ACCEPTED0.04 sdetails
#390.04 sdetails
#400.04 sdetails
#410.04 sdetails
#420.04 sdetails
#430.04 sdetails
#440.04 sdetails
#450.04 sdetails
#46ACCEPTED0.04 sdetails
#470.04 sdetails
#480.04 sdetails
#490.04 sdetails
#500.04 sdetails
#510.04 sdetails
#520.04 sdetails
#530.04 sdetails
#540.04 sdetails
#550.04 sdetails
#56ACCEPTED0.04 sdetails
#570.04 sdetails
#580.05 sdetails
#590.04 sdetails
#600.04 sdetails
#610.04 sdetails
#620.11 sdetails
#630.10 sdetails
#640.11 sdetails
#650.56 sdetails
#66--details
#670.10 sdetails
#68--details
#690.10 sdetails
#700.12 sdetails
#710.10 sdetails

Code

def game(n, ladders):
    count = 0
    curr_pos = 0

    for i in range(n):
        if curr_pos == n - 1:
            return count

        curr_val = ladders[i]
        if 2 * curr_val >= n:
            count += 1
            curr_pos += 1
            continue
        # find multiple with largest position
        number_of_multiple = n // curr_val - 1
        max_positions = -1
        for j in range(2, number_of_multiple + 2):
            max_positions = max(max_positions, ladders.index(j * curr_val))
        curr_pos = max_positions if max_positions > curr_pos else curr_pos
        count += 1

    return count


if __name__ == "__main__":
    n = int(input())
    ladders = list(map(int, input().split()))

    result = game(n, ladders)
    print(result)

Test details

Test 1

Verdict: ACCEPTED

input
1

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
2
2 1 

correct output
1

user output
1

Test 3

Verdict: ACCEPTED

input
2
1 2 

correct output
1

user output
1

Test 4

Verdict: ACCEPTED

input
2
2 1 

correct output
1

user output
1

Test 5

Verdict: ACCEPTED

input
3
2 3 1 

correct output
2

user output
2

Test 6

Verdict: ACCEPTED

input
3
1 2 3 

correct output
1

user output
1

Test 7

Verdict: ACCEPTED

input
3
3 2 1 

correct output
2

user output
2

Test 8

Verdict:

input
4
3 2 1 4 

correct output
2

user output
3

Test 9

Verdict: ACCEPTED

input
4
4 3 2 1 

correct output
3

user output
3

Test 10

Verdict: ACCEPTED

input
4
4 2 1 3 

correct output
3

user output
3

Test 11

Verdict:

input
4
3 2 1 4 

correct output
2

user output
3

Test 12

Verdict: ACCEPTED

input
4
1 3 2 4 

correct output
1

user output
1

Test 13

Verdict: ACCEPTED

input
5
3 2 4 1 5 

correct output
4

user output
4

Test 14

Verdict: ACCEPTED

input
5
1 2 4 3 5 

correct output
1

user output
1

Test 15

Verdict: ACCEPTED

input
5
5 3 1 2 4 

correct output
3

user output
3

Test 16

Verdict: ACCEPTED

input
5
3 1 4 2 5 

correct output
2

user output
2

Test 17

Verdict: ACCEPTED

input
5
1 2 3 4 5 

correct output
1

user output
1

Test 18

Verdict: ACCEPTED

input
5
3 1 5 4 2 

correct output
2

user output
2

Test 19

Verdict:

input
5
5 4 3 2 1 

correct output
4

user output
5

Test 20

Verdict: ACCEPTED

input
5
5 3 1 4 2 

correct output
3

user output
3

Test 21

Verdict:

input
5
5 4 3 2 1 

correct output
4

user output
5

Test 22

Verdict: ACCEPTED

input
5
5 1 4 3 2 

correct output
2

user output
2

Test 23

Verdict: ACCEPTED

input
10
4 8 3 1 7 2 5 10 6 9 

correct output
3

user output
3

Test 24

Verdict: ACCEPTED

input
10
8 10 3 6 5 1 4 7 2 9 

correct output
3

user output
3

Test 25

Verdict: ACCEPTED

input
10
4 1 2 7 5 10 8 6 9 3 

correct output
2

user output
2

Test 26

Verdict: ACCEPTED

input
10
10 9 7 2 5 1 3 4 6 8 

correct output
4

user output
4

Test 27

Verdict: ACCEPTED

input
10
1 2 3 4 5 6 7 8 9 10 

correct output
1

user output
1

Test 28

Verdict: ACCEPTED

input
10
6 7 10 9 5 2 1 3 8 4 

correct output
6

user output
6

Test 29

Verdict:

input
10
10 9 8 7 6 5 4 3 2 1 

correct output
9

user output
10

Test 30

Verdict: ACCEPTED

input
10
8 5 3 7 4 1 6 2 10 9 

correct output
3

user output
3

Test 31

Verdict:

input
10
10 9 8 7 6 5 4 3 2 1 

correct output
9

user output
10

Test 32

Verdict: ACCEPTED

input
10
10 3 6 8 4 5 1 7 2 9 

correct output
2

user output
2

Test 33

Verdict:

input
100
14 63 92 70 7 59 86 25 60 9 73...

correct output
4

user output
12

Test 34

Verdict: ACCEPTED

input
100
92 55 15 16 23 1 24 22 89 71 6...

correct output
6

user output
6

Test 35

Verdict: ACCEPTED

input
100
34 58 2 29 82 83 47 100 91 35 ...

correct output
3

user output
3

Test 36

Verdict:

input
100
26 63 34 33 58 41 40 29 22 8 7...

correct output
5

user output
12

Test 37

Verdict: ACCEPTED

input
100
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
1

user output
1

Test 38

Verdict: ACCEPTED

input
100
6 85 10 52 5 84 64 92 89 31 60...

correct output
1

user output
1

Test 39

Verdict:

input
100
100 99 98 97 96 95 94 93 92 91...

correct output
99

user output
100

Test 40

Verdict:

input
100
33 75 25 88 30 21 6 11 72 70 3...

correct output
5

user output
9

Test 41

Verdict:

input
100
30 86 34 36 29 12 39 7 65 23 3...

correct output
8

user output
9

Test 42

Verdict:

input
200
14 63 135 70 7 59 198 180 108 ...

correct output
6

user output
11

Test 43

Verdict:

input
200
92 55 151 199 107 153 113 22 1...

correct output
5

user output
19

Test 44

Verdict:

input
200
34 58 2 29 82 162 47 100 91 35...

correct output
5

user output
12

Test 45

Verdict:

input
200
148 63 188 153 170 41 180 112 ...

correct output
9

user output
12

Test 46

Verdict: ACCEPTED

input
200
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
1

user output
1

Test 47

Verdict:

input
200
175 162 119 135 5 84 180 92 89...

correct output
8

user output
26

Test 48

Verdict:

input
200
200 199 198 197 196 195 194 19...

correct output
199

user output
200

Test 49

Verdict:

input
200
160 75 25 88 30 21 6 11 72 70 ...

correct output
5

user output
11

Test 50

Verdict:

input
200
30 86 162 36 29 12 145 195 134...

correct output
4

user output
7

Test 51

Verdict:

input
200
47 121 66 36 23 37 113 151 60 ...

correct output
6

user output
12

Test 52

Verdict:

input
1000
934 460 976 361 744 297 198 66...

correct output
12

user output
44

Test 53

Verdict:

input
1000
999 410 151 405 349 770 809 59...

correct output
12

user output
71

Test 54

Verdict:

input
1000
505 953 714 811 82 503 751 709...

correct output
9

user output
52

Test 55

Verdict:

input
1000
960 63 254 153 973 296 180 300...

correct output
6

user output
18

Test 56

Verdict: ACCEPTED

input
1000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
1

user output
1

Test 57

Verdict:

input
1000
919 660 119 418 355 220 207 38...

correct output
8

user output
46

Test 58

Verdict:

input
1000
1000 999 998 997 996 995 994 9...

correct output
999

user output
1000

Test 59

Verdict:

input
1000
219 802 25 833 912 846 639 806...

correct output
5

user output
15

Test 60

Verdict:

input
1000
821 625 397 588 943 372 469 30...

correct output
15

user output
63

Test 61

Verdict:

input
1000
749 481 66 36 256 37 113 712 5...

correct output
10

user output
22

Test 62

Verdict:

input
100000
26990 68204 21904 3028 29287 1...

correct output
8

user output
303

Test 63

Verdict:

input
100000
94616 96638 65840 9893 92126 1...

correct output
12

user output
244

Test 64

Verdict:

input
100000
11080 90273 56653 73314 33646 ...

correct output
10

user output
310

Test 65

Verdict:

input
100000
27548 48776 71938 59265 12094 ...

correct output
11

user output
287

Test 66

Verdict:

input
100000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

correct output
1

user output
(empty)

Test 67

Verdict:

input
100000
77221 89614 36710 27644 37101 ...

correct output
11

user output
135

Test 68

Verdict:

input
100000
100000 99999 99998 99997 99996...

correct output
99999

user output
(empty)

Test 69

Verdict:

input
100000
68737 37819 55518 77756 46481 ...

correct output
12

user output
226

Test 70

Verdict:

input
100000
39437 53659 60243 20923 38668 ...

correct output
11

user output
144

Test 71

Verdict:

input
100000
69631 70212 62831 61461 93551 ...

correct output
14

user output
238