oj.uz

Submission #1019157

# Submission time Handle Problem Language Result Execution time Memory
1019157 2024-07-10T14:21:52 Z amine_aroua Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 29124 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
using namespace std;
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n , m;
    cin>>n>>m;
    int sz = (int)sqrt(n);
    vector<vector<int>> p(n);
    vector<vector<int>> dist(n , vector<int>(sz +1 , INT32_MAX));
    vector<vector<bool>> vis(n , vector<bool>(sz + 1 , 0));
    priority_queue<tuple<int ,int , int>, vector<tuple<int ,int , int>> , greater<tuple<int,int ,int>>> q;
    int trg = 0;
    for(int i = 0 ; i < m; i++)
    {
        int a , b;
        cin>>a>>b;
        if(i == 0)
        {
            dist[a][0] = 0;
            q.push({0 , a , 0});
        }
        if(i == 1)
        {
            trg = a;
        }
        p[a].push_back(b);
    }
    while(!q.empty())
    {
        auto [d , tp , last] = q.top();
        q.pop();
        if(vis[tp][last])
            continue;
        vis[tp][last] = 1;
        vector<int> all = p[tp];
        all.push_back(last);
        for(auto P : all)
        {
            if(P == 0)
                continue;
            if(P > sz)
            {
                for(int k = 1 ; tp + k * P < n ; k++)
                {
                    if(dist[k * P + tp][0] > dist[tp][last] + k)
                    {
                        dist[k * P + tp][0] = dist[tp][last] + k;
                        q.push({dist[k * P + tp][0] , k * P + tp , 0});
                    }
                }
                for(int k = 1 ; tp - k * P >= 0 ; k++)
                {
                    if(dist[tp - k * P][0] > dist[tp][last] + k)
                    {
                        dist[tp - k * P][0] = dist[tp][last] + k;
                        q.push({dist[tp - k * P][0] , tp - k * P , 0});
                    }
                }
            }
            else
            {
                if(P + tp < n)
                {
                    if(dist[P + tp][P] > dist[tp][last] + 1)
                    {
                        dist[P + tp][P] = dist[tp][last] + 1;
                        q.push({dist[P + tp][P] , P + tp , P});
                    }
                }
                if(tp - P >= 0)
                {
                    if(dist[tp - P][P] > dist[tp][last] + 1)
                    {
                        dist[tp - P][P] = dist[tp][last] + 1;
                        q.push({dist[tp - P][P] , tp - P , P});
                    }
                }
            }
        }
    }
    int mn = INT32_MAX;
    for(int i = 0 ; i <= sz ; i++)
    {
        mn = min(mn , dist[trg][i]);
    }
    cout<<(mn == INT32_MAX ? -1 : mn);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 2 ms 1116 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 2 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 6 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 4 ms 1116 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 13 ms 1268 KB Output is correct
34 Correct 13 ms 1116 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 448 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 2 ms 1116 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 936 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 2 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 7 ms 860 KB Output is correct
30 Correct 2 ms 856 KB Output is correct
31 Correct 5 ms 1112 KB Output is correct
32 Correct 3 ms 1116 KB Output is correct
33 Correct 16 ms 1264 KB Output is correct
34 Correct 13 ms 1116 KB Output is correct
35 Correct 14 ms 1160 KB Output is correct
36 Correct 3 ms 600 KB Output is correct
37 Correct 21 ms 1116 KB Output is correct
38 Correct 21 ms 1372 KB Output is correct
39 Correct 25 ms 1368 KB Output is correct
40 Correct 22 ms 1368 KB Output is correct
41 Correct 24 ms 1368 KB Output is correct
42 Correct 4 ms 1372 KB Output is correct
43 Correct 4 ms 1372 KB Output is correct
44 Correct 3 ms 1372 KB Output is correct
45 Correct 42 ms 1372 KB Output is correct
46 Correct 42 ms 1372 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 1112 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 2 ms 940 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 7 ms 1112 KB Output is correct
30 Correct 2 ms 932 KB Output is correct
31 Correct 5 ms 1116 KB Output is correct
32 Correct 3 ms 1116 KB Output is correct
33 Correct 12 ms 1112 KB Output is correct
34 Correct 13 ms 1116 KB Output is correct
35 Correct 14 ms 1156 KB Output is correct
36 Correct 2 ms 600 KB Output is correct
37 Correct 22 ms 1352 KB Output is correct
38 Correct 29 ms 1372 KB Output is correct
39 Correct 21 ms 1372 KB Output is correct
40 Correct 27 ms 1400 KB Output is correct
41 Correct 21 ms 1372 KB Output is correct
42 Correct 5 ms 1444 KB Output is correct
43 Correct 4 ms 1372 KB Output is correct
44 Correct 3 ms 1372 KB Output is correct
45 Correct 44 ms 1440 KB Output is correct
46 Correct 43 ms 1372 KB Output is correct
47 Correct 125 ms 8280 KB Output is correct
48 Correct 19 ms 17752 KB Output is correct
49 Correct 16 ms 20060 KB Output is correct
50 Correct 16 ms 22876 KB Output is correct
51 Correct 70 ms 25592 KB Output is correct
52 Correct 68 ms 25620 KB Output is correct
53 Correct 26 ms 25176 KB Output is correct
54 Correct 14 ms 24412 KB Output is correct
55 Correct 17 ms 24408 KB Output is correct
56 Correct 22 ms 25412 KB Output is correct
57 Correct 97 ms 24668 KB Output is correct
58 Correct 28 ms 24996 KB Output is correct
59 Correct 23 ms 24924 KB Output is correct
60 Correct 30 ms 25060 KB Output is correct
61 Correct 35 ms 24904 KB Output is correct
62 Correct 67 ms 25436 KB Output is correct
63 Correct 53 ms 26320 KB Output is correct
64 Correct 56 ms 26312 KB Output is correct
65 Correct 739 ms 26328 KB Output is correct
66 Execution timed out 1004 ms 29124 KB Time limit exceeded
67 Halted 0 ms 0 KB -