oj.uz

Submission #710896

# Submission time Handle Problem Language Result Execution time Memory
710896 2023-03-16T04:14:20 Z JJAnawat Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 24408 KB 
#include<bits/stdc++.h>

using namespace std;
using ti = tuple<int,int,int>;

const int inf=1e9;

int n,m;
int dis[30005][175];
vector<int> bg[30005],sm[30005];
int b[30005],p[30005];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;
    int sq=sqrt(n);
    for(int i=0;i<m;i++){
        cin >> b[i] >> p[i];
        if(p[i]<=sq)
            sm[b[i]].push_back(p[i]);
        else
            bg[b[i]].push_back(p[i]);
    }

    for(int i=0;i<n;i++)
        for(int j=0;j<175;j++)
            dis[i][j]=inf;

    priority_queue<ti,vector<ti>,greater<ti>> pq;
    dis[b[0]][0]=0;
    pq.push({0,b[0],0});
    while(!pq.empty()){
        auto [du,u,pw]=pq.top();
        pq.pop();
        if(du!=dis[u][pw])
            continue;
        if(pw){
            if(u-pw>=0){
                if(du+1<dis[u-pw][pw]){
                    dis[u-pw][pw]=du+1;
                    pq.push({du+1,u-pw,pw});
                }
                if(du+1<dis[u-pw][0]){
                    dis[u-pw][0]=du+1;
                    pq.push({du+1,u-pw,0});
                }
            }
            if(u+pw<n){
                if(du+1<dis[u+pw][pw]){
                    dis[u+pw][pw]=du+1;
                    pq.push({du+1,u+pw,pw});
                }
                if(du+1<dis[u+pw][0]){
                    dis[u+pw][0]=du+1;
                    pq.push({du+1,u+pw,0});
                }
            }
        }
        for(auto pl:bg[u]){
            for(int v=u,cnt=0;v<n;v+=pl,cnt++){
                if(dis[v][0]>du+cnt){
                    dis[v][0]=du+cnt;
                    pq.push({du+cnt,v,0});
                }
            }
            for(int v=u,cnt=0;v>=0;v-=pl,cnt++){
                if(dis[v][0]>du+cnt){
                    dis[v][0]=du+cnt;
                    pq.push({du+cnt,v,0});
                }
            }
        }
        for(auto pl:sm[u]){
            if(dis[u][pl]>du){
                dis[u][pl]=du;
                pq.push({du,u,pl});
            }
        }
    }
    int mn=inf;
    for(int i=0;i<=sq;i++)
        mn=min(mn,dis[b[1]][i]);
    if(mn==inf)
        mn=-1;
    cout << mn;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1620 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 2 ms 1748 KB Output is correct
