oj.uz

Submission #1019176

# Submission time Handle Problem Language Result Execution time Memory
1019176 2024-07-10T14:35:55 Z amine_aroua Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 28924 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
int sz;
vector<vector<int>> p;
vector<vector<int>> dist;
vector<vector<bool>> vis;
priority_queue<tuple<int ,int , int>, vector<tuple<int ,int , int>> , greater<tuple<int,int ,int>>> q;
int n ;
void process(int P , int tp , int last)
{
    if(P == 0)
        return;
    if(P > sz)
    {
        for(int k = 1 ; tp + k * P < n || tp - k * P >= 0 ; k++)
        {
            if(k*P + tp < n && 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});
            }
            if(tp - k * P >= 0 && 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});
            }
        }
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int  m;
    cin>>n>>m;
    sz = (int)sqrt(n);
    p = vector<vector<int>> (n);
    dist = vector<vector<int>> (n , vector<int>(sz +1 , INT32_MAX));
    vis = vector<vector<bool>> (n , vector<bool>(sz + 1 , 0));
    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;
        for(auto P : p[tp])
        {
            process(P , tp , last);
        }
        process(last , tp , last);
    }
    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 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 404 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 0 ms 348 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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 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 424 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 1116 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 1116 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 2 ms 1128 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 1056 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 6 ms 1116 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 1156 KB Output is correct
33 Correct 12 ms 1112 KB Output is correct
34 Correct 12 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 348 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 0 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 464 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 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 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 1116 KB Output is correct
25 Correct 1 ms 1116 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 6 ms 1116 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 4 ms 964 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 12 ms 1276 KB Output is correct
34 Correct 12 ms 1276 KB Output is correct
35 Correct 16 ms 1372 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 21 ms 1372 KB Output is correct
38 Correct 21 ms 1624 KB Output is correct
39 Correct 21 ms 1624 KB Output is correct
40 Correct 21 ms 1668 KB Output is correct
41 Correct 21 ms 1628 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 1488 KB Output is correct
45 Correct 43 ms 1648 KB Output is correct
46 Correct 46 ms 1628 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 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 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 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 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 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 1116 KB Output is correct
25 Correct 1 ms 1116 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 856 KB Output is correct
28 Correct 2 ms 1116 KB Output is correct
29 Correct 6 ms 1120 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 4 ms 1124 KB Output is correct
32 Correct 2 ms 1116 KB Output is correct
33 Correct 11 ms 1276 KB Output is correct
34 Correct 11 ms 1280 KB Output is correct
35 Correct 14 ms 1372 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 21 ms 1508 KB Output is correct
38 Correct 21 ms 1628 KB Output is correct
39 Correct 22 ms 1624 KB Output is correct
40 Correct 21 ms 1468 KB Output is correct
41 Correct 21 ms 1628 KB Output is correct
42 Correct 6 ms 1368 KB Output is correct
43 Correct 4 ms 1372 KB Output is correct
44 Correct 4 ms 1372 KB Output is correct
45 Correct 43 ms 1676 KB Output is correct
46 Correct 43 ms 1656 KB Output is correct
47 Correct 111 ms 8472 KB Output is correct
48 Correct 13 ms 18012 KB Output is correct
49 Correct 14 ms 20172 KB Output is correct
50 Correct 15 ms 22856 KB Output is correct
51 Correct 57 ms 25884 KB Output is correct
52 Correct 61 ms 25932 KB Output is correct
53 Correct 22 ms 25436 KB Output is correct
54 Correct 14 ms 24484 KB Output is correct
55 Correct 15 ms 24412 KB Output is correct
56 Correct 20 ms 25692 KB Output is correct
57 Correct 72 ms 24668 KB Output is correct
58 Correct 20 ms 24924 KB Output is correct
59 Correct 20 ms 24920 KB Output is correct
60 Correct 24 ms 24924 KB Output is correct
61 Correct 22 ms 25156 KB Output is correct
62 Correct 41 ms 25688 KB Output is correct
63 Correct 48 ms 26580 KB Output is correct
64 Correct 49 ms 26580 KB Output is correct
65 Correct 716 ms 26580 KB Output is correct
66 Execution timed out 1046 ms 28924 KB Time limit exceeded
67 Halted 0 ms 0 KB -