oj.uz

Submission #935675

# Submission time Handle Problem Language Result Execution time Memory
935675 2024-02-29T11:10:01 Z Pannda Escape Route (JOI21_escape_route) C++17
70 / 100
 9000 ms 234180 KB 
#include "escape_route.h"

#include <bits/stdc++.h>
using namespace std;

vector<long long> calculate_necessary_time(int n, int m, long long S, int q, vector<int> A, vector<int> B, vector<long long> L, vector<long long> C, vector<int> U, vector<int> V, vector<long long> T) {
    const long long INF = 4e18;

    vector<vector<pair<int, int>>> adj(n);
    for (int i = 0; i < m; i++) {
        int u = A[i];
        int v = B[i];
        adj[u].push_back({v, i});
        adj[v].push_back({u, i});
    }

    auto [f, g] = [&]() -> pair<vector<vector<vector<long long>>>, vector<vector<long long>>> {
        vector<vector<vector<long long>>> f(n);
        vector<vector<long long>> g(n);
        for (int source = 0; source < n; source++) {
            long long t = 0;
            while (true) {
                priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<>> pq;
                vector<long long> dist(n, INF);
                vector<int> par(n, -1);
                dist[source] = 0;
                pq.push({dist[source], source});
                while (!pq.empty()) {
                    auto [d, u] = pq.top();
                    pq.pop();
                    if (d != dist[u]) continue;
                    for (auto [v, i] : adj[u]) {
                        if (t + dist[u] > C[i] - L[i]) continue;
                        if (dist[u] + L[i] < dist[v]) {
                            dist[v] = dist[u] + L[i];
                            par[v] = i;
                            pq.push({dist[v], v});
                        }
                    }
                }
                f[source].push_back(dist);
                g[source].push_back(t);
                long long new_t = INF;
                for (int u = 0; u < n; u++) {
                    if (par[u] == -1) continue;
                    new_t = min(new_t, C[par[u]] - dist[u] + 1);
                }
                if (new_t >= S || new_t == t) break;
                t = new_t;
            }
        }
        return make_pair(f, g);
    }();

    vector<vector<long long>> dist = [&]() -> vector<vector<long long>> {
        vector<vector<long long>> dist(n, vector<long long>(n, INF));
        for (int u = 0; u < n; u++) {
            for (int v = 0; v < n; v++) {
                if (f[u][0][v] != INF) {
                    dist[u][v] = S;
                }
            }
        }
        for (int u = 0; u < n; u++) {
            dist[u][u] = 0;
        }
        for (int w = 0; w < n; w++) {
            for (int u = 0; u < n; u++) {
                for (int v = 0; v < n; v++) {
                    dist[u][v] = min(dist[u][v], dist[u][w] + dist[w][v]);
                }
            }
        }
        vector<vector<long long>> true_dist = dist;
        for (int u = 0; u < n; u++) {
            for (int v = 0; v < n; v++) {
                for (int w = 0; w < n; w++) {
                    if (f[w][0][v] != INF) {
                        true_dist[u][v] = min(true_dist[u][v], dist[u][w] + f[w][0][v]);
                    }
                }
            }
        }
        return true_dist;
    }();

    return [&]() -> vector<long long> {
        vector<vector<vector<long long>>> memorize(n);
        for (int u = 0; u < n; u++) {
            memorize[u].resize(f[u].size(), vector<long long>(n, -1));
        }
        auto get = [&](int u, int v, long long t) -> long long {
            int i = upper_bound(g[u].begin(), g[u].end(), t) - g[u].begin() - 1;
            if (f[u][i][v] != INF) {
                return f[u][i][v];
            }
            if (memorize[u][i][v] == -1) {
                memorize[u][i][v] = INF;
                for (int w = 0; w < n; w++) {
                    if (f[u][i][w] != INF) {
                        memorize[u][i][v] = min(memorize[u][i][v],dist[w][v]);
                    }
                }
            }
            return memorize[u][i][v] + S - t;
        };
        vector<long long> res(q);
        for (int i = 0; i < q; i++) {
            res[i] = get(U[i], V[i], T[i]);
        }
        return res;
    }();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 65112 KB Output is correct
2 Correct 13 ms 65064 KB Output is correct
3 Correct 50 ms 65112 KB Output is correct
4 Correct 9 ms 65112 KB Output is correct
5 Correct 10 ms 65116 KB Output is correct
6 Correct 10 ms 65200 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 620 ms 166496 KB Output is correct
2 Correct 640 ms 192272 KB Output is correct
3 Correct 286 ms 155368 KB Output is correct
4 Correct 745 ms 201556 KB Output is correct
5 Correct 760 ms 201740 KB Output is correct
6 Correct 11 ms 65116 KB Output is correct
7 Correct 309 ms 155004 KB Output is correct
8 Correct 257 ms 194084 KB Output is correct
9 Correct 496 ms 155224 KB Output is correct
10 Correct 753 ms 201916 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 65112 KB Output is correct
2 Correct 13 ms 65064 KB Output is correct
3 Correct 50 ms 65112 KB Output is correct
4 Correct 9 ms 65112 KB Output is correct
5 Correct 10 ms 65116 KB Output is correct
6 Correct 10 ms 65200 KB Output is correct
7 Correct 620 ms 166496 KB Output is correct
8 Correct 640 ms 192272 KB Output is correct
9 Correct 286 ms 155368 KB Output is correct
10 Correct 745 ms 201556 KB Output is correct
11 Correct 760 ms 201740 KB Output is correct
12 Correct 11 ms 65116 KB Output is correct
13 Correct 309 ms 155004 KB Output is correct
14 Correct 257 ms 194084 KB Output is correct
15 Correct 496 ms 155224 KB Output is correct
16 Correct 753 ms 201916 KB Output is correct
17 Correct 656 ms 168212 KB Output is correct
18 Correct 700 ms 169304 KB Output is correct
19 Correct 734 ms 195700 KB Output is correct
20 Correct 345 ms 158104 KB Output is correct
21 Correct 899 ms 204820 KB Output is correct
22 Correct 823 ms 204856 KB Output is correct
23 Correct 328 ms 157588 KB Output is correct
24 Correct 276 ms 195736 KB Output is correct
25 Correct 565 ms 157120 KB Output is correct
26 Correct 841 ms 205516 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 65112 KB Output is correct
2 Correct 13 ms 65064 KB Output is correct
3 Correct 50 ms 65112 KB Output is correct
4 Correct 9 ms 65112 KB Output is correct
5 Correct 10 ms 65116 KB Output is correct
6 Correct 10 ms 65200 KB Output is correct
7 Correct 620 ms 166496 KB Output is correct
8 Correct 640 ms 192272 KB Output is correct
9 Correct 286 ms 155368 KB Output is correct
10 Correct 745 ms 201556 KB Output is correct
11 Correct 760 ms 201740 KB Output is correct
12 Correct 11 ms 65116 KB Output is correct
13 Correct 309 ms 155004 KB Output is correct
14 Correct 257 ms 194084 KB Output is correct
15 Correct 496 ms 155224 KB Output is correct
16 Correct 753 ms 201916 KB Output is correct
17 Correct 656 ms 168212 KB Output is correct
18 Correct 700 ms 169304 KB Output is correct
19 Correct 734 ms 195700 KB Output is correct
20 Correct 345 ms 158104 KB Output is correct
21 Correct 899 ms 204820 KB Output is correct
22 Correct 823 ms 204856 KB Output is correct
23 Correct 328 ms 157588 KB Output is correct
24 Correct 276 ms 195736 KB Output is correct
25 Correct 565 ms 157120 KB Output is correct
26 Correct 841 ms 205516 KB Output is correct
27 Correct 2021 ms 190624 KB Output is correct
28 Correct 2669 ms 199972 KB Output is correct
29 Correct 3246 ms 224196 KB Output is correct
30 Correct 484 ms 156808 KB Output is correct
31 Correct 3406 ms 233780 KB Output is correct
32 Correct 3439 ms 233372 KB Output is correct
33 Correct 273 ms 196760 KB Output is correct
34 Correct 1942 ms 183564 KB Output is correct
35 Correct 3174 ms 230024 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 65112 KB Output is correct
2 Correct 13 ms 65064 KB Output is correct
3 Correct 50 ms 65112 KB Output is correct
4 Correct 9 ms 65112 KB Output is correct
5 Correct 10 ms 65116 KB Output is correct
6 Correct 10 ms 65200 KB Output is correct
7 Correct 620 ms 166496 KB Output is correct
8 Correct 640 ms 192272 KB Output is correct
9 Correct 286 ms 155368 KB Output is correct
10 Correct 745 ms 201556 KB Output is correct
11 Correct 760 ms 201740 KB Output is correct
12 Correct 11 ms 65116 KB Output is correct
13 Correct 309 ms 155004 KB Output is correct
14 Correct 257 ms 194084 KB Output is correct
15 Correct 496 ms 155224 KB Output is correct
16 Correct 753 ms 201916 KB Output is correct
17 Correct 656 ms 168212 KB Output is correct
18 Correct 700 ms 169304 KB Output is correct
19 Correct 734 ms 195700 KB Output is correct
20 Correct 345 ms 158104 KB Output is correct
21 Correct 899 ms 204820 KB Output is correct
22 Correct 823 ms 204856 KB Output is correct
23 Correct 328 ms 157588 KB Output is correct
24 Correct 276 ms 195736 KB Output is correct
25 Correct 565 ms 157120 KB Output is correct
26 Correct 841 ms 205516 KB Output is correct
27 Correct 2021 ms 190624 KB Output is correct
28 Correct 2669 ms 199972 KB Output is correct
29 Correct 3246 ms 224196 KB Output is correct
30 Correct 484 ms 156808 KB Output is correct
31 Correct 3406 ms 233780 KB Output is correct
32 Correct 3439 ms 233372 KB Output is correct
33 Correct 273 ms 196760 KB Output is correct
34 Correct 1942 ms 183564 KB Output is correct
35 Correct 3174 ms 230024 KB Output is correct
36 Execution timed out 9075 ms 234180 KB Time limit exceeded
37 Halted 0 ms 0 KB -