oj.uz

Submission #705341

# Submission time Handle Problem Language Result Execution time Memory
705341 2023-03-04T04:34:01 Z GrandTiger1729 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 299 ms 27936 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

const long long INF = 1e18;
int main(){
    cin.tie(0)->sync_with_stdio(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, long long>>> g(n);
    for (int i = 0; i < m; i++){
        int u, v, w; cin >> u >> v >> w;
        u--, v--;
        g[u].emplace_back(v, w);
        g[v].emplace_back(u, w);
    }
    auto dijkstra = [&](int s){
        priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
        pq.emplace(0, s);
        vector<long long> dis(n, INF);
        dis[s] = 0;
        vector<bool> vis(n);
        while (pq.size()){
            auto [d, u] = pq.top();
            pq.pop();
            if (vis[u]) continue;
            vis[u] = 1;
            for (auto &[v, w]: g[u]){
                if (dis[v] > dis[u] + w){
                    dis[v] = dis[u] + w;
                    pq.emplace(dis[v], v);
                }
            }
        }
        return dis;
    };
    auto disU = dijkstra(U), disV = dijkstra(V);
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
    pq.emplace(0, S);
    vector<long long> dis(n, INF);
    dis[S] = 0;
    vector<bool> vis(n);
    vector<vector<int>> stk(n);
    vector<long long> ans(n, INF), minU(n, INF), minV(n, INF);
    while (pq.size()){
        auto [d, u] = pq.top();
        pq.pop();
        if (vis[u]) continue;
        vis[u] = 1;
        minU[u] = disU[u], minV[u] = disV[u];
        for (auto &v: stk[u]){
            ans[u] = min(ans[u], ans[v]);
            minU[u] = min(minU[u], minU[v]);
            minV[u] = min(minV[u], minV[v]);
        }
        ans[u] = min({ans[u], minU[u] + disV[u], minV[u] + disU[u]});
        for (auto &[v, w]: g[u]){
            if (dis[v] > dis[u] + w){
                stk[v].clear();
                stk[v].push_back(u);
                dis[v] = dis[u] + w;
                pq.emplace(dis[v], v);
            }else if (dis[v] == dis[u] + w){
                stk[v].push_back(u);
            }
        }
    }
    cout << min(ans[T], disU[V]) << '\n';
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 27936 KB Output is correct
2 Correct 259 ms 26888 KB Output is correct
3 Correct 257 ms 26828 KB Output is correct
4 Correct 250 ms 27256 KB Output is correct
5 Correct 254 ms 26624 KB Output is correct
6 Correct 299 ms 27844 KB Output is correct
7 Correct 240 ms 26856 KB Output is correct
8 Correct 297 ms 26964 KB Output is correct
9 Correct 258 ms 27640 KB Output is correct
10 Correct 227 ms 27576 KB Output is correct
11 Correct 121 ms 19704 KB Output is correct
12 Correct 263 ms 27548 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 279 ms 27200 KB Output is correct
2 Correct 286 ms 26920 KB Output is correct
3 Correct 261 ms 26768 KB Output is correct
4 Correct 288 ms 26828 KB Output is correct
5 Correct 253 ms 26784 KB Output is correct
6 Correct 296 ms 26844 KB Output is correct
7 Correct 274 ms 26888 KB Output is correct
8 Correct 261 ms 26936 KB Output is correct
9 Correct 287 ms 26820 KB Output is correct
10 Correct 262 ms 26768 KB Output is correct
11 Correct 107 ms 19780 KB Output is correct
12 Correct 281 ms 26940 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2004 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 15 ms 3732 KB Output is correct
5 Correct 7 ms 1992 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 1 ms 372 KB Output is correct
10 Correct 7 ms 2004 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 27936 KB Output is correct
2 Correct 259 ms 26888 KB Output is correct
3 Correct 257 ms 26828 KB Output is correct
4 Correct 250 ms 27256 KB Output is correct
5 Correct 254 ms 26624 KB Output is correct
6 Correct 299 ms 27844 KB Output is correct
7 Correct 240 ms 26856 KB Output is correct
8 Correct 297 ms 26964 KB Output is correct
9 Correct 258 ms 27640 KB Output is correct
10 Correct 227 ms 27576 KB Output is correct
11 Correct 121 ms 19704 KB Output is correct
12 Correct 263 ms 27548 KB Output is correct
13 Correct 279 ms 27200 KB Output is correct
14 Correct 286 ms 26920 KB Output is correct
15 Correct 261 ms 26768 KB Output is correct
16 Correct 288 ms 26828 KB Output is correct
17 Correct 253 ms 26784 KB Output is correct
18 Correct 296 ms 26844 KB Output is correct
19 Correct 274 ms 26888 KB Output is correct
20 Correct 261 ms 26936 KB Output is correct
21 Correct 287 ms 26820 KB Output is correct
22 Correct 262 ms 26768 KB Output is correct
23 Correct 107 ms 19780 KB Output is correct
24 Correct 281 ms 26940 KB Output is correct
25 Correct 7 ms 2004 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 15 ms 3732 KB Output is correct
29 Correct 7 ms 1992 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 1 ms 372 KB Output is correct
34 Correct 7 ms 2004 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 240 ms 27652 KB Output is correct
41 Correct 239 ms 27492 KB Output is correct
42 Correct 253 ms 27588 KB Output is correct
43 Correct 153 ms 19824 KB Output is correct
44 Correct 124 ms 19816 KB Output is correct
45 Correct 235 ms 26572 KB Output is correct
46 Correct 238 ms 26380 KB Output is correct
47 Correct 253 ms 27044 KB Output is correct
48 Correct 105 ms 19224 KB Output is correct
49 Correct 236 ms 27240 KB Output is correct
50 Correct 261 ms 26472 KB Output is correct
51 Correct 240 ms 26588 KB Output is correct