oj.uz

Submission #1057535

# Submission time Handle Problem Language Result Execution time Memory
1057535 2024-08-13T21:12:44 Z Zicrus Sky Walking (IOI19_walk) C++17
24 / 100
 2998 ms 1048576 KB 
#include <bits/stdc++.h>
#include "walk.h"
using namespace std;

typedef long long ll;

ll n, m;
vector<vector<pair<ll, ll>>> ints; // y, nodeId
vector<pair<ll, pair<ll, ll>>> bridges;
ll cnt;

vector<vector<pair<ll, ll>>> adj;

ll min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g) {
    n = x.size(); m = y.size();
    cnt = 0;
    ints = vector<vector<pair<ll, ll>>>(n);
    ints[s].push_back({0, cnt++});
    ints[g].push_back({0, cnt++});
    bridges = vector<pair<ll, pair<ll, ll>>>(m);
    for (int i = 0; i < m; i++) {
        bridges[i] = {y[i], {l[i], r[i]}};
    }
    sort(bridges.begin(), bridges.end());
    vector<vector<pair<ll, ll>>> it(m); // x, nodeId
    vector<ll> lnk(n);
    for (int i = 0; i < n; i++) lnk[i] = i+1;
    for (int j = 0; j < m; j++) {
        pair<ll, ll> p = bridges[j].second;
        ll lastCorr = -1;
        for (int i = p.first; i <= p.second; i = lnk[i]) {
            if (bridges[j].first > h[i]) continue;
            if (lastCorr != -1) {
                lnk[lastCorr] = i;
            }
            it[j].push_back({x[i], cnt});
            ints[i].push_back({bridges[j].first, cnt++});
            lastCorr = i;
        }
    }

    adj = vector<vector<pair<ll, ll>>>(cnt); // dist, nodeId
    for (auto &e : ints) { // SIGNAL 11
        if (e.size() < 2) continue;
        for (int i = 0; i < e.size()-1; i++) {
            ll dist = e[i+1].first - e[i].first;
            adj[e[i].second].push_back({dist, e[i+1].second});
            adj[e[i+1].second].push_back({dist, e[i].second});
        }
    }
    for (auto &e : it) {
        for (int i = 0; i < e.size()-1; i++) {
            adj[e[i].second].push_back({e[i+1].first - e[i].first, e[i+1].second});
            adj[e[i+1].second].push_back({e[i+1].first - e[i].first, e[i].second});
        }
    }

    priority_queue<pair<ll, ll>> q;
    q.push({0, 0});
    vector<ll> dist(cnt, 1ll << 62ll);
    dist[0] = 0;
    vector<bool> vst(cnt);
    while (!q.empty()) {
        ll cur = q.top().second; q.pop();
        if (vst[cur]) continue;
        vst[cur] = true;
        for (auto &e : adj[cur]) {
            dist[e.second] = min(dist[e.second], dist[cur] + e.first);
            q.push({-dist[e.second], e.second});
        }
    }

    return dist[1] == 1ll << 62ll ? -1 : dist[1];
}

Compilation message

walk.cpp: In function 'll min_distance(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:45:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int i = 0; i < e.size()-1; i++) {
      |                         ~~^~~~~~~~~~~~
walk.cpp:52:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         for (int i = 0; i < e.size()-1; i++) {
      |                         ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 486 ms 122944 KB Output is correct
4 Correct 431 ms 124936 KB Output is correct
5 Correct 211 ms 107092 KB Output is correct
6 Correct 188 ms 94404 KB Output is correct
7 Correct 214 ms 107200 KB Output is correct
8 Correct 620 ms 155476 KB Output is correct
9 Correct 252 ms 108624 KB Output is correct
10 Correct 637 ms 178344 KB Output is correct
11 Correct 211 ms 65880 KB Output is correct
12 Correct 95 ms 38364 KB Output is correct
13 Correct 556 ms 157532 KB Output is correct
14 Correct 66 ms 36944 KB Output is correct
15 Correct 68 ms 39568 KB Output is correct
16 Correct 80 ms 40936 KB Output is correct
17 Correct 79 ms 39784 KB Output is correct
18 Correct 92 ms 44852 KB Output is correct
19 Correct 4 ms 2136 KB Output is correct
20 Correct 32 ms 20040 KB Output is correct
21 Correct 79 ms 42580 KB Output is correct
22 Correct 71 ms 41036 KB Output is correct
23 Correct 120 ms 50376 KB Output is correct
24 Correct 71 ms 42676 KB Output is correct
25 Correct 78 ms 43092 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 22088 KB Output is correct
2 Correct 2998 ms 797940 KB Output is correct
3 Runtime error 783 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 22088 KB Output is correct
2 Correct 2998 ms 797940 KB Output is correct
3 Runtime error 783 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory 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
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 486 ms 122944 KB Output is correct
21 Correct 431 ms 124936 KB Output is correct
22 Correct 211 ms 107092 KB Output is correct
23 Correct 188 ms 94404 KB Output is correct
24 Correct 214 ms 107200 KB Output is correct
25 Correct 620 ms 155476 KB Output is correct
26 Correct 252 ms 108624 KB Output is correct
27 Correct 637 ms 178344 KB Output is correct
28 Correct 211 ms 65880 KB Output is correct
29 Correct 95 ms 38364 KB Output is correct
30 Correct 556 ms 157532 KB Output is correct
31 Correct 66 ms 36944 KB Output is correct
32 Correct 68 ms 39568 KB Output is correct
33 Correct 80 ms 40936 KB Output is correct
34 Correct 79 ms 39784 KB Output is correct
35 Correct 92 ms 44852 KB Output is correct
36 Correct 4 ms 2136 KB Output is correct
37 Correct 32 ms 20040 KB Output is correct
38 Correct 79 ms 42580 KB Output is correct
39 Correct 71 ms 41036 KB Output is correct
40 Correct 120 ms 50376 KB Output is correct
41 Correct 71 ms 42676 KB Output is correct
42 Correct 78 ms 43092 KB Output is correct
43 Correct 40 ms 22088 KB Output is correct
44 Correct 2998 ms 797940 KB Output is correct
45 Runtime error 783 ms 1048576 KB Execution killed with signal 9
46 Halted 0 ms 0 KB -