oj.uz

Submission #519504

# Submission time Handle Problem Language Result Execution time Memory
519504 2022-01-26T13:01:23 Z Jarif_Rahman Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 325 ms 39552 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const ll inf = 1e16;

vector<ll> dijsktra(vector<vector<pair<int, ll>>> v, int s){
    int n = v.size();

    vector<ll> dis(n, inf);
    vector<bool> bl(n, 0);
    priority_queue<pair<ll, int>> pq;

    dis[s] = 0;
    pq.push({0, s});

    while(!pq.empty()){
        int nd = pq.top().sc;
        pq.pop();
        if(bl[nd]) continue;
        bl[nd] = 1;

        for(auto [x, w]: v[nd]) if(dis[nd]+w < dis[x]){
            dis[x] = dis[nd]+w;
            pq.push({-dis[x], x});
        }
    }

    return dis;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m; cin >> n >> m;
    int S, T, U, V; cin >> S >> T >> U >> V; S--, T--, U--, V--;

    vector<vector<pair<int, ll>>> v(n);

    for(int i = 0; i < m; i++){
        int a, b; ll w; cin >> a >> b >> w; a--, b--;
        v[a].pb({b, w});
        v[b].pb({a, w});
    }

    vector<ll> ds = dijsktra(v, S), du = dijsktra(v, U), dv = dijsktra(v, V);

    ll ans = du[V];

    vector<pair<ll, ll>> dp1(n, {inf, inf}), dp2(n, {inf, inf});

    function<pair<pair<ll, ll>, pair<ll, ll>>(int)> DP = [&](int nd){
        if(dp1[nd].f != inf){
            return make_pair(dp1[nd], dp2[nd]);
        }
        ans = min(ans, du[nd]+dv[nd]);
        for(auto [x, w]: v[nd]){
            if(ds[x]+w != ds[nd]) continue;
            auto [p1, p2] = DP(x);
            if(p1.f < dp1[nd].f) dp1[nd] = p1;
            if(p2.sc < dp2[nd].sc) dp2[nd] = p2;
        }

        dp1[nd].f = min(dp1[nd].f, du[nd]);
        dp1[nd].sc = min(dp1[nd].sc, dv[nd]);
        dp2[nd].f = min(dp2[nd].f, du[nd]);
        dp2[nd].sc = min(dp2[nd].sc, dv[nd]);

        ans = min(ans, dp1[nd].f+dp1[nd].sc);
        ans = min(ans, dp2[nd].f+dp2[nd].sc);

        return make_pair(dp1[nd], dp2[nd]);
    };

    DP(T);

    cout << ans << "\n";
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 31708 KB Output is correct
2 Correct 281 ms 30368 KB Output is correct
3 Correct 290 ms 39552 KB Output is correct
4 Correct 311 ms 31696 KB Output is correct
5 Correct 281 ms 30280 KB Output is correct
6 Correct 296 ms 31824 KB Output is correct
7 Correct 314 ms 30452 KB Output is correct
8 Correct 298 ms 30392 KB Output is correct
9 Correct 286 ms 30868 KB Output is correct
10 Correct 256 ms 30872 KB Output is correct
11 Correct 157 ms 25056 KB Output is correct
12 Correct 287 ms 30972 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 34240 KB Output is correct
2 Correct 301 ms 34612 KB Output is correct
3 Correct 322 ms 33728 KB Output is correct
4 Correct 308 ms 34328 KB Output is correct
5 Correct 314 ms 35380 KB Output is correct
6 Correct 282 ms 38780 KB Output is correct
7 Correct 300 ms 39520 KB Output is correct
8 Correct 304 ms 34632 KB Output is correct
9 Correct 306 ms 35540 KB Output is correct
10 Correct 308 ms 33972 KB Output is correct
11 Correct 142 ms 28060 KB Output is correct
12 Correct 303 ms 39436 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2608 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 17 ms 5116 KB Output is correct
5 Correct 7 ms 2656 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 7 ms 2636 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 31708 KB Output is correct
2 Correct 281 ms 30368 KB Output is correct
3 Correct 290 ms 39552 KB Output is correct
4 Correct 311 ms 31696 KB Output is correct
5 Correct 281 ms 30280 KB Output is correct
6 Correct 296 ms 31824 KB Output is correct
7 Correct 314 ms 30452 KB Output is correct
8 Correct 298 ms 30392 KB Output is correct
9 Correct 286 ms 30868 KB Output is correct
10 Correct 256 ms 30872 KB Output is correct
11 Correct 157 ms 25056 KB Output is correct
12 Correct 287 ms 30972 KB Output is correct
13 Correct 310 ms 34240 KB Output is correct
14 Correct 301 ms 34612 KB Output is correct
15 Correct 322 ms 33728 KB Output is correct
16 Correct 308 ms 34328 KB Output is correct
17 Correct 314 ms 35380 KB Output is correct
18 Correct 282 ms 38780 KB Output is correct
19 Correct 300 ms 39520 KB Output is correct
20 Correct 304 ms 34632 KB Output is correct
21 Correct 306 ms 35540 KB Output is correct
22 Correct 308 ms 33972 KB Output is correct
23 Correct 142 ms 28060 KB Output is correct
24 Correct 303 ms 39436 KB Output is correct
25 Correct 8 ms 2608 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 17 ms 5116 KB Output is correct
29 Correct 7 ms 2656 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 2 ms 508 KB Output is correct
32 Correct 2 ms 588 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 7 ms 2636 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 316 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 261 ms 32392 KB Output is correct
41 Correct 278 ms 30868 KB Output is correct
42 Correct 325 ms 30804 KB Output is correct
43 Correct 157 ms 26368 KB Output is correct
44 Correct 137 ms 26392 KB Output is correct
45 Correct 285 ms 29288 KB Output is correct
46 Correct 282 ms 29696 KB Output is correct
47 Correct 258 ms 31544 KB Output is correct
48 Correct 174 ms 21360 KB Output is correct
49 Correct 227 ms 32160 KB Output is correct
50 Correct 279 ms 29956 KB Output is correct
51 Correct 294 ms 29948 KB Output is correct