oj.uz

Submission #761438

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

vector<int> intersect[100'005];
vector<pair<int, int>> adj[100'005];
vector<ll> dist[100'005];
vector<int> idx[100'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});
            }
        }
        // assert(intersect[i].size() <= 10);
    }
    priority_queue<pair<ll, pair<int, int>>> pq;
    pq.push({0, {s, 0}});
  	dist[s][0] = 0;
    while (pq.size()) {
        ll d = -pq.top().first;
        int i = pq.top().second.first;
        int j = pq.top().second.second;
        pq.pop();
        if (d > dist[i][j]) continue;
        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 (newd < dist[nxt][nxth]) {
                dist[nxt][nxth] = newd;
                pq.push({-newd, {nxt, nxth}});
            }
        }
    }
    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 function 'll min_distance(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, int, int)':
walk.cpp:44:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         for (int k = 0; k < intersect[i].size(); k++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
walk.cpp:48:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for (int k = 0; k < intersect[i].size(); k++) {
      |                         ~~^~~~~~~~~~~~~~~~~~~~~
walk.cpp:49:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             if (k + 1 < intersect[i].size()) {
      |                 ~~~~~~^~~~~~~~~~~~~~~~~~~~~
walk.cpp:77:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |     for (int i = 0; i < dist[g].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9812 KB Output is correct
6 Correct 5 ms 9808 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 4 ms 9812 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 5 ms 9812 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 5 ms 9756 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9664 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9812 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 5 ms 9704 KB Output is correct
3 Correct 1641 ms 55004 KB Output is correct
4 Correct 441 ms 54148 KB Output is correct
5 Correct 212 ms 50808 KB Output is correct
6 Correct 180 ms 47252 KB Output is correct
7 Correct 192 ms 50808 KB Output is correct
8 Correct 3385 ms 86684 KB Output is correct
9 Correct 266 ms 49056 KB Output is correct
10 Correct 765 ms 71808 KB Output is correct
11 Correct 212 ms 32036 KB Output is correct
12 Correct 124 ms 32752 KB Output is correct
13 Correct 589 ms 68860 KB Output is correct
14 Correct 155 ms 32564 KB Output is correct
15 Correct 171 ms 32900 KB Output is correct
16 Correct 563 ms 32444 KB Output is correct
17 Correct 145 ms 31576 KB Output is correct
18 Execution timed out 4086 ms 31588 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 17024 KB Output is correct
2 Execution timed out 4091 ms 259608 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 17024 KB Output is correct
2 Execution timed out 4091 ms 259608 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 5 ms 9684 KB Output is correct
3 Correct 6 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 6 ms 9812 KB Output is correct
6 Correct 5 ms 9808 KB Output is correct
7 Correct 5 ms 9812 KB Output is correct
8 Correct 4 ms 9812 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 5 ms 9812 KB Output is correct
11 Correct 4 ms 9684 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 5 ms 9756 KB Output is correct
14 Correct 5 ms 9684 KB Output is correct
15 Correct 5 ms 9664 KB Output is correct
16 Correct 5 ms 9684 KB Output is correct
17 Correct 5 ms 9812 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 5 ms 9704 KB Output is correct
20 Correct 1641 ms 55004 KB Output is correct
21 Correct 441 ms 54148 KB Output is correct
22 Correct 212 ms 50808 KB Output is correct
23 Correct 180 ms 47252 KB Output is correct
24 Correct 192 ms 50808 KB Output is correct
25 Correct 3385 ms 86684 KB Output is correct
26 Correct 266 ms 49056 KB Output is correct
27 Correct 765 ms 71808 KB Output is correct
28 Correct 212 ms 32036 KB Output is correct
29 Correct 124 ms 32752 KB Output is correct
30 Correct 589 ms 68860 KB Output is correct
31 Correct 155 ms 32564 KB Output is correct
32 Correct 171 ms 32900 KB Output is correct
33 Correct 563 ms 32444 KB Output is correct
34 Correct 145 ms 31576 KB Output is correct
35 Execution timed out 4086 ms 31588 KB Time limit exceeded
36 Halted 0 ms 0 KB -