oj.uz

Submission #897285

# Submission time Handle Problem Language Result Execution time Memory
897285 2024-01-02T21:02:07 Z vgtcross Sky Walking (IOI19_walk) C++17
57 / 100
 1460 ms 1048576 KB 
#include <bits/stdc++.h>

#define MODE 0

#define fi first
#define se second

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

ll min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g) {
    int n = x.size();
    int m = y.size();
    if (s == 0 && g == n-1) {
        map<int, ll> dis;
        map<int, int> f;
        dis[0] = 0;
        f[0] = 1;
        vector<array<int, 3>> v = {{0, 1, 0}, {n-1, 0, 0}};
        for (int i = 0; i < m; ++i) {
            v.push_back({l[i], 0, y[i]});
            v.push_back({r[i], 1, y[i]});
        }
        sort(v.begin(), v.end());
        for (auto &a : v) {
            if (a[1] == 0) {
                ++f[a[2]];
                if (!dis.count(a[2])) dis[a[2]] = 1e18;
                auto it = dis.find(a[2]);
                if (++it != dis.end()) dis[a[2]] = min(dis[a[2]], it->se + it->fi - a[2]);
                it = dis.find(a[2]);
                if (it-- != dis.begin()) dis[a[2]] = min(dis[a[2]], it->se + a[2] - it->fi);
            } else if (--f[a[2]] == 0) {
                f.erase(a[2]);
                dis.erase(a[2]);
            }
        }
        return dis[0] >= 1e17 ? -1 : x[n-1] - x[0] + dis[0];
    } else {
        vector<array<int, 3>> items;
        for (int i = 0; i < n; ++i) items.push_back({h[i], 1, i});
        for (int i = 0; i < m; ++i) items.push_back({y[i], 0, i});
        sort(items.rbegin(), items.rend());
        set<int> bds;
        int w = 0;
        vector<vector<pll>> adj;
        vector<pll> crd;
        vector<int> bi(n, -1), ri(m, -1);
        auto add_edge = [&](int p, int q) {
            ll d = abs(crd[p].fi - crd[q].fi) + abs(crd[p].se - crd[q].se);
            adj[p].push_back({d, q});
            adj[q].push_back({d, p});
        };
        for (auto &a : items) {
            if (a[1] == 1) bds.insert(a[2]);
            else {
                for (auto it = bds.find(l[a[2]]); true; ++it) {
                    crd.push_back({x[*it], a[0]});
                    adj.push_back({});
                    if (bi[*it] != -1) add_edge(bi[*it], w);
                    if (ri[a[2]] != -1) add_edge(ri[a[2]], w);
                    bi[*it] = w;
                    ri[a[2]] = w;
                    w++;
                    if (*it == r[a[2]]) break;
                }
            }
        }
        int e = w++;
        int f = w++;
        crd.push_back({x[s], 0});
        crd.push_back({x[g], 0});
        adj.push_back({});
        adj.push_back({});
        if (bi[s] != -1) add_edge(e, bi[s]);
        if (bi[g] != -1) add_edge(f, bi[g]);
        priority_queue<pll> pq;
        pq.push({0, e});
        vector<bool> vis(w, 0);
        while (pq.size()) {
            auto p = pq.top();
            pq.pop();
            if (vis[p.se]) continue;
            vis[p.se] = 1;
            
            if (p.se == f) return -p.fi;
            
            for (auto v : adj[p.se]) if (!vis[v.se]) {
                pq.push({p.fi - v.fi, v.se});
            }
        }
        return -1;
    }
}

