oj.uz

Submission #754690

# Submission time Handle Problem Language Result Execution time Memory
754690 2023-06-08T11:04:22 Z Desh03 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 486 ms 21548 KB 
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;
vector<vector<pair<int, int>>> g;

void djikstra(int src, vector<long long> &sp) {
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
    sp[src] = 0;
    pq.push({0, src});
    while (pq.size()) {
        int u = pq.top().second;
        pq.pop();
        for (auto [v, w] : g[u])
            if (sp[v] > sp[u] + w)
                sp[v] = sp[u] + w, pq.push({sp[v], v});
    }
}

int S, T, U, V;
vector<vector<long long>> sp;
vector<long long> dp1, dp2;
long long ans = INF;

long long calc_dp1(int u, long long s) {
    if (s + sp[1][u] > sp[0][T]) return INF;
    if (dp1[u] != -1) return dp1[u];
    long long mn = sp[3][u];
    for (auto [v, w] : g[u]) mn = min(mn, calc_dp1(v, s + w));
    ans = min(ans, sp[2][u] + mn);
    return dp1[u] = mn;
}

long long calc_dp2(int u, long long s) {
    if (s + sp[1][u] > sp[0][T]) return INF;
    if (dp2[u] != -1) return dp2[u];
    long long mn = sp[2][u];
    for (auto [v, w] : g[u]) mn = min(mn, calc_dp2(v, s + w));
    ans = min(ans, sp[3][u] + mn);
    return dp2[u] = mn;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m >> S >> T >> U >> V;
    --S, --T, --U, --V, g.resize(n), sp = vector<vector<long long>> (4, vector<long long> (n, INF)), dp1 = dp2 = vector<long long> (n, -1);
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        --a, --b;
        g[a].push_back({b, c});
        g[b].push_back({a, c});
    }
    djikstra(S, sp[0]), djikstra(T, sp[1]), djikstra(U, sp[2]), djikstra(V, sp[3]);
    calc_dp1(S, 0), calc_dp2(S, 0);
    cout << min(ans, sp[2][V]) << '\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 16776 KB Output is correct
2 Correct 334 ms 15576 KB Output is correct
3 Correct 342 ms 19460 KB Output is correct
4 Correct 288 ms 16676 KB Output is correct
5 Correct 310 ms 15404 KB Output is correct
6 Correct 396 ms 16860 KB Output is correct
7 Correct 355 ms 15540 KB Output is correct
8 Correct 394 ms 15556 KB Output is correct
9 Correct 288 ms 19768 KB Output is correct
10 Correct 212 ms 19748 KB Output is correct
11 Correct 147 ms 15096 KB Output is correct
12 Correct 295 ms 19680 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 15676 KB Output is correct
2 Correct 337 ms 15796 KB Output is correct
3 Correct 354 ms 15608 KB Output is correct
4 Correct 332 ms 15744 KB Output is correct
5 Correct 358 ms 16096 KB Output is correct
6 Correct 285 ms 17496 KB Output is correct
7 Correct 341 ms 17916 KB Output is correct
8 Correct 288 ms 15732 KB Output is correct
9 Correct 337 ms 16008 KB Output is correct
10 Correct 340 ms 15544 KB Output is correct
11 Correct 114 ms 16424 KB Output is correct
12 Correct 332 ms 21548 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 960 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 12 ms 1620 KB Output is correct
5 Correct 7 ms 980 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 16776 KB Output is correct
2 Correct 334 ms 15576 KB Output is correct
3 Correct 342 ms 19460 KB Output is correct
4 Correct 288 ms 16676 KB Output is correct
5 Correct 310 ms 15404 KB Output is correct
6 Correct 396 ms 16860 KB Output is correct
7 Correct 355 ms 15540 KB Output is correct
8 Correct 394 ms 15556 KB Output is correct
9 Correct 288 ms 19768 KB Output is correct
10 Correct 212 ms 19748 KB Output is correct
11 Correct 147 ms 15096 KB Output is correct
12 Correct 295 ms 19680 KB Output is correct
13 Correct 275 ms 15676 KB Output is correct
14 Correct 337 ms 15796 KB Output is correct
15 Correct 354 ms 15608 KB Output is correct
16 Correct 332 ms 15744 KB Output is correct
17 Correct 358 ms 16096 KB Output is correct
18 Correct 285 ms 17496 KB Output is correct
19 Correct 341 ms 17916 KB Output is correct
20 Correct 288 ms 15732 KB Output is correct
21 Correct 337 ms 16008 KB Output is correct
22 Correct 340 ms 15544 KB Output is correct
23 Correct 114 ms 16424 KB Output is correct
24 Correct 332 ms 21548 KB Output is correct
25 Correct 7 ms 960 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 12 ms 1620 KB Output is correct
29 Correct 7 ms 980 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 8 ms 980 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 320 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 342 ms 21040 KB Output is correct
41 Correct 451 ms 19744 KB Output is correct
42 Correct 486 ms 19780 KB Output is correct
43 Correct 203 ms 15672 KB Output is correct
44 Correct 193 ms 15628 KB Output is correct
45 Correct 304 ms 18592 KB Output is correct
46 Correct 301 ms 18328 KB Output is correct
47 Correct 321 ms 20504 KB Output is correct
48 Correct 146 ms 13220 KB Output is correct
49 Correct 264 ms 20652 KB Output is correct
50 Correct 306 ms 18688 KB Output is correct
51 Correct 323 ms 18564 KB Output is correct