oj.uz

Submission #502472

# Submission time Handle Problem Language Result Execution time Memory
502472 2022-01-06T05:23:00 Z zorianka Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 716 ms 36632 KB 
//#pragma GCC optimize("O3")

#include <bits/stdc++.h>

using namespace std;
#define MAXN 100005
#define MAXM 100005
#define mix(a, b) a = min(a,b)
using ll = long long;
const ll mod = 1e9 + 7;

vector<pair<int, ll>> g[MAXN];
vector<pair<int, ll>> gc[MAXN];
vector<ll> ds, dt;
ll st;

void dijkstra(vector<ll> &dist, int s) {
    dist[s] = 0;
    set<pair<ll, int>> q;
    q.insert({0, s});
    while (!q.empty()) {
        int v = q.begin()->second;
        q.erase(q.begin());
        for (auto[u, c] : g[v]) {
            if (dist[v] + c < dist[u]) {
                q.erase({dist[u], u});
                dist[u] = dist[v] + c;
                q.insert({dist[u], u});
            }
        }
    }
}

void spec(vector<ll> &dist, int s) {
    dist[s] = 0;
    set<pair<ll, int>> q;
    q.insert({0, s});
    vector<int> flex(dist.size(), false);
    vector<int> parent(dist.size(), -1);
    parent[s] = s;
    while (!q.empty()) {
        int v = q.begin()->second;
        q.erase(q.begin());
        if (flex[v] == 0 && flex[parent[v]] != 0) flex[v] = 2;
        for (auto[u, c] : g[v]) {
            if (ds[v] < ds[u] && flex[v] != 2)
                if (ds[v] + c + dt[u] == st)
                    c = 0;
            if (dist[v] + c < dist[u]) {
                q.erase({dist[u], u});
                dist[u] = dist[v] + c;
                parent[u] = v;
                if (c == 0) flex[u] = true;
                q.insert({dist[u], u});
            }
        }
    }
}

void solve() {
    int n, m;
    cin >> n >> m;
    int s, t;
    cin >> s >> t;
    int u, v;
    cin >> u >> v;
    for (int i = 0; i < m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        g[a].emplace_back(b, c);
        g[b].emplace_back(a, c);
        gc[a].emplace_back(b, c);
        gc[b].emplace_back(a, c);
    }
    ds.resize(n + 1, 1e18), dt.resize(n + 1, 1e18);
    dijkstra(ds, s);
    dijkstra(dt, t);
    st = ds[t];
    vector<ll> bebra(n + 1, 1e18);
    spec(bebra, u);
    ll ans = bebra[v];
    bebra.assign(n + 1, 1e18);
    spec(bebra, v);
    ans = min(ans, bebra[u]);
    cout << ans;
}

signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
//    cin >> t;
    while (t--)
        solve();
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 716 ms 31404 KB Output is correct
2 Correct 585 ms 30648 KB Output is correct
3 Correct 556 ms 30148 KB Output is correct
4 Correct 677 ms 31512 KB Output is correct
5 Correct 546 ms 30492 KB Output is correct
6 Correct 597 ms 31448 KB Output is correct
7 Correct 531 ms 30276 KB Output is correct
8 Correct 544 ms 30596 KB Output is correct
9 Correct 585 ms 30372 KB Output is correct
10 Correct 500 ms 30648 KB Output is correct
11 Correct 177 ms 18260 KB Output is correct
12 Correct 694 ms 30356 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 653 ms 30520 KB Output is correct
2 Correct 579 ms 30244 KB Output is correct
3 Correct 605 ms 30208 KB Output is correct
4 Correct 620 ms 30804 KB Output is correct
5 Correct 570 ms 30264 KB Output is correct
6 Correct 495 ms 30376 KB Output is correct
7 Correct 580 ms 30232 KB Output is correct
8 Correct 666 ms 30352 KB Output is correct
9 Correct 557 ms 30224 KB Output is correct
10 Correct 566 ms 30268 KB Output is correct
11 Correct 211 ms 18300 KB Output is correct
12 Correct 475 ms 30240 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 7756 KB Output is correct
2 Correct 5 ms 5068 KB Output is correct
3 Correct 3 ms 5068 KB Output is correct
4 Correct 20 ms 10256 KB Output is correct
5 Correct 16 ms 7600 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 4 ms 5196 KB Output is correct
8 Correct 5 ms 5324 KB Output is correct
9 Correct 6 ms 5068 KB Output is correct
10 Correct 10 ms 7628 KB Output is correct
11 Correct 2 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 5068 KB Output is correct
14 Correct 3 ms 5068 KB Output is correct
15 Correct 3 ms 5068 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 716 ms 31404 KB Output is correct
2 Correct 585 ms 30648 KB Output is correct
3 Correct 556 ms 30148 KB Output is correct
4 Correct 677 ms 31512 KB Output is correct
5 Correct 546 ms 30492 KB Output is correct
6 Correct 597 ms 31448 KB Output is correct
7 Correct 531 ms 30276 KB Output is correct
8 Correct 544 ms 30596 KB Output is correct
9 Correct 585 ms 30372 KB Output is correct
10 Correct 500 ms 30648 KB Output is correct
11 Correct 177 ms 18260 KB Output is correct
12 Correct 694 ms 30356 KB Output is correct
13 Correct 653 ms 30520 KB Output is correct
14 Correct 579 ms 30244 KB Output is correct
15 Correct 605 ms 30208 KB Output is correct
16 Correct 620 ms 30804 KB Output is correct
17 Correct 570 ms 30264 KB Output is correct
18 Correct 495 ms 30376 KB Output is correct
19 Correct 580 ms 30232 KB Output is correct
20 Correct 666 ms 30352 KB Output is correct
21 Correct 557 ms 30224 KB Output is correct
22 Correct 566 ms 30268 KB Output is correct
23 Correct 211 ms 18300 KB Output is correct
24 Correct 475 ms 30240 KB Output is correct
25 Correct 14 ms 7756 KB Output is correct
26 Correct 5 ms 5068 KB Output is correct
27 Correct 3 ms 5068 KB Output is correct
28 Correct 20 ms 10256 KB Output is correct
29 Correct 16 ms 7600 KB Output is correct
30 Correct 4 ms 5068 KB Output is correct
31 Correct 4 ms 5196 KB Output is correct
32 Correct 5 ms 5324 KB Output is correct
33 Correct 6 ms 5068 KB Output is correct
34 Correct 10 ms 7628 KB Output is correct
35 Correct 2 ms 4940 KB Output is correct
36 Correct 3 ms 4940 KB Output is correct
37 Correct 3 ms 5068 KB Output is correct
38 Correct 3 ms 5068 KB Output is correct
39 Correct 3 ms 5068 KB Output is correct
40 Correct 660 ms 32748 KB Output is correct
41 Correct 600 ms 30660 KB Output is correct
42 Correct 659 ms 30816 KB Output is correct
43 Correct 210 ms 18248 KB Output is correct
44 Correct 210 ms 18184 KB Output is correct
45 Correct 477 ms 29876 KB Output is correct
46 Correct 483 ms 33360 KB Output is correct
47 Correct 642 ms 35060 KB Output is correct
48 Correct 183 ms 19892 KB Output is correct
49 Correct 554 ms 36632 KB Output is correct
50 Correct 528 ms 33896 KB Output is correct
51 Correct 513 ms 33732 KB Output is correct