oj.uz

답안 #1016392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016392 2024-07-08T03:40:13 Z Icelast Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 401 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 = 174;
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 1 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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 600 KB Output is correct
6 Correct 0 ms 344 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 1260 KB Output is correct
11 Correct 2 ms 1496 KB Output is correct
12 Correct 1 ms 1240 KB Output is correct
13 Correct 1 ms 1240 KB Output is correct
14 Correct 2 ms 1496 KB Output is correct
15 Correct 2 ms 1496 KB Output is correct

Subtask #3
14.0 / 14.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 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 2 ms 1240 KB Output is correct
11 Correct 2 ms 1496 KB Output is correct
12 Correct 2 ms 1240 KB Output is correct
13 Correct 2 ms 1240 KB Output is correct
14 Correct 2 ms 1496 KB Output is correct
15 Correct 2 ms 1496 KB Output is correct
16 Correct 4 ms 2772 KB Output is correct
17 Correct 16 ms 11228 KB Output is correct
18 Correct 34 ms 26588 KB Output is correct
19 Correct 40 ms 30132 KB Output is correct
20 Correct 38 ms 30392 KB Output is correct
21 Correct 8 ms 5836 KB Output is correct
22 Correct 34 ms 28460 KB Output is correct
23 Correct 32 ms 24776 KB Output is correct
24 Correct 38 ms 30144 KB Output is correct
25 Correct 42 ms 30228 KB Output is correct
26 Correct 39 ms 31420 KB Output is correct
27 Correct 39 ms 30148 KB Output is correct
28 Correct 42 ms 31428 KB Output is correct
29 Correct 46 ms 30152 KB Output is correct
30 Correct 39 ms 30912 KB Output is correct
31 Correct 51 ms 30140 KB Output is correct
32 Correct 42 ms 30908 KB Output is correct
33 Correct 54 ms 30412 KB Output is correct
34 Correct 50 ms 30664 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 1 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 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 2 ms 1240 KB Output is correct
11 Correct 2 ms 1496 KB Output is correct
12 Correct 1 ms 1240 KB Output is correct
13 Correct 1 ms 1240 KB Output is correct
14 Correct 2 ms 1496 KB Output is correct
15 Correct 2 ms 1496 KB Output is correct
16 Correct 3 ms 2772 KB Output is correct
17 Correct 18 ms 11268 KB Output is correct
18 Correct 33 ms 26304 KB Output is correct
19 Correct 45 ms 30144 KB Output is correct
20 Correct 38 ms 30908 KB Output is correct
21 Correct 11 ms 5836 KB Output is correct
22 Correct 35 ms 26848 KB Output is correct
23 Correct 31 ms 24516 KB Output is correct
24 Correct 54 ms 28620 KB Output is correct
25 Correct 38 ms 30904 KB Output is correct
26 Correct 43 ms 30144 KB Output is correct
27 Correct 37 ms 30140 KB Output is correct
28 Correct 41 ms 30760 KB Output is correct
29 Correct 47 ms 30152 KB Output is correct
30 Correct 40 ms 30396 KB Output is correct
31 Correct 43 ms 30528 KB Output is correct
32 Correct 40 ms 30148 KB Output is correct
33 Correct 54 ms 30400 KB Output is correct
34 Correct 52 ms 31624 KB Output is correct
35 Correct 49 ms 22476 KB Output is correct
36 Correct 23 ms 16592 KB Output is correct
37 Correct 62 ms 30608 KB Output is correct
38 Correct 87 ms 31332 KB Output is correct
39 Correct 65 ms 32444 KB Output is correct
40 Correct 68 ms 31936 KB Output is correct
41 Correct 70 ms 31596 KB Output is correct
42 Correct 40 ms 30408 KB Output is correct
43 Correct 39 ms 31440 KB Output is correct
44 Correct 40 ms 30920 KB Output is correct
45 Correct 111 ms 35516 KB Output is correct
46 Correct 120 ms 37476 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 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 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 1240 KB Output is correct
11 Correct 2 ms 1496 KB Output is correct
12 Correct 3 ms 1240 KB Output is correct
13 Correct 1 ms 1240 KB Output is correct
14 Correct 3 ms 1496 KB Output is correct
15 Correct 2 ms 1496 KB Output is correct
16 Correct 3 ms 2772 KB Output is correct
17 Correct 15 ms 11188 KB Output is correct
18 Correct 32 ms 27344 KB Output is correct
19 Correct 53 ms 31160 KB Output is correct
20 Correct 39 ms 30912 KB Output is correct
21 Correct 8 ms 5840 KB Output is correct
22 Correct 36 ms 28364 KB Output is correct
23 Correct 31 ms 25948 KB Output is correct
24 Correct 40 ms 29044 KB Output is correct
25 Correct 39 ms 31180 KB Output is correct
26 Correct 46 ms 31156 KB Output is correct
27 Correct 40 ms 30288 KB Output is correct
28 Correct 41 ms 30144 KB Output is correct
29 Correct 46 ms 30672 KB Output is correct
30 Correct 41 ms 30144 KB Output is correct
31 Correct 42 ms 30952 KB Output is correct
32 Correct 41 ms 30488 KB Output is correct
33 Correct 54 ms 31420 KB Output is correct
34 Correct 60 ms 30696 KB Output is correct
35 Correct 53 ms 22464 KB Output is correct
36 Correct 23 ms 16592 KB Output is correct
37 Correct 62 ms 31168 KB Output is correct
38 Correct 66 ms 32704 KB Output is correct
39 Correct 68 ms 31476 KB Output is correct
40 Correct 88 ms 32344 KB Output is correct
41 Correct 69 ms 31560 KB Output is correct
42 Correct 40 ms 31168 KB Output is correct
43 Correct 40 ms 31696 KB Output is correct
44 Correct 41 ms 30688 KB Output is correct
45 Correct 113 ms 35548 KB Output is correct
46 Correct 109 ms 36032 KB Output is correct
47 Correct 401 ms 193448 KB Output is correct
48 Runtime error 263 ms 262144 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -