oj.uz

Submission #344476

# Submission time Handle Problem Language Result Execution time Memory
344476 2021-01-05T23:20:02 Z eyangch Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 390 ms 21260 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

int N, M, S, T, U, V;
vector<pair<int, int>> graph[100000];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
int dists[100000], distt[100000], distu[100000], distv[100000];
int dp[100000], ans;

void dij(int start, int (&dist)[100000]){
    pq.push({0, start});
    fill(dist, dist+N, 1e17);
    dist[start] = 0;
    while(!pq.empty()){
        int id = pq.top().second, d = pq.top().first;
        pq.pop();
        if(dist[id] != d) continue;
        for(pair<int, int> i : graph[id]){
            if(d + i.second < dist[i.first]){
                dist[i.first] = d + i.second;
                pq.push({dist[i.first], i.first});
            }
        }
    }
}

int dfs(int id, int (&dar)[100000]){
    if(~dp[id]) return dp[id];
    dp[id] = distu[id];
    for(pair<int, int> i : graph[id]){
        if(dar[i.first] == dar[id] - i.second){
            dp[id] = min(dp[id], dfs(i.first, dar));
        }
    }
    ans = min(ans, dp[id] + distv[id]);
    return dp[id];
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> N >> M >> S >> T >> U >> V;
    S--, T--, U--, V--;
    for(int i = 0; i < M; i++){
        int a, b, c; cin >> a >> b >> c;
        graph[a-1].push_back({b-1, c});
        graph[b-1].push_back({a-1, c});
    }
    dij(S, dists), dij(T, distt), dij(U, distu), dij(V, distv);
    ans = distu[V];
    fill(dp, dp+N, -1);
    dfs(T, dists);
    fill(dp, dp+N, -1);
    dfs(S, distt);
    cout << ans << endl;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 18268 KB Output is correct
2 Correct 353 ms 18144 KB Output is correct
3 Correct 359 ms 21260 KB Output is correct
4 Correct 320 ms 18404 KB Output is correct
5 Correct 333 ms 18016 KB Output is correct
6 Correct 361 ms 18276 KB Output is correct
7 Correct 350 ms 18148 KB Output is correct
8 Correct 366 ms 18272 KB Output is correct
9 Correct 329 ms 17956 KB Output is correct
10 Correct 275 ms 17760 KB Output is correct
11 Correct 158 ms 13804 KB Output is correct
12 Correct 360 ms 18016 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 373 ms 19552 KB Output is correct
2 Correct 359 ms 19556 KB Output is correct
3 Correct 380 ms 19428 KB Output is correct
4 Correct 385 ms 19432 KB Output is correct
5 Correct 373 ms 19832 KB Output is correct
6 Correct 356 ms 20832 KB Output is correct
7 Correct 379 ms 21088 KB Output is correct
8 Correct 365 ms 19556 KB Output is correct
9 Correct 381 ms 19808 KB Output is correct
10 Correct 359 ms 19296 KB Output is correct
11 Correct 151 ms 14828 KB Output is correct
12 Correct 390 ms 21088 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4076 KB Output is correct
2 Correct 2 ms 2796 KB Output is correct
3 Correct 2 ms 2796 KB Output is correct
4 Correct 18 ms 5484 KB Output is correct
5 Correct 10 ms 4076 KB Output is correct
6 Correct 3 ms 2796 KB Output is correct
7 Correct 3 ms 2924 KB Output is correct
8 Correct 4 ms 2924 KB Output is correct
9 Correct 3 ms 2796 KB Output is correct
10 Correct 10 ms 4076 KB Output is correct
11 Correct 2 ms 2796 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 2 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 326 ms 18268 KB Output is correct
2 Correct 353 ms 18144 KB Output is correct
3 Correct 359 ms 21260 KB Output is correct
4 Correct 320 ms 18404 KB Output is correct
5 Correct 333 ms 18016 KB Output is correct
6 Correct 361 ms 18276 KB Output is correct
7 Correct 350 ms 18148 KB Output is correct
8 Correct 366 ms 18272 KB Output is correct
9 Correct 329 ms 17956 KB Output is correct
10 Correct 275 ms 17760 KB Output is correct
11 Correct 158 ms 13804 KB Output is correct
12 Correct 360 ms 18016 KB Output is correct
13 Correct 373 ms 19552 KB Output is correct
14 Correct 359 ms 19556 KB Output is correct
15 Correct 380 ms 19428 KB Output is correct
16 Correct 385 ms 19432 KB Output is correct
17 Correct 373 ms 19832 KB Output is correct
18 Correct 356 ms 20832 KB Output is correct
19 Correct 379 ms 21088 KB Output is correct
20 Correct 365 ms 19556 KB Output is correct
21 Correct 381 ms 19808 KB Output is correct
22 Correct 359 ms 19296 KB Output is correct
23 Correct 151 ms 14828 KB Output is correct
24 Correct 390 ms 21088 KB Output is correct
25 Correct 10 ms 4076 KB Output is correct
26 Correct 2 ms 2796 KB Output is correct
27 Correct 2 ms 2796 KB Output is correct
28 Correct 18 ms 5484 KB Output is correct
29 Correct 10 ms 4076 KB Output is correct
30 Correct 3 ms 2796 KB Output is correct
31 Correct 3 ms 2924 KB Output is correct
32 Correct 4 ms 2924 KB Output is correct
33 Correct 3 ms 2796 KB Output is correct
34 Correct 10 ms 4076 KB Output is correct
35 Correct 2 ms 2796 KB Output is correct
36 Correct 2 ms 2796 KB Output is correct
37 Correct 2 ms 2796 KB Output is correct
38 Correct 2 ms 2796 KB Output is correct
39 Correct 3 ms 2796 KB Output is correct
40 Correct 349 ms 17788 KB Output is correct
41 Correct 325 ms 17908 KB Output is correct
42 Correct 325 ms 18020 KB Output is correct
43 Correct 176 ms 14316 KB Output is correct
44 Correct 175 ms 14280 KB Output is correct
45 Correct 342 ms 17632 KB Output is correct
46 Correct 347 ms 17764 KB Output is correct
47 Correct 327 ms 18148 KB Output is correct
48 Correct 194 ms 12652 KB Output is correct
49 Correct 268 ms 17884 KB Output is correct
50 Correct 342 ms 17888 KB Output is correct
51 Correct 359 ms 17632 KB Output is correct