oj.uz

답안 #723446

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
723446 2023-04-13T20:01:33 Z piOOE Escape Route (JOI21_escape_route) C++17
70 / 100
 9000 ms 144704 KB 
#pragma GCC optimize("Ofast")
#include "escape_route.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);
    }

    for (int i = 0; i < n; ++i) {
        vector<ll> till;
        vector<vector<ll>> dp;
        int dead = 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;
                    }
                }

                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;
                    }
                }

                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 = S - 1 - dto[mid][i] < 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:133: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]
  133 |             if (k < dp.size()) {
      |                 ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 65036 KB Output is correct
2 Correct 41 ms 64980 KB Output is correct
3 Correct 441 ms 65080 KB Output is correct
4 Correct 28 ms 64972 KB Output is correct
5 Correct 28 ms 64960 KB Output is correct
6 Correct 27 ms 64988 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1030 ms 113972 KB Output is correct
2 Correct 1033 ms 122740 KB Output is correct
3 Correct 962 ms 116588 KB Output is correct
4 Correct 1106 ms 126824 KB Output is correct
5 Correct 1097 ms 126036 KB Output is correct
6 Correct 25 ms 64980 KB Output is correct
7 Correct 967 ms 116532 KB Output is correct
8 Correct 478 ms 138404 KB Output is correct
9 Correct 1004 ms 117024 KB Output is correct
10 Correct 1104 ms 126436 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 65036 KB Output is correct
2 Correct 41 ms 64980 KB Output is correct
3 Correct 441 ms 65080 KB Output is correct
4 Correct 28 ms 64972 KB Output is correct
5 Correct 28 ms 64960 KB Output is correct
6 Correct 27 ms 64988 KB Output is correct
7 Correct 1030 ms 113972 KB Output is correct
8 Correct 1033 ms 122740 KB Output is correct
9 Correct 962 ms 116588 KB Output is correct
10 Correct 1106 ms 126824 KB Output is correct
11 Correct 1097 ms 126036 KB Output is correct
12 Correct 25 ms 64980 KB Output is correct
13 Correct 967 ms 116532 KB Output is correct
14 Correct 478 ms 138404 KB Output is correct
15 Correct 1004 ms 117024 KB Output is correct
16 Correct 1104 ms 126436 KB Output is correct
17 Correct 1271 ms 116348 KB Output is correct
18 Correct 1250 ms 116380 KB Output is correct
19 Correct 1223 ms 128232 KB Output is correct
20 Correct 1175 ms 117480 KB Output is correct
21 Correct 1328 ms 127712 KB Output is correct
22 Correct 1322 ms 127116 KB Output is correct
23 Correct 1194 ms 116572 KB Output is correct
24 Correct 717 ms 140816 KB Output is correct
25 Correct 1230 ms 116108 KB Output is correct
26 Correct 1357 ms 129964 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 65036 KB Output is correct
2 Correct 41 ms 64980 KB Output is correct
3 Correct 441 ms 65080 KB Output is correct
4 Correct 28 ms 64972 KB Output is correct
5 Correct 28 ms 64960 KB Output is correct
6 Correct 27 ms 64988 KB Output is correct
7 Correct 1030 ms 113972 KB Output is correct
8 Correct 1033 ms 122740 KB Output is correct
9 Correct 962 ms 116588 KB Output is correct
10 Correct 1106 ms 126824 KB Output is correct
11 Correct 1097 ms 126036 KB Output is correct
12 Correct 25 ms 64980 KB Output is correct
13 Correct 967 ms 116532 KB Output is correct
14 Correct 478 ms 138404 KB Output is correct
15 Correct 1004 ms 117024 KB Output is correct
16 Correct 1104 ms 126436 KB Output is correct
17 Correct 1271 ms 116348 KB Output is correct
18 Correct 1250 ms 116380 KB Output is correct
19 Correct 1223 ms 128232 KB Output is correct
20 Correct 1175 ms 117480 KB Output is correct
21 Correct 1328 ms 127712 KB Output is correct
22 Correct 1322 ms 127116 KB Output is correct
23 Correct 1194 ms 116572 KB Output is correct
24 Correct 717 ms 140816 KB Output is correct
25 Correct 1230 ms 116108 KB Output is correct
26 Correct 1357 ms 129964 KB Output is correct
27 Correct 4854 ms 117580 KB Output is correct
28 Correct 4328 ms 117056 KB Output is correct
29 Correct 4688 ms 129660 KB Output is correct
30 Correct 4202 ms 120004 KB Output is correct
31 Correct 4708 ms 131760 KB Output is correct
32 Correct 4734 ms 130452 KB Output is correct
33 Correct 808 ms 144704 KB Output is correct
34 Correct 4697 ms 116108 KB Output is correct
35 Correct 4780 ms 130120 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 65036 KB Output is correct
2 Correct 41 ms 64980 KB Output is correct
3 Correct 441 ms 65080 KB Output is correct
4 Correct 28 ms 64972 KB Output is correct
5 Correct 28 ms 64960 KB Output is correct
6 Correct 27 ms 64988 KB Output is correct
7 Correct 1030 ms 113972 KB Output is correct
8 Correct 1033 ms 122740 KB Output is correct
9 Correct 962 ms 116588 KB Output is correct
10 Correct 1106 ms 126824 KB Output is correct
11 Correct 1097 ms 126036 KB Output is correct
12 Correct 25 ms 64980 KB Output is correct
13 Correct 967 ms 116532 KB Output is correct
14 Correct 478 ms 138404 KB Output is correct
15 Correct 1004 ms 117024 KB Output is correct
16 Correct 1104 ms 126436 KB Output is correct
17 Correct 1271 ms 116348 KB Output is correct
18 Correct 1250 ms 116380 KB Output is correct
19 Correct 1223 ms 128232 KB Output is correct
20 Correct 1175 ms 117480 KB Output is correct
21 Correct 1328 ms 127712 KB Output is correct
22 Correct 1322 ms 127116 KB Output is correct
23 Correct 1194 ms 116572 KB Output is correct
24 Correct 717 ms 140816 KB Output is correct
25 Correct 1230 ms 116108 KB Output is correct
26 Correct 1357 ms 129964 KB Output is correct
27 Correct 4854 ms 117580 KB Output is correct
28 Correct 4328 ms 117056 KB Output is correct
29 Correct 4688 ms 129660 KB Output is correct
30 Correct 4202 ms 120004 KB Output is correct
31 Correct 4708 ms 131760 KB Output is correct
32 Correct 4734 ms 130452 KB Output is correct
33 Correct 808 ms 144704 KB Output is correct
34 Correct 4697 ms 116108 KB Output is correct
35 Correct 4780 ms 130120 KB Output is correct
36 Execution timed out 9016 ms 114872 KB Time limit exceeded
37 Halted 0 ms 0 KB -