oj.uz

답안 #761547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761547 2023-06-20T00:54:12 Z MinaRagy06 Sky Walking (IOI19_walk) C++17
10 / 100
 125 ms 90344 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SZ(x) (int)x.size()

struct bheap {
    vector<int> heap, mp;
    vector<ll> val;
    bheap() {}
    bheap(int n) {
        val.assign(n, 1e9);
        mp.assign(n, -1);
    }
    void sink(int pos) {
        while ((pos << 1) + 1 < SZ(heap)) {
            int l = (pos << 1) + 1, r = (pos << 1) + 2;
            int smallest = l;
            if (r < SZ(heap) && val[heap[r]] < val[heap[l]]) smallest = r;
            if (val[heap[smallest]] < val[heap[pos]]){
                mp[heap[smallest]] = pos;
                mp[heap[pos]] = smallest;
                swap(heap[pos], heap[smallest]);
            } else {
                break;
            }
            pos = smallest;
        }
    }
    bool swim(int pos) {
        int p = (pos - 1) >> 1;
        if (!(pos && val[heap[p]] > val[heap[pos]])) return 0;
        while (pos && val[heap[p]] > val[heap[pos]]) {
            mp[heap[p]] = pos;
            mp[heap[pos]] = p;
            swap(heap[p], heap[pos]);
            pos = p;
            p = (pos - 1) >> 1;
        }
        return 1;
    }
    void push(int key, ll value) {
        int pos = SZ(heap);
        heap.push_back(key);
        mp[key] = pos;
        val[key] = value;
        swim(pos);
    }
    int pop() {
        int n = SZ(heap), ret = heap[0];
        mp[heap[0]] = n - 1;
        mp[heap[n - 1]] = 0;
        swap(heap[0], heap[n-1]);
        heap.pop_back();
        sink(0);
        return ret;
    }
    void update(int key, ll value) {
        int pos = mp[key];
        val[key] = value;
        if (!swim(pos)) {
            sink(pos);
        }
    }
    int top() {
        return heap[0];
    }
    bool empty() {
        return heap.empty();
    }
};
vector<int> intersect[100'005];
vector<int> adj[100'005];
vector<ll> dist[100'005];
vector<int> idx[100'005], mp[100'005];
pair<int, int> rev[2'000'005];
int sparse[17][200'005];
const ll INF = 1e18;
ll min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int s, int g) {
    l.push_back(0);
    r.push_back(0);
    y.push_back(0);
    vector<array<int, 3>> v(SZ(y));
    idx[s].push_back(0);
    dist[s].push_back(INF);
    for (int i = 0; i < SZ(y); i++) {
        v[i] = {l[i], r[i], y[i]};
    }
    sort(v.begin(), v.end(), [&](array<int, 3> _a, array<int, 3> _b) {return _a[2] < _b[2];});
    for (int i = 0; i < SZ(y); i++) {
        l[i] = v[i][0];
        r[i] = v[i][1];
        y[i] = v[i][2];
    }
    int n = SZ(x), m = SZ(l) - 1;
    for (int i = 0; i < n; i++) {
        sparse[0][i] = h[i];
    }
    for (int j = 1; j < 17; j++) {
        for (int i = 0; i < n; i++) {
            sparse[j][i] = max(sparse[j - 1][i], sparse[j - 1][i + (1 << (j - 1))]);
        }
    }
    for (int i = 1; i <= m; i++) {
        int j = l[i];
        while (j <= r[i]) {
            if (y[i] <= h[j]) {
                intersect[i].push_back(j);
                j++;
                continue;
            }
            int mx = 0;
            for (int k = 16; k >= 0; k--) {
                if (y[i] > max(mx, sparse[k][j])) {
                    mx = max(mx, sparse[k][j]);
                    j += (1 << k);
                }
            }
            if (j <= r[i]) {
                intersect[i].push_back(j);
                j++;
            }
        }
        for (int k = 0; k < SZ(intersect[i]); k++) {
            dist[intersect[i][k]].push_back(INF);
            idx[intersect[i][k]].push_back(i);
        }
    }
    int cur = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < SZ(idx[i]); j++) {
            rev[cur] = {i, j};
            mp[i].push_back(cur++); 
        }
    }
    for (int i = 1; i <= m; i++) {
        for (int k = 0; k < SZ(intersect[i]); k++) {
            int ypos = lower_bound(idx[intersect[i][k]].begin(), idx[intersect[i][k]].end(), i) - idx[intersect[i][k]].begin();
            if (k + 1 < SZ(intersect[i])) {
                int y2pos = lower_bound(idx[intersect[i][k + 1]].begin(), idx[intersect[i][k + 1]].end(), i) - idx[intersect[i][k + 1]].begin();
                adj[mp[intersect[i][k]][ypos]].push_back(mp[intersect[i][k + 1]][y2pos]);
            }
            if (k - 1 >= 0) {
                int y2pos = lower_bound(idx[intersect[i][k - 1]].begin(), idx[intersect[i][k - 1]].end(), i) - idx[intersect[i][k - 1]].begin();
                adj[mp[intersect[i][k]][ypos]].push_back(mp[intersect[i][k - 1]][y2pos]);
            }
        }
    }
    bheap pq(cur);
    pq.push(mp[s][0], 0);
    dist[s][0] = 0;
    while (!pq.empty()) {
        int node = pq.pop();
        int i = rev[node].first;
        int j = rev[node].second;
        ll d = dist[i][j];
        j = y[idx[i][j]];
        if (node - 1 >= 0 && rev[node - 1].first == i) {
            auto [nxt, nxth] = rev[node - 1];
            ll newd = d + abs(j - y[idx[nxt][nxth]]);
            if (dist[nxt][nxth] == INF) {
                dist[nxt][nxth] = newd;
                pq.push(mp[nxt][nxth], newd);
            } else if (newd < dist[nxt][nxth]) {
                dist[nxt][nxth] = newd;
                pq.update(mp[nxt][nxth], newd);
            }
        }
        if (node + 1 < cur && rev[node + 1].first == i) {
            auto [nxt, nxth] = rev[node + 1];
            ll newd = d + abs(j - y[idx[nxt][nxth]]);
            if (dist[nxt][nxth] == INF) {
                dist[nxt][nxth] = newd;
                pq.push(mp[nxt][nxth], newd);
            } else if (newd < dist[nxt][nxth]) {
                dist[nxt][nxth] = newd;
                pq.update(mp[nxt][nxth], newd);
            }
        }
        for (auto nxtnode : adj[node]) {
            auto [nxt, nxth] = rev[nxtnode];
            assert(j == y[idx[nxt][nxth]]);
            // cout << nxtnode << ' ';
            ll newd = d + abs(x[nxt] - x[i]) + abs(j - y[idx[nxt][nxth]]);
            if (dist[nxt][nxth] == INF) {
                dist[nxt][nxth] = newd;
                pq.push(mp[nxt][nxth], newd);
            } else if (newd < dist[nxt][nxth]) {
                dist[nxt][nxth] = newd;
                pq.update(mp[nxt][nxth], newd);
            }
        }
    }
    ll ans = INF;
    for (int i = 0; i < SZ(dist[g]); i++) {
        ans = min(ans, dist[g][i] + y[idx[g][i]]);
    }
    if (ans >= INF) return -1;
    return ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12116 KB Output is correct
2 Correct 6 ms 12116 KB Output is correct
3 Correct 5 ms 12116 KB Output is correct
4 Correct 6 ms 12116 KB Output is correct
5 Correct 5 ms 12116 KB Output is correct
6 Correct 5 ms 12116 KB Output is correct
7 Correct 6 ms 12116 KB Output is correct
8 Correct 5 ms 12116 KB Output is correct
9 Correct 7 ms 12116 KB Output is correct
10 Correct 6 ms 12116 KB Output is correct
11 Correct 6 ms 12116 KB Output is correct
12 Correct 6 ms 12116 KB Output is correct
13 Correct 6 ms 12116 KB Output is correct
14 Correct 5 ms 12060 KB Output is correct
15 Correct 7 ms 12116 KB Output is correct
16 Correct 5 ms 12116 KB Output is correct
17 Correct 6 ms 12116 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12036 KB Output is correct
2 Correct 6 ms 12116 KB Output is correct
3 Runtime error 125 ms 90344 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 67 ms 49360 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 67 ms 49360 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12116 KB Output is correct
2 Correct 6 ms 12116 KB Output is correct
3 Correct 5 ms 12116 KB Output is correct
4 Correct 6 ms 12116 KB Output is correct
5 Correct 5 ms 12116 KB Output is correct
6 Correct 5 ms 12116 KB Output is correct
7 Correct 6 ms 12116 KB Output is correct
8 Correct 5 ms 12116 KB Output is correct
9 Correct 7 ms 12116 KB Output is correct
10 Correct 6 ms 12116 KB Output is correct
11 Correct 6 ms 12116 KB Output is correct
12 Correct 6 ms 12116 KB Output is correct
13 Correct 6 ms 12116 KB Output is correct
14 Correct 5 ms 12060 KB Output is correct
15 Correct 7 ms 12116 KB Output is correct
16 Correct 5 ms 12116 KB Output is correct
17 Correct 6 ms 12116 KB Output is correct
18 Correct 6 ms 12036 KB Output is correct
19 Correct 6 ms 12116 KB Output is correct
20 Runtime error 125 ms 90344 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -