oj.uz

Submission #864072

# Submission time Handle Problem Language Result Execution time Memory
864072 2023-10-21T23:14:12 Z phongcd Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 239 ms 23024 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long  double
#define ull unsigned long long
#define ii pair <int, int>
#define ill pair <ll, ll>
#define ild pair <ld, ld>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define file "test"
using namespace std;
const int N = 1e5 + 2;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const ll base = 311;
const int BLOCK_SIZE = 400;
 
int n, m;
ll ans;
ll f[2][N], d[3][N];
vector <ill> adj[N];

void min_road(int s, int k) {
    priority_queue <ill> h;
    vector <bool> p(n + 1, 0);
    for (int i = 1; i <= n; i ++) d[k][i] = INF;
 
    h.push({0, s});
    d[k][s] = 0;
 
    while (!h.empty()) {
        int u = h.top().se; h.pop();
        if (p[u]) continue;
        p[u] = 1;
 
        for (ill e: adj[u]) {
            int v = e.fi; ll w = e.se;
            if (d[k][v] > d[k][u] + w) {
                d[k][v] = d[k][u] + w;
                h.push({-d[k][v], v});
            }
        }
    }
}

void dp(int s, int t) {
    priority_queue <pair <ll, ill>> h;
    vector <bool> vis(n + 1, 0);
    for (int i = 0; i <= n; i ++)
        f[0][i] = f[1][i] = d[2][i] = INF;
 
    h.push({0, {s, 0}});
    d[2][s] = 0;
 
    while (!h.empty()) {
        pair <ll, ill> tmp = h.top(); h.pop();
        ll dist = -tmp.fi;
        int u = tmp.se.fi, p = tmp.se.se;
 
        if (!vis[u]) {
            vis[u] = 1;
            f[0][u] = min(f[0][p], d[0][u]);
            f[1][u] = min(f[1][p], d[1][u]);
            for (ill e: adj[u]) {
                int v = e.fi; ll w = e.se;
                if (d[2][v] >= dist + w) {
                    d[2][v] = dist + w;
                    h.push({-d[2][v], {v, u}});
                }
            }
        }
        else if (dist == d[2][u]) {
            if (min(d[0][u], f[0][p]) + min(d[1][u], f[1][p]) > f[0][u] + f[1][u])
                continue;
            f[0][u] = min(f[0][p], d[0][u]);
            f[1][u] = min(f[1][p], d[1][u]);
        }
    }
 
    ans = min(ans, f[0][t] + f[1][t]);
}

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

    int s, t, u, v;
    cin >> n >> m >> s >> t >> u >> v;
    for (int i = 0; i < m; i ++) {
        ll u, v, w;
        cin >> u >> v >> w;
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }

    min_road(u, 0);
    min_road(v, 1);

    ans = d[0][v];

    dp(s, t);
    dp(t, s);

    cout << ans;
}
/*
     /\_/\ zzZ
    (= -_-)
    / >u  >u
*/

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 23024 KB Output is correct
2 Correct 193 ms 19964 KB Output is correct
3 Correct 184 ms 22464 KB Output is correct
4 Correct 198 ms 22732 KB Output is correct
5 Correct 192 ms 20008 KB Output is correct
6 Correct 193 ms 22220 KB Output is correct
7 Correct 184 ms 19916 KB Output is correct
8 Correct 208 ms 20116 KB Output is correct
9 Correct 176 ms 19788 KB Output is correct
10 Correct 161 ms 20060 KB Output is correct
11 Correct 55 ms 11884 KB Output is correct
12 Correct 205 ms 19872 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 20140 KB Output is correct
2 Correct 198 ms 19856 KB Output is correct
3 Correct 220 ms 20284 KB Output is correct
4 Correct 199 ms 20112 KB Output is correct
5 Correct 200 ms 19732 KB Output is correct
6 Correct 206 ms 20168 KB Output is correct
7 Correct 199 ms 19852 KB Output is correct
8 Correct 239 ms 19848 KB Output is correct
9 Correct 214 ms 20152 KB Output is correct
10 Correct 218 ms 19780 KB Output is correct
11 Correct 53 ms 11860 KB Output is correct
12 Correct 196 ms 20420 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6296 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 18 ms 8004 KB Output is correct
5 Correct 6 ms 5976 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 2 ms 4696 KB Output is correct
8 Correct 2 ms 4956 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 7 ms 6432 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 1 ms 4700 KB Output is correct
13 Correct 1 ms 4700 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 23024 KB Output is correct
2 Correct 193 ms 19964 KB Output is correct
3 Correct 184 ms 22464 KB Output is correct
4 Correct 198 ms 22732 KB Output is correct
5 Correct 192 ms 20008 KB Output is correct
6 Correct 193 ms 22220 KB Output is correct
7 Correct 184 ms 19916 KB Output is correct
8 Correct 208 ms 20116 KB Output is correct
9 Correct 176 ms 19788 KB Output is correct
10 Correct 161 ms 20060 KB Output is correct
11 Correct 55 ms 11884 KB Output is correct
12 Correct 205 ms 19872 KB Output is correct
13 Correct 200 ms 20140 KB Output is correct
14 Correct 198 ms 19856 KB Output is correct
15 Correct 220 ms 20284 KB Output is correct
16 Correct 199 ms 20112 KB Output is correct
17 Correct 200 ms 19732 KB Output is correct
18 Correct 206 ms 20168 KB Output is correct
19 Correct 199 ms 19852 KB Output is correct
20 Correct 239 ms 19848 KB Output is correct
21 Correct 214 ms 20152 KB Output is correct
22 Correct 218 ms 19780 KB Output is correct
23 Correct 53 ms 11860 KB Output is correct
24 Correct 196 ms 20420 KB Output is correct
25 Correct 9 ms 6296 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 18 ms 8004 KB Output is correct
29 Correct 6 ms 5976 KB Output is correct
30 Correct 1 ms 4700 KB Output is correct
31 Correct 2 ms 4696 KB Output is correct
32 Correct 2 ms 4956 KB Output is correct
33 Correct 1 ms 4700 KB Output is correct
34 Correct 7 ms 6432 KB Output is correct
35 Correct 1 ms 4700 KB Output is correct
36 Correct 1 ms 4700 KB Output is correct
37 Correct 1 ms 4700 KB Output is correct
38 Correct 1 ms 4700 KB Output is correct
39 Correct 1 ms 4700 KB Output is correct
40 Correct 210 ms 22088 KB Output is correct
41 Correct 180 ms 19924 KB Output is correct
42 Correct 194 ms 20052 KB Output is correct
43 Correct 55 ms 11916 KB Output is correct
44 Correct 51 ms 11860 KB Output is correct
45 Correct 199 ms 19716 KB Output is correct
46 Correct 200 ms 20096 KB Output is correct
47 Correct 203 ms 23016 KB Output is correct
48 Correct 56 ms 11856 KB Output is correct
49 Correct 200 ms 22136 KB Output is correct
50 Correct 193 ms 19760 KB Output is correct
51 Correct 182 ms 19748 KB Output is correct