oj.uz

답안 #723457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
723457 2023-04-13T20:35:04 Z piOOE Escape Route (JOI21_escape_route) C++17
70 / 100
 9000 ms 140116 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)), dto(n, vector<ll>(n));

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

    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;
            for (int mid = 0; mid < n; ++mid) {
                ll dist = S - 1 - dto[mid][i] < T[j] ? inf : S - 1 - T[j] + 1 + from[mid][V[j]];
                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][V[j]]);
            }

            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:119: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]
  119 |             if (k < dp.size()) {
      |                 ~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 64980 KB Output is correct
2 Correct 53 ms 65032 KB Output is correct
3 Correct 513 ms 65000 KB Output is correct
4 Correct 26 ms 65012 KB Output is correct
5 Correct 29 ms 65020 KB Output is correct
6 Correct 28 ms 65036 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1165 ms 113984 KB Output is correct
2 Correct 1170 ms 122532 KB Output is correct
3 Correct 1095 ms 124852 KB Output is correct
4 Correct 1215 ms 124124 KB Output is correct
5 Correct 1212 ms 124164 KB Output is correct
6 Correct 27 ms 64980 KB Output is correct
7 Correct 1116 ms 124896 KB Output is correct
8 Correct 523 ms 136556 KB Output is correct
9 Correct 1137 ms 124680 KB Output is correct
10 Correct 1225 ms 123700 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 64980 KB Output is correct
2 Correct 53 ms 65032 KB Output is correct
3 Correct 513 ms 65000 KB Output is correct
4 Correct 26 ms 65012 KB Output is correct
5 Correct 29 ms 65020 KB Output is correct
6 Correct 28 ms 65036 KB Output is correct
7 Correct 1165 ms 113984 KB Output is correct
8 Correct 1170 ms 122532 KB Output is correct
9 Correct 1095 ms 124852 KB Output is correct
10 Correct 1215 ms 124124 KB Output is correct
11 Correct 1212 ms 124164 KB Output is correct
12 Correct 27 ms 64980 KB Output is correct
13 Correct 1116 ms 124896 KB Output is correct
14 Correct 523 ms 136556 KB Output is correct
15 Correct 1137 ms 124680 KB Output is correct
16 Correct 1225 ms 123700 KB Output is correct
17 Correct 1398 ms 124684 KB Output is correct
18 Correct 1357 ms 124728 KB Output is correct
19 Correct 1313 ms 126804 KB Output is correct
20 Correct 1298 ms 125968 KB Output is correct
21 Correct 1512 ms 124768 KB Output is correct
22 Correct 1456 ms 125044 KB Output is correct
23 Correct 1311 ms 124876 KB Output is correct
24 Correct 752 ms 138356 KB Output is correct
25 Correct 1342 ms 123860 KB Output is correct
26 Correct 1417 ms 135464 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 64980 KB Output is correct
2 Correct 53 ms 65032 KB Output is correct
3 Correct 513 ms 65000 KB Output is correct
4 Correct 26 ms 65012 KB Output is correct
5 Correct 29 ms 65020 KB Output is correct
6 Correct 28 ms 65036 KB Output is correct
7 Correct 1165 ms 113984 KB Output is correct
8 Correct 1170 ms 122532 KB Output is correct
9 Correct 1095 ms 124852 KB Output is correct
10 Correct 1215 ms 124124 KB Output is correct
11 Correct 1212 ms 124164 KB Output is correct
12 Correct 27 ms 64980 KB Output is correct
13 Correct 1116 ms 124896 KB Output is correct
14 Correct 523 ms 136556 KB Output is correct
15 Correct 1137 ms 124680 KB Output is correct
16 Correct 1225 ms 123700 KB Output is correct
17 Correct 1398 ms 124684 KB Output is correct
18 Correct 1357 ms 124728 KB Output is correct
19 Correct 1313 ms 126804 KB Output is correct
20 Correct 1298 ms 125968 KB Output is correct
21 Correct 1512 ms 124768 KB Output is correct
22 Correct 1456 ms 125044 KB Output is correct
23 Correct 1311 ms 124876 KB Output is correct
24 Correct 752 ms 138356 KB Output is correct
25 Correct 1342 ms 123860 KB Output is correct
26 Correct 1417 ms 135464 KB Output is correct
27 Correct 5368 ms 118836 KB Output is correct
28 Correct 4621 ms 116652 KB Output is correct
29 Correct 5013 ms 124312 KB Output is correct
30 Correct 4608 ms 117432 KB Output is correct
31 Correct 5081 ms 126876 KB Output is correct
32 Correct 5126 ms 126324 KB Output is correct
33 Correct 877 ms 140116 KB Output is correct
34 Correct 5204 ms 114424 KB Output is correct
35 Correct 5137 ms 127128 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 64980 KB Output is correct
2 Correct 53 ms 65032 KB Output is correct
3 Correct 513 ms 65000 KB Output is correct
4 Correct 26 ms 65012 KB Output is correct
5 Correct 29 ms 65020 KB Output is correct
6 Correct 28 ms 65036 KB Output is correct
7 Correct 1165 ms 113984 KB Output is correct
8 Correct 1170 ms 122532 KB Output is correct
9 Correct 1095 ms 124852 KB Output is correct
10 Correct 1215 ms 124124 KB Output is correct
11 Correct 1212 ms 124164 KB Output is correct
12 Correct 27 ms 64980 KB Output is correct
13 Correct 1116 ms 124896 KB Output is correct
14 Correct 523 ms 136556 KB Output is correct
15 Correct 1137 ms 124680 KB Output is correct
16 Correct 1225 ms 123700 KB Output is correct
17 Correct 1398 ms 124684 KB Output is correct
18 Correct 1357 ms 124728 KB Output is correct
19 Correct 1313 ms 126804 KB Output is correct
20 Correct 1298 ms 125968 KB Output is correct
21 Correct 1512 ms 124768 KB Output is correct
22 Correct 1456 ms 125044 KB Output is correct
23 Correct 1311 ms 124876 KB Output is correct
24 Correct 752 ms 138356 KB Output is correct
25 Correct 1342 ms 123860 KB Output is correct
26 Correct 1417 ms 135464 KB Output is correct
27 Correct 5368 ms 118836 KB Output is correct
28 Correct 4621 ms 116652 KB Output is correct
29 Correct 5013 ms 124312 KB Output is correct
30 Correct 4608 ms 117432 KB Output is correct
31 Correct 5081 ms 126876 KB Output is correct
32 Correct 5126 ms 126324 KB Output is correct
33 Correct 877 ms 140116 KB Output is correct
34 Correct 5204 ms 114424 KB Output is correct
35 Correct 5137 ms 127128 KB Output is correct
36 Execution timed out 9039 ms 114596 KB Time limit exceeded
37 Halted 0 ms 0 KB -