— Dark mode

Aalto Competitive Programming 2024 - wk6 - Wed

Ladders

  • Start: 2024-10-09 16:20:00
  • End: 2024-10-09 17:50:00
CSES - Aalto Competitive Programming 2024 - wk6 - Wed - Results
Submission details
Task:Ladders
Sender:aalto2024g_001
Submission time:2024-10-09 17:49:59 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.01 sdetails
#40.00 sdetails
#50.00 sdetails
#60.00 sdetails
#70.00 sdetails
#80.00 sdetails
#90.00 sdetails
#100.00 sdetails
#110.00 sdetails
#120.00 sdetails
#130.00 sdetails
#140.00 sdetails
#150.00 sdetails
#160.00 sdetails
#170.00 sdetails
#180.01 sdetails
#190.00 sdetails
#200.00 sdetails
#210.00 sdetails
#220.00 sdetails
#230.00 sdetails
#240.00 sdetails
#250.00 sdetails
#260.00 sdetails
#270.00 sdetails
#280.00 sdetails
#290.00 sdetails
#300.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#360.00 sdetails
#370.00 sdetails
#380.00 sdetails
#390.00 sdetails
#400.00 sdetails
#410.00 sdetails
#420.00 sdetails
#430.00 sdetails
#440.00 sdetails
#450.00 sdetails
#460.00 sdetails
#470.00 sdetails
#480.00 sdetails
#490.00 sdetails
#500.00 sdetails
#510.00 sdetails
#520.00 sdetails
#530.00 sdetails
#540.00 sdetails
#550.00 sdetails
#560.00 sdetails
#570.00 sdetails
#580.00 sdetails
#590.00 sdetails
#600.00 sdetails
#610.00 sdetails
#620.69 sdetails
#630.71 sdetails
#640.72 sdetails
#650.69 sdetails
#660.69 sdetails
#670.70 sdetails
#680.70 sdetails
#690.69 sdetails
#700.71 sdetails
#710.69 sdetails

Code

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <queue>
#include <climits>
#include <cmath>
 
#define int long long
using namespace std;

void solve()
{
    int n;
    cin >> n;

    vector<int> nums(n);
    vector<int> inds(n+1);
    vector<vector<int>> adj(n, vector<int>());

    for (int i = 0; i < n; i++)
    {
        cin >> nums[i];
        inds[nums[i]+1] = i;
    }
    for (int i = 1; i <= n; i++)
    {
        int val = nums[i];
        adj[i].push_back(i+1);
        for (int j = 2*val; j <= n; j += val)
        {
            adj[i].push_back(inds[j+1]);
        }
    }

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    vector<int> dist(adj.size()+1, LLONG_MAX);
    vector<int> next(adj.size()+1, 0);
    vector<int> visited(adj.size()+1, false);

    pq.push({0, 1});
    dist[1] = 0;

    while (!pq.empty()) {
        int u = pq.top().second;
        pq.pop();
        if (visited[u])
            continue;
        visited[u] = true;

        // Iterate through all adjacent vertices of the current vertex
        for (auto &neighbor : adj[u]) {
            int v = neighbor;
            int weight = 1;

            // If a shorter path to v is found
            if (!visited[v] && dist[v] > dist[u] + weight) {
                // Update distance and push new distance to the priority queue
                dist[v] = dist[u] + weight;
                next[u] = v;
                pq.push({dist[v], v});
            }
        }
    }

/*
    int curr = 1;
    while (curr != n)
    {
        cout << curr << " ";
        curr = next[curr];
    }
    */
   cout << dist[n];
}

signed main()
{
    int t = 1;

    //cin >> t;

    for (int i = 0; i < t; i++)
        solve();

    return 0;
}

Test details

Test 1

Verdict:

input
1
1 
view save

correct output
0
view save

user output
(empty)

Error:
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc

Test 2

Verdict:

input
2
2 1 
view save

correct output
1
view save

user output
(empty)

Test 3

Verdict:

input
2
1 2 
view save

correct output
1
view save

user output
(empty)

Test 4

Verdict:

input
2
2 1 
view save

correct output
1
view save

user output
(empty)

Test 5

Verdict:

input
3
2 3 1 
view save

correct output
2
view save

user output
(empty)

Test 6

Verdict:

input
3
1 2 3 
view save

correct output
1
view save

user output
(empty)

Test 7

Verdict:

input
3
3 2 1 
view save

correct output
2
view save

user output
(empty)

Test 8

Verdict:

input
4
3 2 1 4 
view save

correct output
2
view save

user output
(empty)

Test 9

Verdict:

input
4
4 3 2 1 
view save

correct output
3
view save

user output
(empty)

Test 10

Verdict:

input
4
4 2 1 3 
view save

correct output
3
view save

user output
(empty)

Test 11

Verdict:

input
4
3 2 1 4 
view save

correct output
2
view save

user output
(empty)

Test 12

Verdict:

input
4
1 3 2 4 
view save

correct output
1
view save

user output
(empty)

Test 13

Verdict:

input
5
3 2 4 1 5 
view save

correct output
4
view save

user output
(empty)

Test 14

Verdict:

input
5
1 2 4 3 5 
view save

correct output
1
view save

user output
(empty)

Test 15

Verdict:

input
5
5 3 1 2 4 
view save

correct output
3
view save

