oj.uz

Submission #864020

# Submission time Handle Problem Language Result Execution time Memory
864020 2023-10-21T17:09:29 Z phongcd Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 413 ms 33824 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 + 2, 0);
    for (int i = 1; i <= n; i ++) d[k][i] = INF;
 
    h.push({0, s});
    while (!h.empty()) {
        ill tmp = h.top(); h.pop();
        int u = tmp.se; ll dist = -tmp.fi;
 
        if (p[u]) continue;
        p[u] = 1;
        d[k][u] = dist;
        for (ill e: adj[u]) h.push({-(dist + e.se), e.fi});
    }
}

void dp(int s, int t) {
    vector <bool> vis(n + 2, 0);
    for (int i = 0; i <= n; i ++)
        f[0][i] = f[1][i] = INF;

    priority_queue <pair <ll, ill>> h;
    h.push({0, {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;
            d[2][u] = dist;
            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]) h.push({-(dist + e.se), {e.fi, 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 378 ms 27360 KB Output is correct
2 Correct 375 ms 28632 KB Output is correct
3 Correct 328 ms 27264 KB Output is correct
4 Correct 396 ms 28072 KB Output is correct
5 Correct 351 ms 26192 KB Output is correct
6 Correct 372 ms 31108 KB Output is correct
7 Correct 329 ms 31336 KB Output is correct
8 Correct 336 ms 31816 KB Output is correct
9 Correct 395 ms 32372 KB Output is correct
10 Correct 372 ms 32896 KB Output is correct
11 Correct 96 ms 13984 KB Output is correct
12 Correct 382 ms 32880 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 370 ms 28492 KB Output is correct
2 Correct 330 ms 23172 KB Output is correct
3 Correct 330 ms 28424 KB Output is correct
4 Correct 340 ms 23340 KB Output is correct
5 Correct 329 ms 23048 KB Output is correct
6 Correct 350 ms 27716 KB Output is correct
7 Correct 315 ms 22936 KB Output is correct
8 Correct 355 ms 22992 KB Output is correct
9 Correct 337 ms 22868 KB Output is correct
10 Correct 346 ms 26968 KB Output is correct
11 Correct 91 ms 11860 KB Output is correct
12 Correct 347 ms 27192 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 7392 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 60 ms 10948 KB Output is correct
5 Correct 30 ms 8824 KB Output is correct
6 Correct 3 ms 4956 KB Output is correct
7 Correct 3 ms 4956 KB Output is correct
8 Correct 5 ms 5156 KB Output is correct
9 Correct 2 ms 4952 KB Output is correct
10 Correct 29 ms 8844 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 2 ms 4700 KB Output is correct
15 Correct 2 ms 4700 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 27360 KB Output is correct
2 Correct 375 ms 28632 KB Output is correct
3 Correct 328 ms 27264 KB Output is correct
4 Correct 396 ms 28072 KB Output is correct
5 Correct 351 ms 26192 KB Output is correct
6 Correct 372 ms 31108 KB Output is correct
7 Correct 329 ms 31336 KB Output is correct
8 Correct 336 ms 31816 KB Output is correct
9 Correct 395 ms 32372 KB Output is correct
10 Correct 372 ms 32896 KB Output is correct
11 Correct 96 ms 13984 KB Output is correct
12 Correct 382 ms 32880 KB Output is correct
13 Correct 370 ms 28492 KB Output is correct
14 Correct 330 ms 23172 KB Output is correct
15 Correct 330 ms 28424 KB Output is correct
16 Correct 340 ms 23340 KB Output is correct
17 Correct 329 ms 23048 KB Output is correct
18 Correct 350 ms 27716 KB Output is correct
19 Correct 315 ms 22936 KB Output is correct
20 Correct 355 ms 22992 KB Output is correct
21 Correct 337 ms 22868 KB Output is correct
22 Correct 346 ms 26968 KB Output is correct
23 Correct 91 ms 11860 KB Output is correct
24 Correct 347 ms 27192 KB Output is correct
25 Correct 31 ms 7392 KB Output is correct
26 Correct 1 ms 4700 KB Output is correct
27 Correct 1 ms 4700 KB Output is correct
28 Correct 60 ms 10948 KB Output is correct
29 Correct 30 ms 8824 KB Output is correct
30 Correct 3 ms 4956 KB Output is correct
31 Correct 3 ms 4956 KB Output is correct
32 Correct 5 ms 5156 KB Output is correct
33 Correct 2 ms 4952 KB Output is correct
34 Correct 29 ms 8844 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 2 ms 4700 KB Output is correct
39 Correct 2 ms 4700 KB Output is correct
40 Correct 386 ms 31908 KB Output is correct
41 Correct 413 ms 33140 KB Output is correct
42 Correct 372 ms 33824 KB Output is correct
43 Correct 77 ms 14084 KB Output is correct
44 Correct 65 ms 13908 KB Output is correct
45 Correct 359 ms 25524 KB Output is correct
46 Correct 329 ms 25788 KB Output is correct
47 Correct 391 ms 26776 KB Output is correct
48 Correct 79 ms 13336 KB Output is correct
49 Correct 386 ms 31256 KB Output is correct
50 Correct 314 ms 25872 KB Output is correct
51 Correct 333 ms 25108 KB Output is correct