oj.uz

Submission #530658

# Submission time Handle Problem Language Result Execution time Memory
530658 2022-02-26T09:36:52 Z SlavicG Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 438 ms 23872 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

#define int long long

const int N = 2e5 + 10;
vector<pair<int, int>> adj[N];

ll ans = LLONG_MAX;
int n, m, s, t, a, b;
vector<int> order;
vector<ll> dijkstra(int a) {
    order.clear();
    priority_queue<pair<int,int>> q;
    vector<int> dist(n, (ll)1e18);
    vector<bool> vis(n, false);
    dist[a] = 0;
    q.push({0, a});
    while(!q.empty()) {
        int u = q.top().second;
        q.pop();
        if(vis[u]) continue;
        vis[u] = true;
        order.pb(u);
        for(auto x: adj[u]) {
            int w = x.second, v = x.first;
            if(dist[v] >= dist[u] + w) {
                dist[v] = dist[u] + w;
                q.push({-dist[v], v});
            }
        }
    }
    return dist;
}

vector<ll> distA, distB, distS, distT;

void solve() {
    cin >> n >> m >> s >> t >> a >> b;  --s, --t, --a, --b;

    for(int i = 0;i < m; ++i) {
        int u, v, c;
        cin >> u >> v >> c; --u, --v;
        adj[u].pb({v, c});
        adj[v].pb({u, c});
    }

    distA = dijkstra(a), distB = dijkstra(b);
    distS = dijkstra(s), distT = dijkstra(t);
    ans = distA[b];
    dijkstra(s);


    vector<int> dp(n, (ll)1e18);
    for(int node: order) {
        dp[node] = distA[node];
        for(auto f : adj[node]) {
            int v = f.first, w = f.second; 

            if(distS[v] + w == distS[node] && distS[v] + w + distT[node] == distS[t]) {
                dp[node] = min(dp[node], dp[v]);
            }
            ans = min(ans, dp[node] + distB[node]);
        }
    }

    dp.assign(n, (ll)1e18);

    for(int node: order) {
        dp[node] = distB[node];
        for(auto f: adj[node]) {
            int v = f.first, w = f.second; 
            if(distS[v] + w == distS[node] && distS[v] + w + distT[node] == distS[t]) {
                dp[node] = min(dp[node], dp[v]);
            }
            ans = min(ans, dp[node] + distA[node]);
        }
    }

    cout << ans << "\n";
} 
 
int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 23688 KB Output is correct
2 Correct 358 ms 22360 KB Output is correct
3 Correct 336 ms 22588 KB Output is correct
4 Correct 383 ms 23808 KB Output is correct
5 Correct 405 ms 22184 KB Output is correct
6 Correct 380 ms 23872 KB Output is correct
7 Correct 346 ms 22180 KB Output is correct
8 Correct 438 ms 22272 KB Output is correct
9 Correct 367 ms 22112 KB Output is correct
10 Correct 319 ms 22004 KB Output is correct
11 Correct 149 ms 15292 KB Output is correct
12 Correct 373 ms 22164 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 413 ms 22424 KB Output is correct
2 Correct 380 ms 22296 KB Output is correct
3 Correct 392 ms 22292 KB Output is correct
4 Correct 366 ms 22144 KB Output is correct
5 Correct 405 ms 22088 KB Output is correct
6 Correct 389 ms 21936 KB Output is correct
7 Correct 369 ms 21992 KB Output is correct
8 Correct 428 ms 22080 KB Output is correct
9 Correct 352 ms 22168 KB Output is correct
10 Correct 397 ms 22096 KB Output is correct
11 Correct 156 ms 15224 KB Output is correct
12 Correct 351 ms 21844 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 6732 KB Output is correct
2 Correct 4 ms 5000 KB Output is correct
3 Correct 4 ms 5060 KB Output is correct
4 Correct 35 ms 8448 KB Output is correct
5 Correct 13 ms 6552 KB Output is correct
6 Correct 4 ms 5068 KB Output is correct
7 Correct 4 ms 5148 KB Output is correct
8 Correct 5 ms 5196 KB Output is correct
9 Correct 4 ms 5068 KB Output is correct
10 Correct 12 ms 6948 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 5020 KB Output is correct
14 Correct 4 ms 5068 KB Output is correct
15 Correct 4 ms 5068 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 378 ms 23688 KB Output is correct
2 Correct 358 ms 22360 KB Output is correct
3 Correct 336 ms 22588 KB Output is correct
4 Correct 383 ms 23808 KB Output is correct
5 Correct 405 ms 22184 KB Output is correct
6 Correct 380 ms 23872 KB Output is correct
7 Correct 346 ms 22180 KB Output is correct
8 Correct 438 ms 22272 KB Output is correct
9 Correct 367 ms 22112 KB Output is correct
10 Correct 319 ms 22004 KB Output is correct
11 Correct 149 ms 15292 KB Output is correct
12 Correct 373 ms 22164 KB Output is correct
13 Correct 413 ms 22424 KB Output is correct
14 Correct 380 ms 22296 KB Output is correct
15 Correct 392 ms 22292 KB Output is correct
16 Correct 366 ms 22144 KB Output is correct
17 Correct 405 ms 22088 KB Output is correct
18 Correct 389 ms 21936 KB Output is correct
19 Correct 369 ms 21992 KB Output is correct
20 Correct 428 ms 22080 KB Output is correct
21 Correct 352 ms 22168 KB Output is correct
22 Correct 397 ms 22096 KB Output is correct
23 Correct 156 ms 15224 KB Output is correct
24 Correct 351 ms 21844 KB Output is correct
25 Correct 17 ms 6732 KB Output is correct
26 Correct 4 ms 5000 KB Output is correct
27 Correct 4 ms 5060 KB Output is correct
28 Correct 35 ms 8448 KB Output is correct
29 Correct 13 ms 6552 KB Output is correct
30 Correct 4 ms 5068 KB Output is correct
31 Correct 4 ms 5148 KB Output is correct
32 Correct 5 ms 5196 KB Output is correct
33 Correct 4 ms 5068 KB Output is correct
34 Correct 12 ms 6948 KB Output is correct
35 Correct 3 ms 5020 KB Output is correct
36 Correct 3 ms 4940 KB Output is correct
37 Correct 3 ms 5020 KB Output is correct
38 Correct 4 ms 5068 KB Output is correct
39 Correct 4 ms 5068 KB Output is correct
40 Correct 315 ms 23160 KB Output is correct
41 Correct 370 ms 22284 KB Output is correct
42 Correct 328 ms 22192 KB Output is correct
43 Correct 138 ms 15424 KB Output is correct
44 Correct 153 ms 15444 KB Output is correct
45 Correct 390 ms 22044 KB Output is correct
46 Correct 415 ms 22088 KB Output is correct
47 Correct 400 ms 23724 KB Output is correct
48 Correct 191 ms 15372 KB Output is correct
49 Correct 394 ms 23420 KB Output is correct
50 Correct 387 ms 22204 KB Output is correct
51 Correct 392 ms 22228 KB Output is correct