user output
(empty)

Test 16

Verdict:

input
5
3 1 4 2 5 
view save

correct output
2
view save

user output
(empty)

Test 17

Verdict:

input
5
1 2 3 4 5 
view save

correct output
1
view save

user output
(empty)

Test 18

Verdict:

input
5
3 1 5 4 2 
view save

correct output
2
view save

user output
(empty)

Test 19

Verdict:

input
5
5 4 3 2 1 
view save

correct output
4
view save

user output
(empty)

Test 20

Verdict:

input
5
5 3 1 4 2 
view save

correct output
3
view save

user output
(empty)

Test 21

Verdict:

input
5
5 4 3 2 1 
view save

correct output
4
view save

user output
(empty)

Test 22

Verdict:

input
5
5 1 4 3 2 
view save

correct output
2
view save

user output
(empty)

Test 23

Verdict:

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

correct output
3
view save

user output
(empty)

Test 24

Verdict:

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

correct output
3
view save

user output
(empty)

Test 25

Verdict:

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

correct output
2
view save

user output
(empty)

Test 26

Verdict:

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

correct output
4
view save

user output
(empty)

Test 27

Verdict:

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

correct output
1
view save

user output
(empty)

Test 28

Verdict:

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

correct output
6
view save

user output
(empty)

Test 29

Verdict:

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

correct output
9
view save

user output
(empty)

Test 30

Verdict:

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

correct output
3
view save

user output
(empty)

Test 31

Verdict:

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

correct output
9
view save

user output
(empty)

Test 32

Verdict:

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

correct output
2
view save

user output
(empty)

Test 33

Verdict:

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

correct output
4
view save

user output
(empty)

Test 34

Verdict:

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

correct output
6
view save

user output
(empty)

Test 35

Verdict:

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

correct output
3
view save

user output
(empty)

Test 36

Verdict:

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

correct output
5
view save

user output
(empty)

Test 37

Verdict:

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

correct output
1
view save

user output
(empty)

Test 38

Verdict:

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

correct output
1
view save

user output
(empty)

Test 39

Verdict:

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

correct output
99
view save

user output
(empty)

Test 40

Verdict:

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

correct output
5
view save

user output
(empty)

Test 41

Verdict:

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

correct output
8
view save

user output
(empty)

Test 42

Verdict:

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

correct output
6
view save

user output
(empty)

Test 43

Verdict:

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

correct output
5
view save

user output
(empty)

Test 44

Verdict:

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

correct output
5
view save

user output
(empty)

Test 45

Verdict:

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

correct output
9
view save

user output
(empty)

Test 46

Verdict:

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

correct output
1
view save

user output
(empty)

Test 47

Verdict:

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

correct output
8
view save

user output
(empty)

Test 48

Verdict:

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

correct output
199
view save

user output
(empty)

Test 49

Verdict:

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

correct output
5
view save

user output
(empty)

Test 50

Verdict:

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

correct output
4
view save

user output
(empty)

Test 51

Verdict:

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

correct output
6
view save

user output
(empty)

Test 52

Verdict:

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

correct output
12
view save

user output
(empty)

Test 53

Verdict:

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

correct output
12
view save

user output
(empty)

Test 54

Verdict:

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

correct output
9
view save

user output
(empty)

Test 55

Verdict:

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

correct output
6
view save

user output
(empty)

Test 56

Verdict:

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

correct output
1
view save

user output
(empty)

Test 57

Verdict:

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

correct output
8
view save

user output
(empty)

Test 58

Verdict:

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

correct output
999
view save

user output
(empty)

Test 59

Verdict:

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

correct output
5
view save

user output
(empty)

Test 60

Verdict:

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

correct output
15
view save

user output
(empty)

Test 61

Verdict:

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

correct output
10
view save

user output
(empty)

Test 62

Verdict:

input
100000
26990 68204 21904 3028 29287 1...
view save

correct output
8
view save

user output
(empty)

Test 63

Verdict:

input
100000
94616 96638 65840 9893 92126 1...
view save

correct output
12
view save

user output
(empty)

Test 64

Verdict:

input
100000
11080 90273 56653 73314 33646 ...
view save

correct output
10
view save

user output
(empty)

Test 65

Verdict:

input
100000
27548 48776 71938 59265 12094 ...
view save

correct output
11
view save

user output
(empty)

Test 66

Verdict:

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

correct output
1
view save

user output
(empty)

Test 67

Verdict:

input
100000
77221 89614 36710 27644 37101 ...
view save

correct output
11
view save

user output
(empty)

Test 68

Verdict:

input
100000
100000 99999 99998 99997 99996...
view save

correct output
99999
view save

user output
(empty)

Test 69

Verdict:

input
100000
68737 37819 55518 77756 46481 ...
view save

correct output
12
view save

user output
(empty)

Test 70

Verdict:

input
100000
39437 53659 60243 20923 38668 ...
view save

correct output
11
view save

user output
(empty)

Test 71

Verdict:

input
100000
69631 70212 62831 61461 93551 ...
view save

correct output
14
view save

user output
(empty)

Tasks

A FenceB Microservice hellC Online feudD LaddersE Fragile network

Submissions (aalto2024g_001)

2024-10-09 19:09:22 2024-10-09 17:49:59 2024-10-09 17:49:25 2024-10-09 17:46:47