oj.uz

Submission #1023116

# Submission time Handle Problem Language Result Execution time Memory
1023116 2024-07-14T09:51:11 Z MarwenElarbi Jakarta Skyscrapers (APIO15_skyscraper) C++17
22 / 100
 2 ms 3420 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define fi first
#define se second
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int nax=3e4+5;
vector<int> adj[nax];
int dis[nax][180];
signed main(){
    iostream::sync_with_stdio(false);
    int n,m;
    cin>>n>>m;
    pair<int,int> fir;
    pair<int,int> end;
    for (int i = 0; i < m; ++i)
    {
        int x,y;
        cin>>x>>y;
        if(i==0) fir={x,y};
        if(i==1) end={x,y};
        adj[x].pb(y);
    }
    for (int i = 0; i < n; ++i)
    {
        if(i==fir.fi) continue;
        for (int j = 0; j < sqrt(n); ++j)
        {
            dis[i][j]=1e9;
        }
    }
    priority_queue<tuple<int,int,int>,vector<tuple<int,int,int>>,greater<tuple<int,int,int>>> pq;
    pq.push({0,fir.fi,0});
    while(!pq.empty()){
        auto [d , node , lst] = pq.top();
        pq.pop();
        if(node==end.fi){
            cout <<d<<endl;
            return 0;
        }
        if(dis[node][lst]<d) continue;
        for(auto u:adj[node]){
            if(u<sqrt(n)){
                if(node-u>=0){
                    if(dis[node-u][u]>d+1){
                        dis[node-u][u]=d+1;
                        pq.push({d+1,node-u,u});
                    }
                }if(node+u<n){
                    if(dis[node+u][u]>d+1){
                        dis[node+u][u]=d+1;
                        pq.push({d+1,node+u,u});
                    }
                }
            }else{
                for (int i = 1; i < n; ++i)
                {
                    if(u*i+node>=n) break;
                    if(dis[node+u*i][0]>d+i){
                        dis[node+u*i][0]=d+i;
                        pq.push({d+i,node+u*i,0});
                    }
                }
                for (int i = 1; i < n; ++i)
                {
                    if(node-u*i<0) break;
                    if(dis[node-u*i][0]>d+i){
                        dis[node-u*i][0]=d+i;
                        pq.push({d+i,node-u*i,0});
                    }
                }
            }
        }
        if(lst!=0){
            if(node-lst>=0){
                if(dis[node-lst][lst]>d+1){
                    dis[node-lst][lst]=d+1;
                    pq.push({d+1,node-lst,lst});
                }
            }if(node+lst<n){
                if(dis[node+lst][lst]>d+1){
                    dis[node+lst][lst]=d+1;
                    pq.push({d+1,node+lst,lst});
                }
            }
        }
    }
    cout <<-1<<endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1112 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 0 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 3420 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 1 ms 3420 KB Output is correct
20 Correct 1 ms 3420 KB Output is correct
21 Correct 2 ms 3368 KB Output is correct
22 Correct 1 ms 3312 KB Output is correct
23 Correct 1 ms 3416 KB Output is correct
24 Correct 2 ms 3420 KB Output is correct
25 Correct 1 ms 3420 KB Output is correct
26 Correct 1 ms 3420 KB Output is correct
27 Correct 1 ms 3420 KB Output is correct
28 Incorrect 1 ms 3420 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 0 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 0 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 0 ms 1116 KB Output is correct
8 Correct 0 ms 1116 KB Output is correct
9 Correct 1 ms 1112 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 3420 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 1 ms 3164 KB Output is correct
20 Correct 1 ms 3420 KB Output is correct
21 Correct 1 ms 3164 KB Output is correct
22 Correct 1 ms 3164 KB Output is correct
23 Correct 1 ms 3420 KB Output is correct
24 Correct 1 ms 3420 KB Output is correct
25 Correct 1 ms 3420 KB Output is correct
26 Correct 2 ms 3420 KB Output is correct
27 Correct 1 ms 3160 KB Output is correct
28 Incorrect 1 ms 3252 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 0 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1112 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1248 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 3420 KB Output is correct
18 Correct 1 ms 3420 KB Output is correct
19 Correct 1 ms 3164 KB Output is correct
20 Correct 1 ms 3420 KB Output is correct
21 Correct 1 ms 3164 KB Output is correct
22 Correct 1 ms 3232 KB Output is correct
23 Correct 1 ms 3416 KB Output is correct
24 Correct 2 ms 3416 KB Output is correct
25 Correct 1 ms 3420 KB Output is correct
26 Correct 1 ms 3420 KB Output is correct
27 Correct 1 ms 3420 KB Output is correct
28 Incorrect 1 ms 3420 KB Output isn't correct
29 Halted 0 ms 0 KB -