oj.uz

Submission #150928

# Submission time Handle Problem Language Result Execution time Memory
150928 2019-09-01T11:57:13 Z dolphingarlic Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 773 ms 31764 KB 
#include <bits/stdc++.h>
#pragma GCC Optimize("O3")
#define FOR(i, x, y) for (ll i = x; i < y; i++)
#define MOD 1000000007
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) {
    FOR(i, 0, 2) fill(dp[i], dp[i] + 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(i, 0, m) {
        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;
    return 0;
}

Compilation message

commuter_pass.cpp:2:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 718 ms 27404 KB Output is correct
2 Correct 590 ms 26792 KB Output is correct
3 Correct 600 ms 26304 KB Output is correct
4 Correct 676 ms 26392 KB Output is correct
5 Correct 598 ms 23200 KB Output is correct
6 Correct 663 ms 27220 KB Output is correct
7 Correct 632 ms 26712 KB Output is correct
8 Correct 618 ms 27032 KB Output is correct
9 Correct 773 ms 27196 KB Output is correct
10 Correct 695 ms 31764 KB Output is correct
11 Correct 238 ms 14020 KB Output is correct
12 Correct 690 ms 31500 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 634 ms 26968 KB Output is correct
2 Correct 606 ms 23116 KB Output is correct
3 Correct 624 ms 26616 KB Output is correct
4 Correct 593 ms 23256 KB Output is correct
5 Correct 614 ms 22988 KB Output is correct
6 Correct 623 ms 26332 KB Output is correct
7 Correct 648 ms 23208 KB Output is correct
8 Correct 613 ms 23120 KB Output is correct
9 Correct 632 ms 23052 KB Output is correct
10 Correct 605 ms 26396 KB Output is correct
11 Correct 197 ms 11996 KB Output is correct
12 Correct 629 ms 30088 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 7172 KB Output is correct
2 Correct 7 ms 4472 KB Output is correct
3 Correct 7 ms 4472 KB Output is correct
4 Correct 109 ms 9720 KB Output is correct
5 Correct 51 ms 8068 KB Output is correct
6 Correct 8 ms 4600 KB Output is correct
7 Correct 10 ms 4600 KB Output is correct
8 Correct 11 ms 4728 KB Output is correct
9 Correct 8 ms 4472 KB Output is correct
10 Correct 49 ms 7960 KB Output is correct
11 Correct 7 ms 4344 KB Output is correct
12 Correct 6 ms 4344 KB Output is correct
13 Correct 6 ms 4472 KB Output is correct
14 Correct 7 ms 4568 KB Output is correct
15 Correct 8 ms 4472 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 718 ms 27404 KB Output is correct
2 Correct 590 ms 26792 KB Output is correct
3 Correct 600 ms 26304 KB Output is correct
4 Correct 676 ms 26392 KB Output is correct
5 Correct 598 ms 23200 KB Output is correct
6 Correct 663 ms 27220 KB Output is correct
7 Correct 632 ms 26712 KB Output is correct
8 Correct 618 ms 27032 KB Output is correct
9 Correct 773 ms 27196 KB Output is correct
10 Correct 695 ms 31764 KB Output is correct
11 Correct 238 ms 14020 KB Output is correct
12 Correct 690 ms 31500 KB Output is correct
13 Correct 634 ms 26968 KB Output is correct
14 Correct 606 ms 23116 KB Output is correct
15 Correct 624 ms 26616 KB Output is correct
16 Correct 593 ms 23256 KB Output is correct
17 Correct 614 ms 22988 KB Output is correct
18 Correct 623 ms 26332 KB Output is correct
19 Correct 648 ms 23208 KB Output is correct
20 Correct 613 ms 23120 KB Output is correct
21 Correct 632 ms 23052 KB Output is correct
22 Correct 605 ms 26396 KB Output is correct
23 Correct 197 ms 11996 KB Output is correct
24 Correct 629 ms 30088 KB Output is correct
25 Correct 50 ms 7172 KB Output is correct
26 Correct 7 ms 4472 KB Output is correct
27 Correct 7 ms 4472 KB Output is correct
28 Correct 109 ms 9720 KB Output is correct
29 Correct 51 ms 8068 KB Output is correct
30 Correct 8 ms 4600 KB Output is correct
31 Correct 10 ms 4600 KB Output is correct
32 Correct 11 ms 4728 KB Output is correct
33 Correct 8 ms 4472 KB Output is correct
34 Correct 49 ms 7960 KB Output is correct
35 Correct 7 ms 4344 KB Output is correct
36 Correct 6 ms 4344 KB Output is correct
37 Correct 6 ms 4472 KB Output is correct
38 Correct 7 ms 4568 KB Output is correct
39 Correct 8 ms 4472 KB Output is correct
40 Correct 660 ms 31148 KB Output is correct
41 Correct 692 ms 31416 KB Output is correct
42 Correct 733 ms 31544 KB Output is correct
43 Correct 195 ms 14072 KB Output is correct
44 Correct 205 ms 14188 KB Output is correct
45 Correct 603 ms 25276 KB Output is correct
46 Correct 619 ms 24888 KB Output is correct
47 Correct 656 ms 26696 KB Output is correct
48 Correct 195 ms 13612 KB Output is correct
49 Correct 703 ms 29488 KB Output is correct
50 Correct 603 ms 25300 KB Output is correct
51 Correct 613 ms 25164 KB Output is correct