oj.uz

Submission #424988

# Submission time Handle Problem Language Result Execution time Memory
424988 2021-06-12T12:10:46 Z nkato Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 724 ms 31512 KB 
#include <bits/stdc++.h>

typedef long long ll;

using namespace std;


vector<pair<ll, ll>> graph[100001];

ll du[100001], dv[100001], ds[100001], dp[2][100001], ans;

bool visited[100001];


void dijkstra1(ll start, ll arr[]) {

    fill(visited, visited + 100001, false);


    priority_queue<pair<ll, ll>> pq;

    pq.push({0, start});

    while (!pq.empty()) {

        ll c, node;

        tie(c, node) = pq.top();

        pq.pop();


        if (!visited[node]) {

            arr[node] = -c;

            visited[node] = true;

            for (auto& i : graph[node]) pq.push({c - i.second, i.first});

        }

    }

}


void dijkstra2(ll start, ll end) {

    fill(dp[0], dp[0] + 100001, LLONG_MAX / 2);

    fill(dp[1], dp[1] + 100001, LLONG_MAX / 2);

    fill(visited, visited + 100001, false);


    priority_queue<pair<ll, pair<ll, ll>>> pq;

    pq.push({0, {start, 0}});

    dp[0][0] = dp[1][0] = LLONG_MAX/ 2;

    while (!pq.empty()) {

        ll c, node, par;

        pair<ll, ll> p;

        tie(c, p) = pq.top();

        tie(node, par) = p;

        pq.pop();


        if (!visited[node]) {

            visited[node] = true;

            ds[node] = -c;

            dp[0][node] = min(du[node], dp[0][par]);

            dp[1][node] = min(dv[node], dp[1][par]);

            for (auto i : graph[node]) pq.push({c - i.second, {i.first, node}});

        } else if (-c == ds[node]) {

            if (min(du[node], dp[0][par]) + min(dv[node], dp[1][par]) <= dp[0][node] + dp[1][node]) {

                dp[0][node] = min(du[node], dp[0][par]);

                dp[1][node] = min(dv[node], dp[1][par]);

            }

        }

    }


    ans = min(ans, dp[0][end] + dp[1][end]);

}


int main() {

    iostream::sync_with_stdio(false);

    cin.tie(0);

    ll n, m, s, t, u, v;

    cin >> n >> m >> s >> t >> u >> v;

    for (int i = 0; i < m; i++) {

        ll a, b, c;

        cin >> a >> b >> c;

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

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

    }


    dijkstra1(u, du);

    dijkstra1(v, dv);


    ans = du[v];


    dijkstra2(s, t);

    dijkstra2(t, s);


    cout << ans << '\n';

    return 0;

}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 575 ms 27500 KB Output is correct
2 Correct 552 ms 30292 KB Output is correct
3 Correct 584 ms 29620 KB Output is correct
4 Correct 621 ms 29748 KB Output is correct
5 Correct 568 ms 26484 KB Output is correct
6 Correct 641 ms 30368 KB Output is correct
7 Correct 531 ms 29892 KB Output is correct
8 Correct 584 ms 30208 KB Output is correct
9 Correct 648 ms 31424 KB Output is correct
10 Correct 623 ms 31512 KB Output is correct
11 Correct 157 ms 13900 KB Output is correct
12 Correct 634 ms 31496 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 611 ms 27260 KB Output is correct
2 Correct 639 ms 23376 KB Output is correct
3 Correct 537 ms 26776 KB Output is correct
4 Correct 563 ms 23432 KB Output is correct
5 Correct 724 ms 23256 KB Output is correct
6 Correct 613 ms 26440 KB Output is correct
7 Correct 616 ms 23196 KB Output is correct
8 Correct 564 ms 23336 KB Output is correct
9 Correct 546 ms 23160 KB Output is correct
10 Correct 531 ms 26548 KB Output is correct
11 Correct 195 ms 12164 KB Output is correct
12 Correct 551 ms 26516 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 7456 KB Output is correct
2 Correct 4 ms 4328 KB Output is correct
3 Correct 4 ms 4300 KB Output is correct
4 Correct 89 ms 10616 KB Output is correct
5 Correct 44 ms 8404 KB Output is correct
6 Correct 5 ms 4556 KB Output is correct
7 Correct 7 ms 4660 KB Output is correct
8 Correct 9 ms 4752 KB Output is correct
9 Correct 6 ms 4472 KB Output is correct
10 Correct 44 ms 8372 KB Output is correct
11 Correct 4 ms 4316 KB Output is correct
12 Correct 4 ms 4340 KB Output is correct
13 Correct 4 ms 4360 KB Output is correct
14 Correct 4 ms 4428 KB Output is correct
15 Correct 4 ms 4428 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 575 ms 27500 KB Output is correct
2 Correct 552 ms 30292 KB Output is correct
3 Correct 584 ms 29620 KB Output is correct
4 Correct 621 ms 29748 KB Output is correct
5 Correct 568 ms 26484 KB Output is correct
6 Correct 641 ms 30368 KB Output is correct
7 Correct 531 ms 29892 KB Output is correct
8 Correct 584 ms 30208 KB Output is correct
9 Correct 648 ms 31424 KB Output is correct
10 Correct 623 ms 31512 KB Output is correct
11 Correct 157 ms 13900 KB Output is correct
12 Correct 634 ms 31496 KB Output is correct
13 Correct 611 ms 27260 KB Output is correct
14 Correct 639 ms 23376 KB Output is correct
15 Correct 537 ms 26776 KB Output is correct
16 Correct 563 ms 23432 KB Output is correct
17 Correct 724 ms 23256 KB Output is correct
18 Correct 613 ms 26440 KB Output is correct
19 Correct 616 ms 23196 KB Output is correct
20 Correct 564 ms 23336 KB Output is correct
21 Correct 546 ms 23160 KB Output is correct
22 Correct 531 ms 26548 KB Output is correct
23 Correct 195 ms 12164 KB Output is correct
24 Correct 551 ms 26516 KB Output is correct
25 Correct 51 ms 7456 KB Output is correct
26 Correct 4 ms 4328 KB Output is correct
27 Correct 4 ms 4300 KB Output is correct
28 Correct 89 ms 10616 KB Output is correct
29 Correct 44 ms 8404 KB Output is correct
30 Correct 5 ms 4556 KB Output is correct
31 Correct 7 ms 4660 KB Output is correct
32 Correct 9 ms 4752 KB Output is correct
33 Correct 6 ms 4472 KB Output is correct
34 Correct 44 ms 8372 KB Output is correct
35 Correct 4 ms 4316 KB Output is correct
36 Correct 4 ms 4340 KB Output is correct
37 Correct 4 ms 4360 KB Output is correct
38 Correct 4 ms 4428 KB Output is correct
39 Correct 4 ms 4428 KB Output is correct
40 Correct 636 ms 30912 KB Output is correct
41 Correct 683 ms 31268 KB Output is correct
42 Correct 639 ms 31284 KB Output is correct
43 Correct 213 ms 14032 KB Output is correct
44 Correct 205 ms 14040 KB Output is correct
45 Correct 577 ms 25112 KB Output is correct
46 Correct 603 ms 24860 KB Output is correct
47 Correct 653 ms 26684 KB Output is correct
48 Correct 188 ms 13412 KB Output is correct
49 Correct 586 ms 29372 KB Output is correct
50 Correct 560 ms 25148 KB Output is correct
51 Correct 611 ms 25100 KB Output is correct