oj.uz

Submission #714549

# Submission time Handle Problem Language Result Execution time Memory
714549 2023-03-25T02:00:59 Z tcmmichaelb139 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 624 ms 31172 KB 
#include "bits/stdc++.h"
using namespace std;

struct node {
    int v;
    long long time;
    int prev;

    bool operator<(const node &rhs) const {
        return time > rhs.time;
    }
};

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int N, M, S, T, U, V;
    cin >> N >> M >> S >> T >> U >> V;
    vector<pair<int, long long>> adj[N + 1];
    for (int i = 0; i < M; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        adj[a].push_back({b, c});
        adj[b].push_back({a, c});
    }

    auto distcalc = [&](int s) {
        priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> q;
        vector<long long> dist(N + 1, 1e18);
        vector<bool> vis(N + 1);

        q.push({0, s});
        while (!q.empty()) {
            pair<long long, int> v = q.top();
            q.pop();

            if (vis[v.second]) continue;
            vis[v.second] = true;

            dist[v.second] = v.first;

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

        return dist;
    };

    vector<long long> fu = distcalc(U), fv = distcalc(V);

    auto anscalc = [&](int s, int e) {
        priority_queue<node> q;
        vector<bool> vis(N + 1);
        vector<long long> mtu(N + 1, 1e18), mtv(N + 1, 1e18), sol(N + 1, 1e18);

        q.push({s, 0, s});

        while (!q.empty()) {
            node v = q.top();
            q.pop();

            if (vis[v.v]) {
                if (sol[v.v] == v.time)
                    if (min(mtu[v.prev], fu[v.v]) + min(mtv[v.prev], fv[v.v]) < mtu[v.v] + mtv[v.v]) {
                        mtu[v.v] = min(fu[v.v], mtu[v.prev]);
                        mtv[v.v] = min(fv[v.v], mtv[v.prev]);
                    }
                continue;
            }
            vis[v.v] = true;
            sol[v.v] = v.time;

            mtu[v.v] = min(fu[v.v], mtu[v.prev]);
            mtv[v.v] = min(fv[v.v], mtv[v.prev]);

            for (auto u : adj[v.v]) {
                q.push({u.first, v.time + u.second, v.v});
            }
        }

        return mtu[e] + mtv[e];
    };

    cout << min(min(anscalc(S, T), anscalc(T, S)), fu[V]) << '\n';
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 564 ms 27408 KB Output is correct
2 Correct 497 ms 26556 KB Output is correct
3 Correct 517 ms 26264 KB Output is correct
4 Correct 554 ms 26292 KB Output is correct
5 Correct 544 ms 22984 KB Output is correct
6 Correct 609 ms 26948 KB Output is correct
7 Correct 445 ms 26432 KB Output is correct
8 Correct 489 ms 28340 KB Output is correct
9 Correct 581 ms 28920 KB Output is correct
10 Correct 448 ms 29180 KB Output is correct
11 Correct 142 ms 13384 KB Output is correct
12 Correct 549 ms 29044 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 513 ms 26924 KB Output is correct
2 Correct 456 ms 22992 KB Output is correct
3 Correct 510 ms 26516 KB Output is correct
4 Correct 458 ms 23116 KB Output is correct
5 Correct 435 ms 22764 KB Output is correct
6 Correct 452 ms 26076 KB Output is correct
7 Correct 476 ms 22984 KB Output is correct
8 Correct 445 ms 23088 KB Output is correct
9 Correct 473 ms 22792 KB Output is correct
10 Correct 498 ms 26180 KB Output is correct
11 Correct 128 ms 11840 KB Output is correct
12 Correct 536 ms 26320 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 3248 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 66 ms 6488 KB Output is correct
5 Correct 34 ms 4380 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 4 ms 720 KB Output is correct
9 Correct 2 ms 456 KB Output is correct
10 Correct 32 ms 4496 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 456 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 564 ms 27408 KB Output is correct
2 Correct 497 ms 26556 KB Output is correct
3 Correct 517 ms 26264 KB Output is correct
4 Correct 554 ms 26292 KB Output is correct
5 Correct 544 ms 22984 KB Output is correct
6 Correct 609 ms 26948 KB Output is correct
7 Correct 445 ms 26432 KB Output is correct
8 Correct 489 ms 28340 KB Output is correct
9 Correct 581 ms 28920 KB Output is correct
10 Correct 448 ms 29180 KB Output is correct
11 Correct 142 ms 13384 KB Output is correct
12 Correct 549 ms 29044 KB Output is correct
13 Correct 513 ms 26924 KB Output is correct
14 Correct 456 ms 22992 KB Output is correct
15 Correct 510 ms 26516 KB Output is correct
16 Correct 458 ms 23116 KB Output is correct
17 Correct 435 ms 22764 KB Output is correct
18 Correct 452 ms 26076 KB Output is correct
19 Correct 476 ms 22984 KB Output is correct
20 Correct 445 ms 23088 KB Output is correct
21 Correct 473 ms 22792 KB Output is correct
22 Correct 498 ms 26180 KB Output is correct
23 Correct 128 ms 11840 KB Output is correct
24 Correct 536 ms 26320 KB Output is correct
25 Correct 33 ms 3248 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 66 ms 6488 KB Output is correct
29 Correct 34 ms 4380 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 4 ms 596 KB Output is correct
32 Correct 4 ms 720 KB Output is correct
33 Correct 2 ms 456 KB Output is correct
34 Correct 32 ms 4496 KB Output is correct
35 Correct 1 ms 320 KB Output is correct
36 Correct 1 ms 324 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 2 ms 468 KB Output is correct
39 Correct 2 ms 456 KB Output is correct
40 Correct 611 ms 30832 KB Output is correct
41 Correct 568 ms 31116 KB Output is correct
42 Correct 523 ms 31172 KB Output is correct
43 Correct 167 ms 14076 KB Output is correct
44 Correct 129 ms 13892 KB Output is correct
45 Correct 512 ms 25040 KB Output is correct
46 Correct 470 ms 24760 KB Output is correct
47 Correct 624 ms 26620 KB Output is correct
48 Correct 141 ms 13388 KB Output is correct
49 Correct 567 ms 29368 KB Output is correct
50 Correct 529 ms 25120 KB Output is correct
51 Correct 491 ms 25088 KB Output is correct