oj.uz

답안 #1016391

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016391 2024-07-08T03:37:51 Z Icelast Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 452 ms 262144 KB 
#include <iostream>
#include <bits/stdc++.h>
#define ll int
using namespace std;
const ll maxn = 2*1e5+5, INF = 4e18+9;
const int B = 200;
vector<ll> dijkstra(int n, int s, vector<vector<pair<int, int>>> &adj){
    vector<ll> dist(n+1, INF);
    dist[s] = 0;
    vector<bool> vis(n+1, false);
    priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq;
    pq.push({0, s});
    while(!pq.empty()){
        ll d_u = pq.top().first;
        int u = pq.top().second;
        pq.pop();
        if(vis[u]){
            continue;
        }
        vis[u] = true;
        for(auto it : adj[u]){
            int v = it.first;
            ll w = it.second;
            if(vis[v]) continue;
            dist[v] = min(dist[v], d_u+w);
            pq.push({dist[v], v});
        }
    }
    return dist;
}
void solve(){
    int n, m;
    cin >> n >> m;
    vector<ll> b(m+1), p(m+1);
    for(int i = 1; i <= m; i++){
        cin >> b[i] >> p[i];
        b[i]++;
    }
    int c = 0;
    vector<vector<int>> cv(n+1, vector<int>(B+1));
    vector<vector<bool>> have_doge(n+1, vector<bool>(B+1, false));
    for(int i = 1; i <= m; i++){
        if(p[i] <= B){
            have_doge[b[i]][p[i]] = true;
        }
    }
    vector<pair<int, int>> dc;
    dc.push_back({-1, -1});
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= B; j++){
            c++;
            cv[i][j] = c;
            dc.push_back({i, j});
        }
    }
    int nb = c;
    auto valid = [&](int x) -> bool{
        return (x >= 1 && x <= n);
    };
    vector<vector<pair<ll, ll>>> adj(nb+1);
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= B; j++){
            int u, v;
            u = cv[i][0];
            v = cv[i][j];
            if(have_doge[i][j]){
                adj[u].push_back({v, 0});
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= B; j++){
            int u, v;
            if(valid(i+j)){
                u = cv[i][j];
                v = cv[i+j][0];
                adj[u].push_back({v, 1});
                v = cv[i+j][j];
                adj[u].push_back({v, 1});
            }
            if(valid(i-j)){
                u = cv[i][j];
                v = cv[i-j][0];
                adj[u].push_back({v, 1});
                v = cv[i-j][j];
                adj[u].push_back({v, 1});
            }
        }
    }
    for(int i = 1; i <= m; i++){
        int pos, u, v;
        pos = b[i];
        if(p[i] <= B) continue;
        for(int j = -B; j <= B; j++){
            if(valid(pos+j*p[i]) && j != 0){
                u = cv[pos][0];
                v = cv[pos+j*p[i]][0];
                adj[u].push_back({v, abs(j)});
            }
        }
    }
    for(int j = 1; j <= n; j++){
        if(abs(b[1]-j)%p[1] == 0){
            ll w = abs(b[1]-j)/p[1];
            adj[0].push_back({cv[j][0], w});
        }
    }
    int S = 0, T = cv[b[2]][0];
    vector<ll> dist = dijkstra(nb, S, adj);
    ll ans = dist[T];
    if(ans == INF){
        ans = -1;
    }
    cout << ans;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
}

Compilation message

skyscraper.cpp:5:36: warning: overflow in conversion from 'double' to 'int' changes value from '4.0e+18' to '2147483647' [-Woverflow]
    5 | const ll maxn = 2*1e5+5, INF = 4e18+9;
      |                                ~~~~^~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 1496 KB Output is correct
