oj.uz

Submission #297725

# Submission time Handle Problem Language Result Execution time Memory
297725 2020-09-11T20:46:30 Z Leonardo_Paes Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 454 ms 27468 KB 
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
#define f first
#define s second
typedef long long ll;
typedef pair<ll,ll> pii;
typedef pair<ll,pii> pip;
const ll inf = 1e18;
int n, m, a, b, s, t;
ll d[4][maxn], dp[2][maxn]; // 0 = a, 1 = b, 2 = s, 3 = t
vector<pii> grafo[maxn];
void dijkstra(int id, int root){
    if(id <=1){
        priority_queue<pii, vector<pii>, greater<pii>> fila;
        fila.push({0, root});
        while(!fila.empty()){
            ll u = fila.top().s, dist = fila.top().f;
            fila.pop();
            if(d[id][u] != -1) continue;
            d[id][u] = dist;
            for(auto vv : grafo[u]){
                int v = vv.s, w = vv.f;
                if(d[id][v] == -1) fila.push({dist + w, v});
            }
        }
    }
    else{
        priority_queue<pip, vector<pip>, greater<pip>> fila;
        fila.push({0, {root, d[1][root]}});
        while(!fila.empty()){
            ll u = fila.top().s.f, dist = fila.top().f, tfg = fila.top().s.s;
            fila.pop();
            if(d[id][u] != -1){
                if(d[id][u] == dist) dp[id-2][u] = min(dp[id-2][u], tfg);
                continue;
            }
            d[id][u] = dist;
            dp[id-2][u] = min(dp[id-2][u], tfg);
            for(auto vv : grafo[u]){
                int v = vv.s, w = vv.f;
                if(d[id][v] == -1) fila.push({dist + w, {v, min(dp[id-2][u], d[1][v])}});
            }
        }
    }
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin >> n >> m >> s >> t >> a >> b;
    for(int i=1; i<=m; i++){
        int u, v, w;
        cin >> u >> v >> w;
        grafo[u].push_back({w, v});
        grafo[v].push_back({w, u});
    }
    memset(d, -1, sizeof d);
    for(int i=1; i<=n; i++) dp[0][i] = dp[1][i] = inf;
    dijkstra(0, a), dijkstra(1, b), dijkstra(2, s), dijkstra(3, t);
    ll ans = inf;
    for(int i=1; i<=n; i++){
        ans = min(ans, d[0][i] + d[1][i]);
        if(d[2][i] + d[3][i] == d[2][t]){
            ans = min(ans, d[0][i] + min(dp[0][i], dp[1][i]));
        }
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 438 ms 27412 KB Output is correct
2 Correct 421 ms 26436 KB Output is correct
3 Correct 441 ms 26636 KB Output is correct
4 Correct 441 ms 27232 KB Output is correct
5 Correct 416 ms 25952 KB Output is correct
6 Correct 442 ms 27428 KB Output is correct
7 Correct 408 ms 26356 KB Output is correct
8 Correct 413 ms 26392 KB Output is correct
9 Correct 447 ms 27444 KB Output is correct
10 Correct 417 ms 27468 KB Output is correct
11 Correct 146 ms 14584 KB Output is correct
12 Correct 453 ms 27404 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 447 ms 26812 KB Output is correct
2 Correct 439 ms 26356 KB Output is correct
3 Correct 415 ms 26120 KB Output is correct
4 Correct 410 ms 26164 KB Output is correct
5 Correct 411 ms 26140 KB Output is correct
6 Correct 424 ms 26580 KB Output is correct
7 Correct 405 ms 26300 KB Output is correct
8 Correct 454 ms 26272 KB Output is correct
9 Correct 416 ms 26196 KB Output is correct
10 Correct 419 ms 26096 KB Output is correct
11 Correct 146 ms 14840 KB Output is correct
12 Correct 425 ms 26748 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 8276 KB Output is correct
2 Correct 4 ms 5888 KB Output is correct
3 Correct 5 ms 5888 KB Output is correct
4 Correct 58 ms 10720 KB Output is correct
5 Correct 28 ms 8684 KB Output is correct
6 Correct 5 ms 6016 KB Output is correct
7 Correct 6 ms 6016 KB Output is correct
8 Correct 9 ms 6144 KB Output is correct
9 Correct 5 ms 6016 KB Output is correct
10 Correct 28 ms 8728 KB Output is correct
11 Correct 4 ms 5888 KB Output is correct
12 Correct 4 ms 5888 KB Output is correct
13 Correct 4 ms 5888 KB Output is correct
14 Correct 5 ms 5888 KB Output is correct
15 Correct 5 ms 5888 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 438 ms 27412 KB Output is correct
2 Correct 421 ms 26436 KB Output is correct
3 Correct 441 ms 26636 KB Output is correct
4 Correct 441 ms 27232 KB Output is correct
5 Correct 416 ms 25952 KB Output is correct
6 Correct 442 ms 27428 KB Output is correct
7 Correct 408 ms 26356 KB Output is correct
8 Correct 413 ms 26392 KB Output is correct
9 Correct 447 ms 27444 KB Output is correct
10 Correct 417 ms 27468 KB Output is correct
11 Correct 146 ms 14584 KB Output is correct
12 Correct 453 ms 27404 KB Output is correct
13 Correct 447 ms 26812 KB Output is correct
14 Correct 439 ms 26356 KB Output is correct
15 Correct 415 ms 26120 KB Output is correct
16 Correct 410 ms 26164 KB Output is correct
17 Correct 411 ms 26140 KB Output is correct
18 Correct 424 ms 26580 KB Output is correct
19 Correct 405 ms 26300 KB Output is correct
20 Correct 454 ms 26272 KB Output is correct
21 Correct 416 ms 26196 KB Output is correct
22 Correct 419 ms 26096 KB Output is correct
23 Correct 146 ms 14840 KB Output is correct
24 Correct 425 ms 26748 KB Output is correct
25 Correct 29 ms 8276 KB Output is correct
26 Correct 4 ms 5888 KB Output is correct
27 Correct 5 ms 5888 KB Output is correct
28 Correct 58 ms 10720 KB Output is correct
29 Correct 28 ms 8684 KB Output is correct
30 Correct 5 ms 6016 KB Output is correct
31 Correct 6 ms 6016 KB Output is correct
32 Correct 9 ms 6144 KB Output is correct
33 Correct 5 ms 6016 KB Output is correct
34 Correct 28 ms 8728 KB Output is correct
35 Correct 4 ms 5888 KB Output is correct
36 Correct 4 ms 5888 KB Output is correct
37 Correct 4 ms 5888 KB Output is correct
38 Correct 5 ms 5888 KB Output is correct
39 Correct 5 ms 5888 KB Output is correct
40 Correct 431 ms 27020 KB Output is correct
41 Correct 441 ms 27148 KB Output is correct
42 Correct 448 ms 27268 KB Output is correct
43 Correct 149 ms 14840 KB Output is correct
44 Correct 153 ms 14712 KB Output is correct
45 Correct 411 ms 23908 KB Output is correct
46 Correct 415 ms 23800 KB Output is correct
47 Correct 447 ms 26628 KB Output is correct
48 Correct 148 ms 14200 KB Output is correct
49 Correct 429 ms 26424 KB Output is correct
50 Correct 416 ms 24172 KB Output is correct
51 Correct 419 ms 24068 KB Output is correct