CSES - Aalto Competitive Programming 2024 - wk6 - Wed - Results
Submission details
Task:Ladders
Sender:aalto2024g_007
Submission time:2024-10-09 17:22:08 +0300
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#38ACCEPTED0.00 sdetails
#39ACCEPTED0.00 sdetails
#40ACCEPTED0.00 sdetails
#41ACCEPTED0.00 sdetails
#42ACCEPTED0.00 sdetails
#43ACCEPTED0.00 sdetails
#44ACCEPTED0.00 sdetails
#45ACCEPTED0.00 sdetails
#46ACCEPTED0.00 sdetails
#47ACCEPTED0.00 sdetails
#48ACCEPTED0.00 sdetails
#49ACCEPTED0.00 sdetails
#50ACCEPTED0.00 sdetails
#51ACCEPTED0.00 sdetails
#52ACCEPTED0.01 sdetails
#53ACCEPTED0.01 sdetails
#54ACCEPTED0.01 sdetails
#55ACCEPTED0.01 sdetails
#56ACCEPTED0.01 sdetails
#57ACCEPTED0.01 sdetails
#58ACCEPTED0.01 sdetails
#59ACCEPTED0.01 sdetails
#60ACCEPTED0.01 sdetails
#61ACCEPTED0.01 sdetails
#62--details
#63--details
#64--details
#65--details
#66--details
#67--details
#68--details
#69--details
#70--details
#71--details

Code

#include <bits/stdc++.h>

using namespace std;

int bfs(int x, int z, int n, vector<vector<int>> &adj) {

    queue<int> q, d;
    q.push(x);
    d.push(0);

    vector<bool> visited(n, false);

    while (!q.empty()) {

        int c = q.front();
        q.pop();

        int dist = d.front();
        d.pop();

        if (visited[c])
            continue;

        visited[c] = true;

        if (c == z)
            return dist;
        
        for (int y : adj[c]) {
            q.push(y);
            d.push(dist+1);
        }

    }

    return -1;

}

int main() {

    int n;
    cin >> n;

    vector<int> A(n);
    for (int i = 0; i < n; i++)
        cin >> A[i];
    
    if (n == 1) {
        cout << 0 << endl;
        return 0;
    } else if (n == 2) {
        cout << 1 << endl;
        return 0;
    }
    
    map<int, int> index_of_num;

    for (int i = 0; i < n; i++)
        index_of_num[A[i]] = i;

    vector<vector<int>> adj(n);

    for (int pos = n-1; pos >= 1; pos--) {

        int value = A[pos];

        for (int div = 1; div <= value/2; div++) {
            if (value % div == 0) {
                int index_of_div = index_of_num[div];
                adj[index_of_div].push_back(pos);
            }
        }

        adj[pos-1].push_back(pos);

    }

    cout << bfs(0, n-1, n, adj) << endl;
    return 0;

}

/*
10
8 10 3 6 5 1 4 7 2 9
*/

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: ACCEPTED

input
4
3 2 1 4 

correct output
2

user output
2

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: ACCEPTED

input
4
3 2 1 4 

correct output
2

user output
2

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: ACCEPTED

input
5
5 4 3 2 1 

correct output
4

user output
4

Test 20

Verdict: ACCEPTED

input
5
5 3 1 4 2 

correct output
3

user output
3

Test 21

Verdict: ACCEPTED

input
5
5 4 3 2 1 

correct output
4

user output
4

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: ACCEPTED

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

correct output
9

user output
9

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: ACCEPTED

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

correct output
9

user output
9

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: ACCEPTED

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

correct output
4

user output
4

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: ACCEPTED

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

correct output
5

user output
5

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: ACCEPTED

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

correct output
99

user output
99

Test 40

Verdict: ACCEPTED

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

correct output
5

user output
5

Test 41

Verdict: ACCEPTED

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

correct output
8

user output
8

Test 42

Verdict: ACCEPTED

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

correct output
6

user output
6

Test 43

Verdict: ACCEPTED

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

correct output
5

user output
5

Test 44

Verdict: ACCEPTED

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

correct output
5

user output
5

Test 45

Verdict: ACCEPTED

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

correct output
9

user output
9

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: ACCEPTED

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

correct output
8

user output
8

Test 48

Verdict: ACCEPTED

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

correct output
199

user output
199

Test 49

Verdict: ACCEPTED

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

correct output
5

user output
5

Test 50

Verdict: ACCEPTED

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

correct output
4

user output
4

Test 51

Verdict: ACCEPTED

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

correct output
6

user output
6

Test 52

Verdict: ACCEPTED

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

correct output
12

user output
12

Test 53

Verdict: ACCEPTED

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

correct output
12

user output
12

Test 54

Verdict: ACCEPTED

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

correct output
9

user output
9

Test 55

Verdict: ACCEPTED

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

correct output
6

user output
6

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: ACCEPTED

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

correct output
8

user output
8

Test 58

Verdict: ACCEPTED

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

correct output
999

user output
999

Test 59

Verdict: ACCEPTED

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

correct output
5

user output
5

Test 60

Verdict: ACCEPTED

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

correct output
15

user output
15

Test 61

Verdict: ACCEPTED

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

correct output
10

user output
10

Test 62

Verdict:

input
100000
26990 68204 21904 3028 29287 1...

correct output
8

user output
(empty)

Test 63

Verdict:

input
100000
94616 96638 65840 9893 92126 1...

correct output
12

user output
(empty)

Test 64

Verdict:

input
100000
11080 90273 56653 73314 33646 ...

correct output
10

user output
(empty)

Test 65

Verdict:

input
100000
27548 48776 71938 59265 12094 ...

correct output
11

user output
(empty)

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
(empty)

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
(empty)

Test 70

Verdict:

input
100000
39437 53659 60243 20923 38668 ...

correct output
11

user output
(empty)

Test 71

Verdict:

input
100000
69631 70212 62831 61461 93551 ...

correct output
14

user output
(empty)