oj.uz

Submission #633549

# Submission time Handle Problem Language Result Execution time Memory
633549 2022-08-22T17:38:07 Z colossal_pepe Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 664 ms 28032 KB 
#include <iostream>
#include <vector>
#include <set>
#include <tuple>
using namespace std;

using ll = long long;

const ll INF = 1e15;

int n, m, s, t, x, y;
vector<vector<pair<int, ll>>> g;

vector<ll> sssp(int start) {
    vector<ll> d(n, INF);
    set<pair<ll, int>> q;
    d[start] = 0;
    q.insert({0, start});
    while (not q.empty()) {
        auto [dist, u] = *q.begin();
        q.erase(q.begin());
        for (auto [v, w] : g[u]) {
            if (d[u] + w < d[v]) {
                q.erase({d[v], v});
                d[v] = d[u] + w;
                q.insert({d[v], v});
            }
        }
    }
    return d;
}

ll solve(vector<ll> ds, vector<ll> dt, vector<ll> to_x, vector<ll> to_y) {
    ll ans = to_x[y];
    vector<tuple<ll, ll, ll>> dp(n);
    for (int u = 0; u < n; u++) {
        auto &[dist, from_x, from_y] = dp[u];
        dist = (u == s ? 0 : INF);
        from_x = to_x[u];
        from_y = to_y[u];
    }
    set<tuple<ll, ll, ll, int>> q;
    q.insert({0, to_x[s], to_y[s], s});
    while (not q.empty()) {
        auto [dist, from_x, from_y, u] = *q.begin();
        q.erase(q.begin());
        if (ds[t] == ds[u] + dt[u]) ans = min(ans, min(from_x + to_y[u], from_y + to_x[u]));
        for (auto [v, w] : g[u]) {
            auto &[dist_v, from_x_v, from_y_v] = dp[v];
            if (dist + w < dist_v) {
                q.erase({dist_v, from_x_v, from_y_v, v});
                dist_v = dist + w;
                from_x_v = min(to_x[v], from_x);
                from_y_v = min(to_y[v], from_y);
                q.insert({dist_v, from_x_v, from_y_v, v});
            } else if (dist + w == dist_v) {
                q.erase({dist_v, from_x_v, from_y_v, v});
                from_x_v = min(from_x_v, from_x);
                from_y_v = min(from_y_v, from_y);
                q.insert({dist_v, from_x_v, from_y_v, v});
            }
        }
    }
    return ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m >> s >> t >> x >> y;
    s--, t--, x--, y--;
    g.resize(n);
    while (m--) {
        int a, b;
        ll w;
        cin >> a >> b >> w;
        a--, b--;
        g[a].push_back({b, w});
        g[b].push_back({a, w});
    }
    cout << solve(sssp(s), sssp(t), sssp(x), sssp(y)) << '\n';
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 604 ms 24972 KB Output is correct
2 Correct 492 ms 23516 KB Output is correct
3 Correct 486 ms 23372 KB Output is correct
4 Correct 664 ms 25052 KB Output is correct
5 Correct 461 ms 23636 KB Output is correct
6 Correct 570 ms 25016 KB Output is correct
7 Correct 551 ms 23540 KB Output is correct
8 Correct 480 ms 23844 KB Output is correct
9 Correct 512 ms 23888 KB Output is correct
10 Correct 404 ms 24096 KB Output is correct
11 Correct 141 ms 15428 KB Output is correct
12 Correct 585 ms 23584 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 535 ms 24320 KB Output is correct
2 Correct 593 ms 23408 KB Output is correct
3 Correct 642 ms 23460 KB Output is correct
4 Correct 579 ms 23464 KB Output is correct
5 Correct 570 ms 23344 KB Output is correct
6 Correct 545 ms 23412 KB Output is correct
7 Correct 520 ms 23464 KB Output is correct
8 Correct 625 ms 23572 KB Output is correct
9 Correct 632 ms 23384 KB Output is correct
10 Correct 635 ms 23432 KB Output is correct
11 Correct 172 ms 15436 KB Output is correct
12 Correct 524 ms 23580 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2060 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 20 ms 3796 KB Output is correct
5 Correct 13 ms 2004 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 12 ms 2040 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 440 KB Output is correct
15 Correct 2 ms 340 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 604 ms 24972 KB Output is correct
2 Correct 492 ms 23516 KB Output is correct
3 Correct 486 ms 23372 KB Output is correct
4 Correct 664 ms 25052 KB Output is correct
5 Correct 461 ms 23636 KB Output is correct
6 Correct 570 ms 25016 KB Output is correct
7 Correct 551 ms 23540 KB Output is correct
8 Correct 480 ms 23844 KB Output is correct
9 Correct 512 ms 23888 KB Output is correct
10 Correct 404 ms 24096 KB Output is correct
11 Correct 141 ms 15428 KB Output is correct
12 Correct 585 ms 23584 KB Output is correct
13 Correct 535 ms 24320 KB Output is correct
14 Correct 593 ms 23408 KB Output is correct
15 Correct 642 ms 23460 KB Output is correct
16 Correct 579 ms 23464 KB Output is correct
17 Correct 570 ms 23344 KB Output is correct
18 Correct 545 ms 23412 KB Output is correct
19 Correct 520 ms 23464 KB Output is correct
20 Correct 625 ms 23572 KB Output is correct
21 Correct 632 ms 23384 KB Output is correct
22 Correct 635 ms 23432 KB Output is correct
23 Correct 172 ms 15436 KB Output is correct
24 Correct 524 ms 23580 KB Output is correct
25 Correct 10 ms 2060 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 20 ms 3796 KB Output is correct
29 Correct 13 ms 2004 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 5 ms 468 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 12 ms 2040 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 2 ms 332 KB Output is correct
38 Correct 2 ms 440 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 660 ms 28032 KB Output is correct
41 Correct 608 ms 24220 KB Output is correct
42 Correct 598 ms 24024 KB Output is correct
43 Correct 153 ms 15436 KB Output is correct
44 Correct 151 ms 15428 KB Output is correct
45 Correct 536 ms 23516 KB Output is correct
46 Correct 459 ms 23352 KB Output is correct
47 Correct 661 ms 24940 KB Output is correct
48 Correct 169 ms 14944 KB Output is correct
49 Correct 533 ms 28004 KB Output is correct
50 Correct 491 ms 23472 KB Output is correct
51 Correct 444 ms 23428 KB Output is correct