oj.uz

Submission #972383

# Submission time Handle Problem Language Result Execution time Memory
972383 2024-04-30T11:36:00 Z Halym2007 Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 349 ms 262144 KB 
#include "bits/stdc++.h"
#define ll long long int
#define pb push_back
#define pii pair<int,int>
#define ff first
#define ss second
#define sz size()

const int N = 2e5 + 1;

using namespace std;

int n, m, b[N], p[N];

vector <vector<pii>> v;

priority_queue <pii> pq;

vector <int> dis(N,1e9);

map <pii,int> mp;

void f(){
    pq.push({0,b[1]});
    dis[b[1]] = 0;
    while(!pq.empty()){
        int a = pq.top().ss;
        pq.pop();
        for(auto i: v[a]){
            if(dis[a] + i.ss < dis[i.ff]){
                dis[i.ff] = dis[a] + i.ss;
                pq.push({-dis[i.ff],i.ff});
            }
        }
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
    cin >> n >> m;
    for(int i = 1; i <= m; i++){
        cin >> b[i] >> p[i];
        mp[{b[i],p[i]}] = 1;
    }
    v.resize(n+1);
    for(int i = 1; i <= m; i++){
        int nd = b[i], cnt = 0;
        while(1){
            nd -= p[i];
            if(nd < 0) break;
            cnt++;
            v[b[i]].pb({nd,cnt});
            if(mp.find({nd,p[i]}) != mp.end()) break;
        }
        nd = b[i], cnt = 0;
        while(1){
            nd += p[i];
            if(nd > n-1) break;
            cnt++;
            v[b[i]].pb({nd,cnt});
            if(mp.find({nd,p[i]}) != mp.end()) break;
        }
    }
    f();
    cout << (dis[b[2]] == 1e9 ? -1 : dis[b[2]]);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 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 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 1260 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 1260 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 2 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 4 ms 3288 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 2 ms 1624 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct

Subtask #3
14.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 1368 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1160 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 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 2 ms 1372 KB Output is correct
12 Correct 4 ms 3288 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 2 ms 1400 KB Output is correct
15 Correct 1 ms 1372 KB Output is correct
16 Correct 2 ms 1372 KB Output is correct
17 Correct 3 ms 1536 KB Output is correct
18 Correct 2 ms 1368 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 1 ms 1372 KB Output is correct
22 Correct 1 ms 1372 KB Output is correct
23 Correct 2 ms 1372 KB Output is correct
24 Correct 3 ms 1372 KB Output is correct
25 Correct 2 ms 1372 KB Output is correct
26 Correct 59 ms 35692 KB Output is correct
27 Correct 62 ms 35248 KB Output is correct
28 Correct 4 ms 1628 KB Output is correct
29 Correct 3 ms 2140 KB Output is correct
30 Correct 2 ms 1368 KB Output is correct
31 Correct 3 ms 1628 KB Output is correct
32 Correct 2 ms 1624 KB Output is correct
33 Correct 4 ms 2908 KB Output is correct
34 Correct 5 ms 2908 KB Output is correct

Subtask #4
0 / 21.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 1368 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1268 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 1 ms 1256 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 2 ms 1372 KB Output is correct
12 Correct 5 ms 3288 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 3 ms 1372 KB Output is correct
18 Correct 1 ms 1368 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 1 ms 1372 KB Output is correct
22 Correct 1 ms 1372 KB Output is correct
23 Correct 2 ms 1372 KB Output is correct
24 Correct 3 ms 1628 KB Output is correct
25 Correct 2 ms 1372 KB Output is correct
26 Correct 59 ms 35956 KB Output is correct
27 Correct 61 ms 35760 KB Output is correct
28 Correct 3 ms 1628 KB Output is correct
29 Correct 3 ms 2140 KB Output is correct
30 Correct 1 ms 1372 KB Output is correct
31 Correct 2 ms 1628 KB Output is correct
32 Correct 2 ms 1628 KB Output is correct
33 Correct 4 ms 2908 KB Output is correct
34 Correct 5 ms 2908 KB Output is correct
35 Correct 27 ms 4164 KB Output is correct
36 Correct 4 ms 1628 KB Output is correct
37 Correct 34 ms 4948 KB Output is correct
38 Correct 36 ms 5456 KB Output is correct
39 Correct 36 ms 5456 KB Output is correct
40 Correct 35 ms 5456 KB Output is correct
41 Correct 37 ms 5520 KB Output is correct
42 Runtime error 349 ms 262144 KB Execution killed with signal 9
43 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 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 2 ms 1364 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 1 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 4 ms 3288 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 3 ms 1372 KB Output is correct
18 Correct 2 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 2 ms 1372 KB Output is correct
21 Correct 1 ms 1372 KB Output is correct
22 Correct 1 ms 1372 KB Output is correct
23 Correct 2 ms 1372 KB Output is correct
24 Correct 3 ms 1372 KB Output is correct
25 Correct 2 ms 1372 KB Output is correct
26 Correct 58 ms 35480 KB Output is correct
27 Correct 68 ms 34480 KB Output is correct
28 Correct 3 ms 1628 KB Output is correct
29 Correct 3 ms 2140 KB Output is correct
30 Correct 2 ms 1372 KB Output is correct
31 Correct 2 ms 1628 KB Output is correct
32 Correct 2 ms 1628 KB Output is correct
33 Correct 7 ms 2908 KB Output is correct
34 Correct 5 ms 2904 KB Output is correct
35 Correct 23 ms 4380 KB Output is correct
36 Correct 4 ms 1880 KB Output is correct
37 Correct 34 ms 4948 KB Output is correct
38 Correct 36 ms 5460 KB Output is correct
39 Correct 36 ms 5456 KB Output is correct
40 Correct 36 ms 5468 KB Output is correct
41 Correct 36 ms 5468 KB Output is correct
42 Runtime error 322 ms 262144 KB Execution killed with signal 9
43 Halted 0 ms 0 KB -