oj.uz

답안 #1023130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023130 2024-07-14T10:20:08 Z MarwenElarbi Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 25808 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)
    {
        for (int j = 0; j < 180; ++j)
        {
            dis[i][j]=1e9;
        }
    }
    dis[fir.fi][0]=0;
    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<180){
                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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 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 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 1116 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 0 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1176 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 2 ms 1120 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 2 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1120 KB Output is correct
2 Correct 0 ms 1116 KB Output is correct
3 Correct 0 ms 1176 KB Output is correct
4 Correct 1 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 1160 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 0 ms 1172 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 1 ms 1120 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 2 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 1628 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 2 ms 2656 KB Output is correct
21 Correct 1 ms 1376 KB Output is correct
22 Correct 1 ms 2400 KB Output is correct
23 Correct 1 ms 2140 KB Output is correct
24 Correct 2 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 2 ms 2396 KB Output is correct
28 Correct 2 ms 2816 KB Output is correct
29 Correct 5 ms 2640 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 4 ms 2396 KB Output is correct
32 Correct 3 ms 2396 KB Output is correct
33 Correct 11 ms 2652 KB Output is correct
34 Correct 7 ms 2652 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 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 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 1176 KB Output is correct
9 Correct 1 ms 1216 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 2 ms 1356 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 1628 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 1372 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2344 KB Output is correct
24 Correct 2 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 6 ms 2396 KB Output is correct
30 Correct 2 ms 2476 KB Output is correct
31 Correct 4 ms 2396 KB Output is correct
32 Correct 3 ms 2396 KB Output is correct
33 Correct 11 ms 2652 KB Output is correct
34 Correct 8 ms 2648 KB Output is correct
35 Correct 5 ms 2648 KB Output is correct
36 Correct 3 ms 1884 KB Output is correct
37 Correct 6 ms 2988 KB Output is correct
38 Correct 6 ms 3164 KB Output is correct
39 Correct 5 ms 2908 KB Output is correct
40 Correct 5 ms 3044 KB Output is correct
41 Correct 5 ms 3164 KB Output is correct
42 Correct 4 ms 2908 KB Output is correct
43 Correct 4 ms 2796 KB Output is correct
44 Correct 4 ms 2908 KB Output is correct
45 Correct 77 ms 3928 KB Output is correct
46 Correct 52 ms 3672 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 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 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 1116 KB Output is correct
8 Correct 1 ms 1116 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 1184 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 2 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 1628 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2652 KB Output is correct
21 Correct 1 ms 1372 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 2 ms 2136 KB Output is correct
24 Correct 2 ms 2396 KB Output is correct
25 Correct 2 ms 2396 KB Output is correct
26 Correct 1 ms 2464 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2664 KB Output is correct
29 Correct 6 ms 2456 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 3 ms 2612 KB Output is correct
32 Correct 3 ms 2396 KB Output is correct
33 Correct 11 ms 2708 KB Output is correct
34 Correct 9 ms 2524 KB Output is correct
35 Correct 5 ms 2724 KB Output is correct
36 Correct 2 ms 1880 KB Output is correct
37 Correct 5 ms 2908 KB Output is correct
38 Correct 7 ms 3164 KB Output is correct
39 Correct 5 ms 2908 KB Output is correct
40 Correct 5 ms 2908 KB Output is correct
41 Correct 5 ms 3036 KB Output is correct
42 Correct 4 ms 2908 KB Output is correct
43 Correct 4 ms 2908 KB Output is correct
44 Correct 4 ms 2908 KB Output is correct
45 Correct 74 ms 3736 KB Output is correct
46 Correct 53 ms 3672 KB Output is correct
47 Correct 10 ms 10800 KB Output is correct
48 Correct 13 ms 18012 KB Output is correct
49 Correct 14 ms 19548 KB Output is correct
50 Correct 10 ms 21340 KB Output is correct
51 Correct 21 ms 23764 KB Output is correct
52 Correct 19 ms 23580 KB Output is correct
53 Correct 13 ms 23132 KB Output is correct
54 Correct 9 ms 22108 KB Output is correct
55 Correct 9 ms 22108 KB Output is correct
56 Correct 13 ms 23388 KB Output is correct
57 Correct 8 ms 22360 KB Output is correct
58 Correct 17 ms 22616 KB Output is correct
59 Correct 12 ms 22620 KB Output is correct
60 Correct 12 ms 22620 KB Output is correct
61 Correct 13 ms 22616 KB Output is correct
62 Correct 31 ms 23388 KB Output is correct
63 Correct 38 ms 24280 KB Output is correct
64 Correct 40 ms 24276 KB Output is correct
65 Correct 492 ms 24296 KB Output is correct
66 Execution timed out 1036 ms 25808 KB Time limit exceeded
67 Halted 0 ms 0 KB -