15 Correct 2 ms 1748 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 3 ms 2260 KB Output is correct
18 Correct 4 ms 2900 KB Output is correct
19 Correct 2 ms 3028 KB Output is correct
20 Correct 2 ms 3156 KB Output is correct
21 Correct 3 ms 2004 KB Output is correct
22 Correct 2 ms 2900 KB Output is correct
23 Correct 3 ms 2772 KB Output is correct
24 Correct 3 ms 3028 KB Output is correct
25 Correct 3 ms 3156 KB Output is correct
26 Correct 3 ms 3156 KB Output is correct
27 Correct 2 ms 3156 KB Output is correct
28 Correct 3 ms 3156 KB Output is correct
29 Correct 7 ms 3156 KB Output is correct
30 Correct 3 ms 3124 KB Output is correct
31 Correct 6 ms 3156 KB Output is correct
32 Correct 3 ms 3156 KB Output is correct
33 Correct 15 ms 3288 KB Output is correct
34 Correct 13 ms 3284 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1748 KB Output is correct
2 Correct 1 ms 1620 KB Output is correct
3 Correct 1 ms 1748 KB Output is correct
4 Correct 1 ms 1620 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1752 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 2 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 2 ms 1748 KB Output is correct
15 Correct 2 ms 1748 KB Output is correct
16 Correct 2 ms 1876 KB Output is correct
17 Correct 3 ms 2260 KB Output is correct
18 Correct 2 ms 2900 KB Output is correct
19 Correct 2 ms 3028 KB Output is correct
20 Correct 2 ms 3156 KB Output is correct
21 Correct 2 ms 2004 KB Output is correct
22 Correct 3 ms 2900 KB Output is correct
23 Correct 3 ms 2772 KB Output is correct
24 Correct 4 ms 3028 KB Output is correct
25 Correct 4 ms 3156 KB Output is correct
26 Correct 3 ms 3156 KB Output is correct
27 Correct 2 ms 3156 KB Output is correct
28 Correct 3 ms 3156 KB Output is correct
29 Correct 8 ms 3156 KB Output is correct
30 Correct 4 ms 3028 KB Output is correct
31 Correct 7 ms 3100 KB Output is correct
32 Correct 3 ms 3156 KB Output is correct
33 Correct 13 ms 3284 KB Output is correct
34 Correct 13 ms 3296 KB Output is correct
35 Correct 18 ms 3156 KB Output is correct
36 Correct 4 ms 2596 KB Output is correct
37 Correct 25 ms 3412 KB Output is correct
38 Correct 27 ms 3684 KB Output is correct
39 Correct 28 ms 3700 KB Output is correct
40 Correct 28 ms 3668 KB Output is correct
41 Correct 27 ms 3668 KB Output is correct
42 Correct 7 ms 3540 KB Output is correct
43 Correct 6 ms 3540 KB Output is correct
44 Correct 6 ms 3540 KB Output is correct
45 Correct 47 ms 3712 KB Output is correct
46 Correct 43 ms 3716 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1620 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Correct 1 ms 1620 KB Output is correct
4 Correct 1 ms 1748 KB Output is correct
5 Correct 2 ms 1748 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 2 ms 1876 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 2 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 2 ms 1748 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 5 ms 2260 KB Output is correct
18 Correct 2 ms 2900 KB Output is correct
19 Correct 2 ms 3028 KB Output is correct
20 Correct 2 ms 3156 KB Output is correct
21 Correct 1 ms 2004 KB Output is correct
22 Correct 2 ms 2900 KB Output is correct
23 Correct 2 ms 2772 KB Output is correct
24 Correct 3 ms 3028 KB Output is correct
25 Correct 3 ms 3156 KB Output is correct
26 Correct 3 ms 3028 KB Output is correct
27 Correct 3 ms 3156 KB Output is correct
28 Correct 3 ms 3156 KB Output is correct
29 Correct 8 ms 3156 KB Output is correct
30 Correct 4 ms 3028 KB Output is correct
31 Correct 7 ms 3176 KB Output is correct
32 Correct 4 ms 3156 KB Output is correct
33 Correct 18 ms 3336 KB Output is correct
34 Correct 14 ms 3288 KB Output is correct
35 Correct 18 ms 3236 KB Output is correct
36 Correct 4 ms 2516 KB Output is correct
37 Correct 25 ms 3520 KB Output is correct
38 Correct 28 ms 3696 KB Output is correct
39 Correct 27 ms 3668 KB Output is correct
40 Correct 27 ms 3668 KB Output is correct
41 Correct 30 ms 3668 KB Output is correct
42 Correct 6 ms 3540 KB Output is correct
43 Correct 6 ms 3540 KB Output is correct
44 Correct 6 ms 3540 KB Output is correct
45 Correct 48 ms 3712 KB Output is correct
46 Correct 45 ms 3668 KB Output is correct
47 Correct 144 ms 11240 KB Output is correct
48 Correct 16 ms 18260 KB Output is correct
49 Correct 17 ms 19720 KB Output is correct
50 Correct 16 ms 21324 KB Output is correct
51 Correct 68 ms 23692 KB Output is correct
52 Correct 76 ms 23572 KB Output is correct
53 Correct 25 ms 23084 KB Output is correct
54 Correct 16 ms 22188 KB Output is correct
55 Correct 14 ms 22228 KB Output is correct
56 Correct 20 ms 23380 KB Output is correct
57 Correct 75 ms 22288 KB Output is correct
58 Correct 20 ms 22644 KB Output is correct
59 Correct 23 ms 22776 KB Output is correct
60 Correct 30 ms 22704 KB Output is correct
61 Correct 26 ms 22760 KB Output is correct
62 Correct 58 ms 23380 KB Output is correct
63 Correct 70 ms 24388 KB Output is correct
64 Correct 84 ms 24408 KB Output is correct
65 Execution timed out 1049 ms 24292 KB Time limit exceeded
66 Halted 0 ms 0 KB -