oj.uz

답안 #1016396

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1016396 2024-07-08T04:00:37 Z Icelast Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 420 ms 262144 KB 
#include <iostream>
#include <bits/stdc++.h>
#define ll int
using namespace std;
const ll maxn = 2*1e5+5, INF = 1e9+9;
const int B = 200;
vector<ll> dijkstra(int n, int s, vector<vector<pair<int, short>>> &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;
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= B; j++){
            c++;
            cv[i][j] = c;
        }
    }
    int nb = c;
    auto valid = [&](int x) -> bool{
        return (x >= 1 && x <= n);
    };
    vector<vector<pair<int, short>>> 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();
}

Subtask #1
10.0 / 10.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 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 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 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 1 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 1372 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 2 ms 1428 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 344 KB Output is correct
5 Correct 0 ms 344 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 1372 KB Output is correct
11 Correct 2 ms 1368 KB Output is correct
12 Correct 2 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 4 ms 2652 KB Output is correct
17 Correct 20 ms 11612 KB Output is correct
18 Correct 34 ms 27516 KB Output is correct
19 Correct 39 ms 31324 KB Output is correct
20 Correct 39 ms 31436 KB Output is correct
21 Correct 9 ms 5980 KB Output is correct
22 Correct 48 ms 27896 KB Output is correct
23 Correct 32 ms 24916 KB Output is correct
24 Correct 39 ms 29776 KB Output is correct
25 Correct 41 ms 31312 KB Output is correct
26 Correct 44 ms 31580 KB Output is correct
27 Correct 43 ms 31316 KB Output is correct
28 Correct 50 ms 31312 KB Output is correct
29 Correct 56 ms 31568 KB Output is correct
30 Correct 44 ms 31316 KB Output is correct
31 Correct 42 ms 31580 KB Output is correct
32 Correct 45 ms 31316 KB Output is correct
33 Correct 54 ms 31572 KB Output is correct
34 Correct 54 ms 31640 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 356 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 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 1372 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 2 ms 1372 KB Output is correct
16 Correct 3 ms 2652 KB Output is correct
17 Correct 17 ms 11496 KB Output is correct
18 Correct 34 ms 27272 KB Output is correct
19 Correct 39 ms 31316 KB Output is correct
20 Correct 40 ms 31580 KB Output is correct
21 Correct 10 ms 5980 KB Output is correct
22 Correct 35 ms 27956 KB Output is correct
23 Correct 31 ms 24912 KB Output is correct
24 Correct 40 ms 29772 KB Output is correct
25 Correct 45 ms 31316 KB Output is correct
26 Correct 41 ms 31520 KB Output is correct
27 Correct 48 ms 31312 KB Output is correct
28 Correct 44 ms 31300 KB Output is correct
29 Correct 46 ms 31580 KB Output is correct
30 Correct 45 ms 31464 KB Output is correct
31 Correct 45 ms 31412 KB Output is correct
32 Correct 43 ms 31568 KB Output is correct
33 Correct 50 ms 31576 KB Output is correct
34 Correct 55 ms 31576 KB Output is correct
35 Correct 48 ms 23120 KB Output is correct
36 Correct 32 ms 16988 KB Output is correct
37 Correct 73 ms 31716 KB Output is correct
38 Correct 74 ms 32592 KB Output is correct
39 Correct 71 ms 32596 KB Output is correct
40 Correct 71 ms 32592 KB Output is correct
41 Correct 71 ms 32596 KB Output is correct
42 Correct 44 ms 31636 KB Output is correct
43 Correct 42 ms 31580 KB Output is correct
44 Correct 41 ms 31828 KB Output is correct
45 Correct 110 ms 33992 KB Output is correct
46 Correct 108 ms 33996 KB Output is correct

Subtask #5
0 / 43.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 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 2 ms 1368 KB Output is correct
11 Correct 2 ms 1372 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 2 ms 1480 KB Output is correct
16 Correct 3 ms 2652 KB Output is correct
17 Correct 16 ms 11612 KB Output is correct
18 Correct 36 ms 27476 KB Output is correct
19 Correct 40 ms 31324 KB Output is correct
20 Correct 40 ms 31460 KB Output is correct
21 Correct 8 ms 5980 KB Output is correct
22 Correct 36 ms 27948 KB Output is correct
23 Correct 32 ms 25180 KB Output is correct
24 Correct 45 ms 29776 KB Output is correct
25 Correct 42 ms 31312 KB Output is correct
26 Correct 42 ms 31312 KB Output is correct
27 Correct 39 ms 31320 KB Output is correct
28 Correct 42 ms 31324 KB Output is correct
29 Correct 53 ms 31372 KB Output is correct
30 Correct 52 ms 31552 KB Output is correct
31 Correct 45 ms 31520 KB Output is correct
32 Correct 45 ms 31568 KB Output is correct
33 Correct 52 ms 31576 KB Output is correct
34 Correct 53 ms 31472 KB Output is correct
35 Correct 55 ms 23404 KB Output is correct
36 Correct 23 ms 16984 KB Output is correct
37 Correct 69 ms 31696 KB Output is correct
38 Correct 72 ms 32596 KB Output is correct
39 Correct 70 ms 32592 KB Output is correct
40 Correct 73 ms 32592 KB Output is correct
41 Correct 90 ms 32564 KB Output is correct
42 Correct 44 ms 31748 KB Output is correct
43 Correct 41 ms 31568 KB Output is correct
44 Correct 46 ms 31680 KB Output is correct
45 Correct 114 ms 34004 KB Output is correct
46 Correct 112 ms 33996 KB Output is correct
47 Correct 420 ms 199888 KB Output is correct
48 Runtime error 267 ms 262144 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -