Submission #701643

# Submission time Handle Problem Language Result Execution time Memory
701643 2023-02-21T16:16:29 Z phi Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
549 ms 27820 KB
#include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <tuple>

using namespace std;

vector<long long> min_dist(vector<vector<pair<int, long long>>> &adj, int source, int n) {
    vector<long long> depth(n, -1);

    using T = pair<long long, int>;
    priority_queue<T, vector<T>, greater<T>> q;
    q.push({ 0, source });

    while (!q.empty()) {
        auto [ d, v ] = q.top();
        q.pop();

        if (depth[v] != -1) continue;
        depth[v] = d;

        for (auto [ u, w ] : adj[v]) {
            q.push({ d + w, u });
        }
    }

    return depth;
}

struct Path {
    int current;
    long long cost;
    long long u_dist;
    long long v_dist;

    friend bool operator>(const Path &l, const Path &r) {
        if (l.cost == r.cost) {
            return (l.u_dist + l.v_dist) > (r.u_dist + r.v_dist);
        }
        return l.cost > r.cost;
    }
};

int main() {
    int n, m, s, t, u, v;
    cin >> n >> m >> s >> t >> u >> v;
    s--; t--; u--; v--;

    vector<vector<pair<int, long long>>> adj(n);

    for (int i = 0; i < m; i++) {
        int a, b;
        long long c;
        cin >> a >> b >> c;

        a--; b--;
        adj[a].push_back({ b, c });
        adj[b].push_back({ a, c });
    }

    vector<long long> min_u = min_dist(adj, u, n);
    vector<long long> min_v = min_dist(adj, v, n);

    vector<long long> ans(n, -1);

    priority_queue<Path, vector<Path>, greater<Path>> q;
    q.push({ s, 0, min_u[s], min_v[s] });

    while (!q.empty()) {
        auto [ r, c, u_dist, v_dist ] = q.top();
        q.pop();

        if (ans[r] != -1) continue;
        ans[r] = u_dist + v_dist;

        for (auto [ p, w ] : adj[r]) {
            q.push({ p, c + w, min(u_dist, min_u[p]), min(v_dist, min_v[p]) });
        }
    }

    cout << min(ans[t], min_u[v]);

    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 515 ms 27820 KB Output is correct
2 Correct 455 ms 27708 KB Output is correct
3 Correct 451 ms 21540 KB Output is correct
4 Correct 504 ms 27580 KB Output is correct
5 Correct 437 ms 21516 KB Output is correct
6 Correct 517 ms 27624 KB Output is correct
7 Correct 467 ms 27596 KB Output is correct
8 Correct 451 ms 27604 KB Output is correct
9 Correct 525 ms 27744 KB Output is correct
10 Correct 467 ms 27600 KB Output is correct
11 Correct 157 ms 10324 KB Output is correct
12 Correct 516 ms 27604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 503 ms 27588 KB Output is correct
2 Correct 463 ms 23012 KB Output is correct
3 Correct 480 ms 22956 KB Output is correct
4 Correct 441 ms 21476 KB Output is correct
5 Correct 440 ms 21576 KB Output is correct
6 Correct 475 ms 21568 KB Output is correct
7 Correct 458 ms 23020 KB Output is correct
8 Correct 444 ms 21508 KB Output is correct
9 Correct 450 ms 23088 KB Output is correct
10 Correct 444 ms 21512 KB Output is correct
11 Correct 165 ms 10188 KB Output is correct
12 Correct 442 ms 21424 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 36 ms 3128 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 71 ms 6136 KB Output is correct
5 Correct 36 ms 4756 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 5 ms 724 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 36 ms 3524 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 515 ms 27820 KB Output is correct
2 Correct 455 ms 27708 KB Output is correct
3 Correct 451 ms 21540 KB Output is correct
4 Correct 504 ms 27580 KB Output is correct
5 Correct 437 ms 21516 KB Output is correct
6 Correct 517 ms 27624 KB Output is correct
7 Correct 467 ms 27596 KB Output is correct
8 Correct 451 ms 27604 KB Output is correct
9 Correct 525 ms 27744 KB Output is correct
10 Correct 467 ms 27600 KB Output is correct
11 Correct 157 ms 10324 KB Output is correct
12 Correct 516 ms 27604 KB Output is correct
13 Correct 503 ms 27588 KB Output is correct
14 Correct 463 ms 23012 KB Output is correct
15 Correct 480 ms 22956 KB Output is correct
16 Correct 441 ms 21476 KB Output is correct
17 Correct 440 ms 21576 KB Output is correct
18 Correct 475 ms 21568 KB Output is correct
19 Correct 458 ms 23020 KB Output is correct
20 Correct 444 ms 21508 KB Output is correct
21 Correct 450 ms 23088 KB Output is correct
22 Correct 444 ms 21512 KB Output is correct
23 Correct 165 ms 10188 KB Output is correct
24 Correct 442 ms 21424 KB Output is correct
25 Correct 36 ms 3128 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 71 ms 6136 KB Output is correct
29 Correct 36 ms 4756 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 4 ms 596 KB Output is correct
32 Correct 5 ms 724 KB Output is correct
33 Correct 3 ms 468 KB Output is correct
34 Correct 36 ms 3524 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 2 ms 340 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 549 ms 26864 KB Output is correct
41 Correct 521 ms 27540 KB Output is correct
42 Correct 532 ms 27772 KB Output is correct
43 Correct 158 ms 10192 KB Output is correct
44 Correct 150 ms 10196 KB Output is correct
45 Correct 437 ms 21492 KB Output is correct
46 Correct 469 ms 21592 KB Output is correct
47 Correct 514 ms 21456 KB Output is correct
48 Correct 155 ms 10108 KB Output is correct
49 Correct 476 ms 26720 KB Output is correct
50 Correct 438 ms 21572 KB Output is correct
51 Correct 431 ms 21436 KB Output is correct