oj.uz

Submission #761441

# Submission time Handle Problem Language Result Execution time Memory
761441 2023-06-19T16:06:57 Z MinaRagy06 Sky Walking (IOI19_walk) C++17
10 / 100
 4000 ms 502296 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

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 < heap.size()) {
            int l = (pos << 1) + 1, r = (pos << 1) + 2;
            int smallest = l;
            if (r < heap.size() && 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 = heap.size();
        heap.push_back(key);
        mp[key] = pos;
        val[key] = value;
        swim(pos);
    }
    int pop() {
        int n = heap.size(), 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<pair<int, 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) {
    int n = x.size(), m = l.size();
    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))]);
        }
    }
    y.push_back(0);
    idx[s].push_back(m);
    dist[s].push_back(INF);
    for (int i = 0; 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 < intersect[i].size(); k++) {
            dist[intersect[i][k]].push_back(INF);
            idx[intersect[i][k]].push_back(i);
        }
        for (int k = 0; k < intersect[i].size(); k++) {
            if (k + 1 < intersect[i].size()) {
                adj[intersect[i][k]].push_back({intersect[i][k + 1], idx[intersect[i][k + 1]].size() - 1});
            }
            if (k - 1 >= 0) {
                adj[intersect[i][k]].push_back({intersect[i][k - 1], idx[intersect[i][k - 1]].size() - 1});
            }
        }
    }
    int cur = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < idx[i].size(); j++) {
            rev[cur] = {i, j};
            mp[i].push_back(cur++);
        }
    }
    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]];
        for (auto [nxt, nxth] : adj[i]) {
            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 < dist[g].size(); i++) {
        ans = min(ans, dist[g][i] + y[idx[g][i]]);
    }
    // for (auto i : dist[g]) {
    //     ans = min(ans, i.first + i.second);
    // }
    if (ans >= INF) return -1;
    return ans;
}

Compilation message

walk.cpp: In member function 'void bheap::sink(int)':
walk.cpp:14:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |         while ((pos << 1) + 1 < heap.size()) {
      |                ~~~~~~~~~~~~~~~^~~~~~~~~~~~~
walk.cpp:17:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |             if (r < heap.size() && val[heap[r]] < val[heap[l]]) smallest = r;
      |                 ~~^~~~~~~~~~~~~
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:110:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |         for (int k = 0; k < intersect[i].size(); k++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
walk.cpp:114:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |         for (int k = 0; k < intersect[i].size(); k++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
walk.cpp:115:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |             if (k + 1 < intersect[i].size()) {
      |                 ~~~~~~^~~~~~~~~~~~~~~~~~~~~
walk.cpp:125:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  125 |         for (int j = 0; j < idx[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~
walk.cpp:151:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  151 |     for (int i = 0; i < dist[g].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12116 KB Output is correct
2 Correct 6 ms 12116 KB Output is correct
3 Correct 6 ms 12116 KB Output is correct
4 Correct 6 ms 12116 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 6 ms 12116 KB Output is correct
7 Correct 6 ms 12116 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 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 5 ms 12116 KB Output is correct
13 Correct 6 ms 12116 KB Output is correct
14 Correct 6 ms 12116 KB Output is correct
15 Correct 6 ms 12140 KB Output is correct
16 Correct 7 ms 12080 KB Output is correct
17 Correct 6 ms 12116 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12116 KB Output is correct
2 Correct 6 ms 12116 KB Output is correct
3 Correct 1010 ms 66648 KB Output is correct
4 Correct 449 ms 74732 KB Output is correct
5 Correct 213 ms 68424 KB Output is correct
6 Correct 201 ms 63412 KB Output is correct
7 Correct 221 ms 68412 KB Output is correct
8 Correct 1873 ms 79332 KB Output is correct
9 Correct 280 ms 66540 KB Output is correct
10 Correct 700 ms 98224 KB Output is correct
11 Correct 205 ms 43616 KB Output is correct
12 Correct 126 ms 42260 KB Output is correct
13 Correct 604 ms 93188 KB Output is correct
14 Correct 145 ms 41712 KB Output is correct
15 Correct 163 ms 42148 KB Output is correct
16 Correct 658 ms 41724 KB Output is correct
17 Correct 206 ms 40808 KB Output is correct
18 Execution timed out 4064 ms 36196 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 22364 KB Output is correct
2 Runtime error 618 ms 502296 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 22364 KB Output is correct
2 Runtime error 618 ms 502296 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12116 KB Output is correct
2 Correct 6 ms 12116 KB Output is correct
3 Correct 6 ms 12116 KB Output is correct
4 Correct 6 ms 12116 KB Output is correct
5 Correct 7 ms 12116 KB Output is correct
6 Correct 6 ms 12116 KB Output is correct
7 Correct 6 ms 12116 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 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 5 ms 12116 KB Output is correct
13 Correct 6 ms 12116 KB Output is correct
14 Correct 6 ms 12116 KB Output is correct
15 Correct 6 ms 12140 KB Output is correct
16 Correct 7 ms 12080 KB Output is correct
17 Correct 6 ms 12116 KB Output is correct
18 Correct 6 ms 12116 KB Output is correct
19 Correct 6 ms 12116 KB Output is correct
20 Correct 1010 ms 66648 KB Output is correct
21 Correct 449 ms 74732 KB Output is correct
22 Correct 213 ms 68424 KB Output is correct
23 Correct 201 ms 63412 KB Output is correct
24 Correct 221 ms 68412 KB Output is correct
25 Correct 1873 ms 79332 KB Output is correct
26 Correct 280 ms 66540 KB Output is correct
27 Correct 700 ms 98224 KB Output is correct
28 Correct 205 ms 43616 KB Output is correct
29 Correct 126 ms 42260 KB Output is correct
30 Correct 604 ms 93188 KB Output is correct
31 Correct 145 ms 41712 KB Output is correct
32 Correct 163 ms 42148 KB Output is correct
33 Correct 658 ms 41724 KB Output is correct
34 Correct 206 ms 40808 KB Output is correct
35 Execution timed out 4064 ms 36196 KB Time limit exceeded
36 Halted 0 ms 0 KB -