oj.uz

Submission #723441

# Submission time Handle Problem Language Result Execution time Memory
723441 2023-04-13T19:57:17 Z piOOE Escape Route (JOI21_escape_route) C++17
35 / 100
 9000 ms 194688 KB 
#include "escape_route.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<ll> calculate_necessary_time(int n, int m, ll S, int q, vector<int> A, vector<int> B, vector<ll> L, vector<ll> C,
                                    vector<int> U, vector<int> V, vector<ll> T) {

    vector<ll> answer(q);

    vector<vector<int>> queries(n);

    for (int i = 0; i < q; ++i) {
        queries[U[i]].push_back(i);
    }

    vector<vector<pair<int, int>>> adj(n);

    for (int i = 0; i < m; ++i) {
        adj[A[i]].emplace_back(B[i], i);
        adj[B[i]].emplace_back(A[i], i);
    }

    constexpr ll inf = 3e18;

    auto dijkstra = [&](int source, ll s, bool rev = false) -> vector<ll> {
        vector<ll> dist(n, rev ? -inf : inf);
        dist[source] = s;

        vector<bool> used(n);

        for (int _ = 0; _ < n; ++_) {
            int v = -1;

            for (int i = 0; i < n; ++i) {
                if (!used[i] && (v == -1 || rev ^ (dist[i] < dist[v]))) {
                    v = i;
                }
            }

            used[v] = true;

            for (auto [to, i] : adj[v]) {
                ll d;

                if (rev) {
                    d = min(dist[v], C[i]) - L[i];
                } else {
                    d = L[i] + (dist[v] % S <= C[i] - L[i] ? dist[v] : (dist[v] / S + 1) * S);
                }

                if (rev ^ (dist[to] > d)) {
                    dist[to] = d;
                }
            }
        }

        for (int i = 0; i < n; ++i) {
            dist[i] = rev ? s - dist[i] : dist[i] - s;
        }

        return dist;
    };

    vector from(n, vector<ll>(n));

    for (int i = 0; i < n; ++i) {
        from[i] = dijkstra(i, 0);
    }

    vector dto(n, vector<ll>(n));

    for (int i = 0; i < n; ++i) {
        dto[i] = dijkstra(i, S - 1, true);
    }

    vector most(n, vector<ll>(n));

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (i == j) {
                most[i][j] = inf;
                continue;
            }

            ll lo = -1, hi = S;

            while (lo + 1 < hi) {
                ll mid = (lo + hi) / 2;

                if (mid + dijkstra(i, mid)[j] < S) {
                    lo = mid;
                } else {
                    hi = mid;
                }
            }

            most[i][j] = lo;
        }
    }

    for (int i = 0; i < n; ++i) {
        vector<ll> till;
        vector<vector<ll>> dp;

        int dead = 0;

        vector<ll> last(n, -inf);
        ll added = 0;

        for (int j = 0; dead < m; ++j) {
            till.push_back(0);
            dp.emplace_back();

            ll s = j > 0 ? till[j - 1] + 1 : 0;
            dead = 0;


            if (s < S) {
                vector<ll> d = dijkstra(i, s);

                for (int to = 0; to < n; ++to) {
                    if (d[to] + s >= S) {
                        d[to] = inf;
                    }

                    assert(d[to] + s == inf || d[to] + s >= last[to] + added);
                }

                last = d;

                dp[j] = d;
                ll nxt = inf;

                for (int k = 0; k < m; ++k) {
                    if (d[A[k]] > d[B[k]]) {
                        swap(A[k], B[k]);
                    }

                    if (C[k] - L[k] >= d[A[k]] + s) {
                        nxt = min(nxt, C[k] - L[k] - d[A[k]] - s);
                    } else {
                        dead += 1;
                    }
                }

                added = nxt;

                till[j] = s + nxt;
            } else {
                dp[j] = vector(n, inf);
                till[j] = inf;
                dead = m;
            }
        }

        for (int j : queries[i]) {
            ll ans = inf;
            int to = V[j];

            for (int mid = 0; mid < n; ++mid) {
                ll dist = most[i][mid] < T[j] ? inf : S - 1 - T[j] + 1 + from[mid][to];
                ans = min(ans, dist);
            }

            int k = lower_bound(till.begin(), till.end(), T[j]) - till.begin();

            if (k < dp.size()) {
                ans = min(ans, dp[k][to]);
            }

            answer[j] = ans;
        }
    }

    return answer;
}

Compilation message