#if MODE
int main() {
    int n, m;
    cin >> n >> m;
    vector<int> x(n), h(n);
    vector<int> l(m), r(m), y(m);
    for (int i = 0; i < n; ++i) cin >> x[i] >> h[i];
    for (int i = 0; i < m; ++i) cin >> l[i] >> r[i] >> y[i];
    int s, g;
    cin >> s >> g;
    cout << min_distance(x, h, l, r, y, s, g) << '\n';
}
#endif

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 432 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 1 ms 348 KB Output is correct
8 Correct 0 ms 440 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 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 0 ms 348 KB Output is correct
3 Correct 225 ms 91548 KB Output is correct
4 Correct 535 ms 98704 KB Output is correct
5 Correct 296 ms 87200 KB Output is correct
6 Correct 266 ms 74224 KB Output is correct
7 Correct 285 ms 88228 KB Output is correct
8 Correct 291 ms 115704 KB Output is correct
9 Correct 361 ms 88808 KB Output is correct
10 Correct 638 ms 133816 KB Output is correct
11 Correct 237 ms 52264 KB Output is correct
12 Correct 74 ms 11440 KB Output is correct
13 Correct 81 ms 11420 KB Output is correct
14 Correct 130 ms 33980 KB Output is correct
15 Correct 175 ms 33924 KB Output is correct
16 Correct 140 ms 35408 KB Output is correct
17 Correct 144 ms 35920 KB Output is correct
18 Correct 146 ms 20160 KB Output is correct
19 Correct 5 ms 1944 KB Output is correct
20 Correct 57 ms 16208 KB Output is correct
21 Correct 72 ms 9976 KB Output is correct
22 Correct 69 ms 11972 KB Output is correct
23 Correct 124 ms 15556 KB Output is correct
24 Correct 72 ms 10956 KB Output is correct
25 Correct 66 ms 10444 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4056 KB Output is correct
2 Correct 150 ms 8240 KB Output is correct
3 Correct 154 ms 8140 KB Output is correct
4 Correct 168 ms 12956 KB Output is correct
5 Correct 208 ms 21644 KB Output is correct
6 Correct 194 ms 15516 KB Output is correct
7 Correct 74 ms 7728 KB Output is correct
8 Correct 70 ms 11560 KB Output is correct
9 Correct 181 ms 16224 KB Output is correct
10 Correct 105 ms 15424 KB Output is correct
11 Correct 8 ms 1884 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4056 KB Output is correct
2 Correct 150 ms 8240 KB Output is correct
3 Correct 154 ms 8140 KB Output is correct
4 Correct 168 ms 12956 KB Output is correct
5 Correct 208 ms 21644 KB Output is correct
6 Correct 194 ms 15516 KB Output is correct
7 Correct 74 ms 7728 KB Output is correct
8 Correct 70 ms 11560 KB Output is correct
9 Correct 181 ms 16224 KB Output is correct
10 Correct 105 ms 15424 KB Output is correct
11 Correct 8 ms 1884 KB Output is correct
12 Correct 154 ms 8080 KB Output is correct
13 Correct 170 ms 11464 KB Output is correct
14 Correct 217 ms 21804 KB Output is correct
15 Correct 116 ms 12196 KB Output is correct
16 Correct 124 ms 12596 KB Output is correct
17 Correct 125 ms 12728 KB Output is correct
18 Correct 115 ms 12236 KB Output is correct
19 Correct 119 ms 12624 KB Output is correct
20 Correct 84 ms 7632 KB Output is correct
21 Correct 20 ms 3932 KB Output is correct
22 Correct 113 ms 10768 KB Output is correct
23 Correct 102 ms 10952 KB Output is correct
24 Correct 90 ms 12492 KB Output is correct
25 Correct 95 ms 11396 KB Output is correct
26 Correct 109 ms 15304 KB Output is correct
27 Correct 202 ms 20276 KB Output is correct
28 Correct 129 ms 11464 KB Output is correct
29 Correct 203 ms 15484 KB Output is correct
30 Correct 69 ms 7628 KB Output is correct
31 Correct 181 ms 16068 KB Output is correct
32 Correct 90 ms 12388 KB Output is correct
33 Correct 92 ms 13092 KB Output is correct
34 Correct 95 ms 12476 KB Output is correct
35 Correct 92 ms 10444 KB Output is correct
36 Correct 73 ms 11004 KB Output is correct
37 Correct 66 ms 9932 KB Output is correct
38 Correct 78 ms 12068 KB Output is correct
39 Correct 126 ms 15408 KB Output is correct
40 Correct 70 ms 10872 KB Output is correct
41 Correct 66 ms 9928 KB Output is correct

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 432 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 1 ms 348 KB Output is correct
8 Correct 0 ms 440 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 225 ms 91548 KB Output is correct
21 Correct 535 ms 98704 KB Output is correct
22 Correct 296 ms 87200 KB Output is correct
23 Correct 266 ms 74224 KB Output is correct
24 Correct 285 ms 88228 KB Output is correct
25 Correct 291 ms 115704 KB Output is correct
26 Correct 361 ms 88808 KB Output is correct
27 Correct 638 ms 133816 KB Output is correct
28 Correct 237 ms 52264 KB Output is correct
29 Correct 74 ms 11440 KB Output is correct
30 Correct 81 ms 11420 KB Output is correct
31 Correct 130 ms 33980 KB Output is correct
32 Correct 175 ms 33924 KB Output is correct
33 Correct 140 ms 35408 KB Output is correct
34 Correct 144 ms 35920 KB Output is correct
35 Correct 146 ms 20160 KB Output is correct
36 Correct 5 ms 1944 KB Output is correct
37 Correct 57 ms 16208 KB Output is correct
38 Correct 72 ms 9976 KB Output is correct
39 Correct 69 ms 11972 KB Output is correct
40 Correct 124 ms 15556 KB Output is correct
41 Correct 72 ms 10956 KB Output is correct
42 Correct 66 ms 10444 KB Output is correct
43 Correct 24 ms 4056 KB Output is correct
44 Correct 150 ms 8240 KB Output is correct
45 Correct 154 ms 8140 KB Output is correct
46 Correct 168 ms 12956 KB Output is correct
47 Correct 208 ms 21644 KB Output is correct
48 Correct 194 ms 15516 KB Output is correct
49 Correct 74 ms 7728 KB Output is correct
50 Correct 70 ms 11560 KB Output is correct
51 Correct 181 ms 16224 KB Output is correct
52 Correct 105 ms 15424 KB Output is correct
53 Correct 8 ms 1884 KB Output is correct
54 Correct 154 ms 8080 KB Output is correct
55 Correct 170 ms 11464 KB Output is correct
56 Correct 217 ms 21804 KB Output is correct
57 Correct 116 ms 12196 KB Output is correct
58 Correct 124 ms 12596 KB Output is correct
59 Correct 125 ms 12728 KB Output is correct
60 Correct 115 ms 12236 KB Output is correct
61 Correct 119 ms 12624 KB Output is correct
62 Correct 84 ms 7632 KB Output is correct
63 Correct 20 ms 3932 KB Output is correct
64 Correct 113 ms 10768 KB Output is correct
65 Correct 102 ms 10952 KB Output is correct
66 Correct 90 ms 12492 KB Output is correct
67 Correct 95 ms 11396 KB Output is correct
68 Correct 109 ms 15304 KB Output is correct
69 Correct 202 ms 20276 KB Output is correct
70 Correct 129 ms 11464 KB Output is correct
71 Correct 203 ms 15484 KB Output is correct
72 Correct 69 ms 7628 KB Output is correct
73 Correct 181 ms 16068 KB Output is correct
74 Correct 90 ms 12388 KB Output is correct
75 Correct 92 ms 13092 KB Output is correct
76 Correct 95 ms 12476 KB Output is correct
77 Correct 92 ms 10444 KB Output is correct
78 Correct 73 ms 11004 KB Output is correct
79 Correct 66 ms 9932 KB Output is correct
80 Correct 78 ms 12068 KB Output is correct
81 Correct 126 ms 15408 KB Output is correct
82 Correct 70 ms 10872 KB Output is correct
83 Correct 66 ms 9928 KB Output is correct
84 Correct 48 ms 13680 KB Output is correct
85 Runtime error 1460 ms 1048576 KB Execution killed with signal 9
86 Halted 0 ms 0 KB -