11 Correct 2 ms 1504 KB Output is correct
12 Correct 3 ms 1504 KB Output is correct
13 Correct 1 ms 1504 KB Output is correct
14 Correct 2 ms 1504 KB Output is correct
15 Correct 2 ms 1504 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 2 ms 1496 KB Output is correct
11 Correct 2 ms 1504 KB Output is correct
12 Correct 2 ms 1504 KB Output is correct
13 Correct 1 ms 1504 KB Output is correct
14 Correct 2 ms 1500 KB Output is correct
15 Correct 2 ms 1504 KB Output is correct
16 Correct 4 ms 3028 KB Output is correct
17 Correct 19 ms 12824 KB Output is correct
18 Correct 38 ms 30056 KB Output is correct
19 Correct 44 ms 34740 KB Output is correct
20 Correct 44 ms 34760 KB Output is correct
21 Correct 9 ms 6612 KB Output is correct
22 Correct 38 ms 30920 KB Output is correct
23 Correct 41 ms 27596 KB Output is correct
24 Correct 43 ms 33212 KB Output is correct
25 Correct 44 ms 35260 KB Output is correct
26 Correct 45 ms 35528 KB Output is correct
27 Correct 43 ms 34552 KB Output is correct
28 Correct 46 ms 34740 KB Output is correct
29 Correct 54 ms 34664 KB Output is correct
30 Correct 44 ms 35256 KB Output is correct
31 Correct 50 ms 34500 KB Output is correct
32 Correct 53 ms 35000 KB Output is correct
33 Correct 78 ms 34740 KB Output is correct
34 Correct 58 ms 34760 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 1496 KB Output is correct
11 Correct 2 ms 1504 KB Output is correct
12 Correct 1 ms 1504 KB Output is correct
13 Correct 2 ms 1756 KB Output is correct
14 Correct 2 ms 1504 KB Output is correct
15 Correct 3 ms 1504 KB Output is correct
16 Correct 4 ms 3020 KB Output is correct
17 Correct 18 ms 12772 KB Output is correct
18 Correct 37 ms 30260 KB Output is correct
19 Correct 42 ms 34488 KB Output is correct
20 Correct 43 ms 34760 KB Output is correct
21 Correct 9 ms 6608 KB Output is correct
22 Correct 38 ms 30616 KB Output is correct
23 Correct 35 ms 28864 KB Output is correct
24 Correct 42 ms 32852 KB Output is correct
25 Correct 51 ms 35476 KB Output is correct
26 Correct 43 ms 34744 KB Output is correct
27 Correct 44 ms 34732 KB Output is correct
28 Correct 45 ms 35000 KB Output is correct
29 Correct 53 ms 34792 KB Output is correct
30 Correct 45 ms 34544 KB Output is correct
31 Correct 51 ms 35232 KB Output is correct
32 Correct 46 ms 34488 KB Output is correct
33 Correct 60 ms 35432 KB Output is correct
34 Correct 59 ms 35436 KB Output is correct
35 Correct 56 ms 27280 KB Output is correct
36 Correct 27 ms 18896 KB Output is correct
37 Correct 74 ms 34772 KB Output is correct
38 Correct 71 ms 35808 KB Output is correct
39 Correct 74 ms 36032 KB Output is correct
40 Correct 79 ms 36540 KB Output is correct
41 Correct 76 ms 35880 KB Output is correct
42 Correct 46 ms 34752 KB Output is correct
43 Correct 47 ms 35312 KB Output is correct
44 Correct 46 ms 35272 KB Output is correct
45 Correct 112 ms 38764 KB Output is correct
46 Correct 120 ms 38672 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 1 ms 1496 KB Output is correct
11 Correct 2 ms 1504 KB Output is correct
12 Correct 2 ms 1504 KB Output is correct
13 Correct 2 ms 1504 KB Output is correct
14 Correct 2 ms 1504 KB Output is correct
15 Correct 2 ms 1500 KB Output is correct
16 Correct 4 ms 3028 KB Output is correct
17 Correct 23 ms 12712 KB Output is correct
18 Correct 40 ms 30764 KB Output is correct
19 Correct 47 ms 34488 KB Output is correct
20 Correct 43 ms 34744 KB Output is correct
21 Correct 9 ms 6540 KB Output is correct
22 Correct 39 ms 31456 KB Output is correct
23 Correct 36 ms 27588 KB Output is correct
24 Correct 43 ms 32972 KB Output is correct
25 Correct 46 ms 35452 KB Output is correct
26 Correct 44 ms 34492 KB Output is correct
27 Correct 43 ms 34496 KB Output is correct
28 Correct 44 ms 35248 KB Output is correct
29 Correct 65 ms 35000 KB Output is correct
30 Correct 47 ms 35656 KB Output is correct
31 Correct 48 ms 35000 KB Output is correct
32 Correct 45 ms 35000 KB Output is correct
33 Correct 59 ms 34860 KB Output is correct
34 Correct 58 ms 34600 KB Output is correct
35 Correct 51 ms 26816 KB Output is correct
36 Correct 30 ms 18896 KB Output is correct
37 Correct 70 ms 34748 KB Output is correct
38 Correct 73 ms 35768 KB Output is correct
39 Correct 93 ms 35848 KB Output is correct
40 Correct 79 ms 35780 KB Output is correct
41 Correct 77 ms 35768 KB Output is correct
42 Correct 48 ms 34840 KB Output is correct
43 Correct 47 ms 34752 KB Output is correct
44 Correct 54 ms 34836 KB Output is correct
45 Correct 111 ms 38128 KB Output is correct
46 Correct 119 ms 38588 KB Output is correct
47 Correct 452 ms 221860 KB Output is correct
48 Runtime error 252 ms 262144 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -