oj.uz

Submission #710898

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

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

const int inf=1e9;

int n,m;
int dis[30005][305];
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<=sq;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;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:35:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |         auto [du,u,pw]=pq.top();
      |              ^

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 1620 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 1620 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 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 1 ms 1748 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 2 ms 1876 KB Output is correct
13 Correct 2 ms 1876 KB Output is correct
14 Correct 3 ms 1876 KB Output is correct
15 Correct 2 ms 1876 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 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
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1828 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 3 ms 2644 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 2 ms 4052 KB Output is correct
20 Correct 3 ms 4180 KB Output is correct
21 Correct 1 ms 2132 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 3 ms 3668 KB Output is correct
24 Correct 4 ms 4052 KB Output is correct
25 Correct 3 ms 4180 KB Output is correct
26 Correct 4 ms 4052 KB Output is correct
27 Correct 3 ms 4052 KB Output is correct
28 Correct 4 ms 4180 KB Output is correct
29 Correct 9 ms 4052 KB Output is correct
30 Correct 4 ms 4052 KB Output is correct
31 Correct 6 ms 4180 KB Output is correct
32 Correct 3 ms 4180 KB Output is correct
33 Correct 14 ms 4308 KB Output is correct
34 Correct 15 ms 4308 KB Output is correct

Subtask #4
21.0 / 21.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 1748 KB Output is correct
4 Correct 2 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 1876 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 1 ms 1880 KB Output is correct
17 Correct 3 ms 2644 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 2 ms 4052 KB Output is correct
20 Correct 2 ms 4180 KB Output is correct
21 Correct 2 ms 2204 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 3 ms 3668 KB Output is correct
24 Correct 4 ms 4052 KB Output is correct
25 Correct 3 ms 4180 KB Output is correct
26 Correct 3 ms 4052 KB Output is correct
27 Correct 3 ms 4052 KB Output is correct
28 Correct 4 ms 4180 KB Output is correct
29 Correct 10 ms 4164 KB Output is correct
30 Correct 5 ms 4052 KB Output is correct
31 Correct 6 ms 4180 KB Output is correct
32 Correct 4 ms 4180 KB Output is correct
33 Correct 14 ms 4308 KB Output is correct
34 Correct 15 ms 4336 KB Output is correct
35 Correct 19 ms 3924 KB Output is correct
36 Correct 3 ms 3156 KB Output is correct
37 Correct 39 ms 4420 KB Output is correct
38 Correct 37 ms 4692 KB Output is correct
39 Correct 33 ms 4692 KB Output is correct
40 Correct 31 ms 4700 KB Output is correct
41 Correct 28 ms 4692 KB Output is correct
42 Correct 6 ms 4564 KB Output is correct
43 Correct 7 ms 4564 KB Output is correct
44 Correct 7 ms 4564 KB Output is correct
45 Correct 45 ms 4732 KB Output is correct
46 Correct 46 ms 4668 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1620 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 2 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 1876 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 1 ms 1876 KB Output is correct
13 Correct 1 ms 1876 KB Output is correct
14 Correct 2 ms 1876 KB Output is correct
15 Correct 2 ms 1876 KB Output is correct
16 Correct 1 ms 2004 KB Output is correct
17 Correct 4 ms 2644 KB Output is correct
18 Correct 2 ms 3796 KB Output is correct
19 Correct 3 ms 4052 KB Output is correct
20 Correct 3 ms 4180 KB Output is correct
21 Correct 1 ms 2132 KB Output is correct
22 Correct 2 ms 3796 KB Output is correct
23 Correct 3 ms 3668 KB Output is correct
24 Correct 4 ms 4052 KB Output is correct
25 Correct 3 ms 4180 KB Output is correct
26 Correct 3 ms 4052 KB Output is correct
27 Correct 3 ms 4052 KB Output is correct
28 Correct 3 ms 4180 KB Output is correct
29 Correct 12 ms 4176 KB Output is correct
30 Correct 3 ms 4052 KB Output is correct
31 Correct 8 ms 4192 KB Output is correct
32 Correct 5 ms 4224 KB Output is correct
33 Correct 16 ms 4332 KB Output is correct
34 Correct 14 ms 4308 KB Output is correct
35 Correct 19 ms 3976 KB Output is correct
36 Correct 5 ms 3156 KB Output is correct
37 Correct 29 ms 4480 KB Output is correct
38 Correct 27 ms 4704 KB Output is correct
39 Correct 28 ms 4636 KB Output is correct
40 Correct 29 ms 4716 KB Output is correct
41 Correct 28 ms 4684 KB Output is correct
42 Correct 7 ms 4508 KB Output is correct
43 Correct 5 ms 4564 KB Output is correct
44 Correct 6 ms 4504 KB Output is correct
45 Correct 51 ms 4744 KB Output is correct
46 Correct 58 ms 4680 KB Output is correct
47 Correct 188 ms 17448 KB Output is correct
48 Correct 26 ms 30036 KB Output is correct
49 Correct 18 ms 32596 KB Output is correct
50 Correct 19 ms 35444 KB Output is correct
51 Correct 70 ms 38796 KB Output is correct
52 Correct 74 ms 38804 KB Output is correct
53 Correct 29 ms 38348 KB Output is correct
54 Correct 18 ms 37460 KB Output is correct
55 Correct 23 ms 37544 KB Output is correct
56 Correct 27 ms 38612 KB Output is correct
57 Correct 111 ms 37652 KB Output is correct
58 Correct 24 ms 37972 KB Output is correct
59 Correct 30 ms 37992 KB Output is correct
60 Correct 35 ms 37928 KB Output is correct
61 Correct 28 ms 37944 KB Output is correct
62 Correct 82 ms 38700 KB Output is correct
63 Correct 77 ms 39628 KB Output is correct
64 Correct 93 ms 39620 KB Output is correct
65 Execution timed out 1092 ms 39656 KB Time limit exceeded
66 Halted 0 ms 0 KB -