escape_route.cpp: In function 'std::vector<long long int> calculate_necessary_time(int, int, ll, int, std::vector<int>, std::vector<int>, std::vector<long long int>, std::vector<long long int>, std::vector<int>, std::vector<int>, std::vector<long long int>)':
escape_route.cpp:169:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int>, std::allocator<std::vector<long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  169 |             if (k < dp.size()) {
      |                 ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 64980 KB Output is correct
2 Correct 306 ms 64964 KB Output is correct
3 Correct 1382 ms 64972 KB Output is correct
4 Correct 26 ms 64980 KB Output is correct
5 Correct 60 ms 64972 KB Output is correct
6 Correct 300 ms 64968 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1640 ms 112004 KB Output is correct
2 Correct 2009 ms 124044 KB Output is correct
3 Correct 1554 ms 153828 KB Output is correct
4 Correct 2070 ms 182244 KB Output is correct
5 Correct 2054 ms 182232 KB Output is correct
6 Correct 23 ms 64972 KB Output is correct
7 Correct 1556 ms 155072 KB Output is correct
8 Correct 806 ms 194688 KB Output is correct
9 Correct 1708 ms 155192 KB Output is correct
10 Correct 2262 ms 181728 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 64980 KB Output is correct
2 Correct 306 ms 64964 KB Output is correct
3 Correct 1382 ms 64972 KB Output is correct
4 Correct 26 ms 64980 KB Output is correct
5 Correct 60 ms 64972 KB Output is correct
6 Correct 300 ms 64968 KB Output is correct
7 Correct 1640 ms 112004 KB Output is correct
8 Correct 2009 ms 124044 KB Output is correct
9 Correct 1554 ms 153828 KB Output is correct
10 Correct 2070 ms 182244 KB Output is correct
11 Correct 2054 ms 182232 KB Output is correct
12 Correct 23 ms 64972 KB Output is correct
13 Correct 1556 ms 155072 KB Output is correct
14 Correct 806 ms 194688 KB Output is correct
15 Correct 1708 ms 155192 KB Output is correct
16 Correct 2262 ms 181728 KB Output is correct
17 Correct 1976 ms 157128 KB Output is correct
18 Correct 1824 ms 157036 KB Output is correct
19 Correct 2176 ms 178448 KB Output is correct
20 Correct 1778 ms 157688 KB Output is correct
21 Correct 2292 ms 185140 KB Output is correct
22 Correct 2272 ms 183904 KB Output is correct
23 Correct 1815 ms 155184 KB Output is correct
24 Correct 1025 ms 194092 KB Output is correct
25 Correct 1935 ms 155196 KB Output is correct
26 Correct 2309 ms 182548 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 64980 KB Output is correct
2 Correct 306 ms 64964 KB Output is correct
3 Correct 1382 ms 64972 KB Output is correct
4 Correct 26 ms 64980 KB Output is correct
5 Correct 60 ms 64972 KB Output is correct
6 Correct 300 ms 64968 KB Output is correct
7 Correct 1640 ms 112004 KB Output is correct
8 Correct 2009 ms 124044 KB Output is correct
9 Correct 1554 ms 153828 KB Output is correct
10 Correct 2070 ms 182244 KB Output is correct
11 Correct 2054 ms 182232 KB Output is correct
12 Correct 23 ms 64972 KB Output is correct
13 Correct 1556 ms 155072 KB Output is correct
14 Correct 806 ms 194688 KB Output is correct
15 Correct 1708 ms 155192 KB Output is correct
16 Correct 2262 ms 181728 KB Output is correct
17 Correct 1976 ms 157128 KB Output is correct
18 Correct 1824 ms 157036 KB Output is correct
19 Correct 2176 ms 178448 KB Output is correct
20 Correct 1778 ms 157688 KB Output is correct
21 Correct 2292 ms 185140 KB Output is correct
22 Correct 2272 ms 183904 KB Output is correct
23 Correct 1815 ms 155184 KB Output is correct
24 Correct 1025 ms 194092 KB Output is correct
25 Correct 1935 ms 155196 KB Output is correct
26 Correct 2309 ms 182548 KB Output is correct
27 Correct 7901 ms 155468 KB Output is correct
28 Correct 7445 ms 155808 KB Output is correct
29 Execution timed out 9096 ms 163520 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 64980 KB Output is correct
2 Correct 306 ms 64964 KB Output is correct
3 Correct 1382 ms 64972 KB Output is correct
4 Correct 26 ms 64980 KB Output is correct
5 Correct 60 ms 64972 KB Output is correct
6 Correct 300 ms 64968 KB Output is correct
7 Correct 1640 ms 112004 KB Output is correct
8 Correct 2009 ms 124044 KB Output is correct
9 Correct 1554 ms 153828 KB Output is correct
10 Correct 2070 ms 182244 KB Output is correct
11 Correct 2054 ms 182232 KB Output is correct
12 Correct 23 ms 64972 KB Output is correct
13 Correct 1556 ms 155072 KB Output is correct
14 Correct 806 ms 194688 KB Output is correct
15 Correct 1708 ms 155192 KB Output is correct
16 Correct 2262 ms 181728 KB Output is correct
17 Correct 1976 ms 157128 KB Output is correct
18 Correct 1824 ms 157036 KB Output is correct
19 Correct 2176 ms 178448 KB Output is correct
20 Correct 1778 ms 157688 KB Output is correct
21 Correct 2292 ms 185140 KB Output is correct
22 Correct 2272 ms 183904 KB Output is correct
23 Correct 1815 ms 155184 KB Output is correct
24 Correct 1025 ms 194092 KB Output is correct
25 Correct 1935 ms 155196 KB Output is correct
26 Correct 2309 ms 182548 KB Output is correct
27 Correct 7901 ms 155468 KB Output is correct
28 Correct 7445 ms 155808 KB Output is correct
29 Execution timed out 9096 ms 163520 KB Time limit exceeded
30 Halted 0 ms 0 KB -