Submission #41887

# Submission time Handle Problem Language Result Execution time Memory
41887 2018-02-22T05:04:30 Z minhtung0404 Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
428 ms 23744 KB
//https://oj.uz/problem/view/JOI18_commuter_pass

#include<bits/stdc++.h>
const int N = 1e5 + 5;
const long long inf = 1e18 + 7;
using namespace std;

typedef pair <long long, int> ii;
vector <ii> adj[N];
vector <long long> dS, dU, dV;

int n, m, U, V, S, T;
long long MinU[N], MinV[N], ans;
bool visitT[N], visit[N];

void dijkstra(int S, vector <long long>& d){
    d.assign(n+1, inf); d[S] = 0;
    priority_queue <ii, vector <ii>, greater <ii>> mq; mq.push({d[S], S});
    while (mq.size()){
        ii z = mq.top(); mq.pop();
        int u = z.second; long long val = z.first;
        if (val != d[u]) continue;
        for (int i = 0; i < adj[u].size(); i++){
            int v = adj[u][i].second; long long cost = adj[u][i].first;
            if (d[v] > d[u] + cost){
                d[v] = d[u] + cost;
                mq.push({d[v], v});
            }
        }
    }
}

void dfs(int u){
    if (visit[u]) return;
    visit[u] = true;
    MinU[u] = MinV[u] = inf;
    if (u == T) visitT[u] = true;
    for (int i = 0; i < adj[u].size(); i++){
        int v = adj[u][i].second; long long cost = adj[u][i].first;
        if (dS[v] != dS[u] + cost) continue;
        dfs(v);
        if (visitT[v] == true){
            visitT[u] = true;
            MinU[u] = min(MinU[u], MinU[v]);
            MinV[u] = min(MinV[u], MinV[v]);
        }
    }
    if (visitT[u] == true){
        ans = min(ans, MinU[u] + dV[u]);
        ans = min(ans, MinV[u] + dU[u]);
        MinU[u] = min(MinU[u], dU[u]);
        MinV[u] = min(MinV[u], dV[u]);
    }
}

int main(){
    scanf("%d %d %d %d %d %d", &n, &m, &S, &T, &U, &V);
    for (int i = 1; i <= m; i++){
        int u, v; long long c;
        scanf("%d %d %lld", &u, &v, &c);
        adj[u].push_back({c, v});
        adj[v].push_back({c, u});
    }
    dijkstra(S, dS); dijkstra(U, dU); dijkstra(V, dV);
    ans = dU[V]; dfs(S);
    printf("%lld", ans);
}

Compilation message

commuter_pass.cpp: In function 'void dijkstra(int, std::vector<long long int>&)':
commuter_pass.cpp:23:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int i = 0; i < adj[u].size(); i++){
                           ^
commuter_pass.cpp: In function 'void dfs(int)':
commuter_pass.cpp:38:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < adj[u].size(); i++){
                       ^
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:57:55: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d %d %d", &n, &m, &S, &T, &U, &V);
                                                       ^
commuter_pass.cpp:60:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %lld", &u, &v, &c);
                                        ^
# Verdict Execution time Memory Grader output
1 Correct 399 ms 18452 KB Output is correct
2 Correct 393 ms 18452 KB Output is correct
3 Correct 410 ms 21548 KB Output is correct
4 Correct 397 ms 21548 KB Output is correct
5 Correct 383 ms 21548 KB Output is correct
6 Correct 394 ms 21548 KB Output is correct
7 Correct 428 ms 21548 KB Output is correct
8 Correct 390 ms 21548 KB Output is correct
9 Correct 404 ms 21548 KB Output is correct
10 Correct 334 ms 21548 KB Output is correct
11 Correct 178 ms 21548 KB Output is correct
12 Correct 350 ms 21548 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 365 ms 21548 KB Output is correct
2 Correct 412 ms 21548 KB Output is correct
3 Correct 408 ms 21548 KB Output is correct
4 Correct 407 ms 21548 KB Output is correct
5 Correct 393 ms 21548 KB Output is correct
6 Correct 408 ms 21548 KB Output is correct
7 Correct 401 ms 23744 KB Output is correct
8 Correct 384 ms 23744 KB Output is correct
9 Correct 398 ms 23744 KB Output is correct
10 Correct 381 ms 23744 KB Output is correct
11 Correct 165 ms 23744 KB Output is correct
12 Correct 370 ms 23744 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 23744 KB Output is correct
2 Correct 4 ms 23744 KB Output is correct
3 Correct 3 ms 23744 KB Output is correct
4 Correct 24 ms 23744 KB Output is correct
5 Correct 13 ms 23744 KB Output is correct
6 Correct 4 ms 23744 KB Output is correct
7 Correct 4 ms 23744 KB Output is correct
8 Correct 5 ms 23744 KB Output is correct
9 Correct 6 ms 23744 KB Output is correct
10 Correct 13 ms 23744 KB Output is correct
11 Correct 3 ms 23744 KB Output is correct
12 Correct 3 ms 23744 KB Output is correct
13 Correct 4 ms 23744 KB Output is correct
14 Correct 4 ms 23744 KB Output is correct
15 Correct 4 ms 23744 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 399 ms 18452 KB Output is correct
2 Correct 393 ms 18452 KB Output is correct
3 Correct 410 ms 21548 KB Output is correct
4 Correct 397 ms 21548 KB Output is correct
5 Correct 383 ms 21548 KB Output is correct
6 Correct 394 ms 21548 KB Output is correct
7 Correct 428 ms 21548 KB Output is correct
8 Correct 390 ms 21548 KB Output is correct
9 Correct 404 ms 21548 KB Output is correct
10 Correct 334 ms 21548 KB Output is correct
11 Correct 178 ms 21548 KB Output is correct
12 Correct 350 ms 21548 KB Output is correct
13 Correct 365 ms 21548 KB Output is correct
14 Correct 412 ms 21548 KB Output is correct
15 Correct 408 ms 21548 KB Output is correct
16 Correct 407 ms 21548 KB Output is correct
17 Correct 393 ms 21548 KB Output is correct
18 Correct 408 ms 21548 KB Output is correct
19 Correct 401 ms 23744 KB Output is correct
20 Correct 384 ms 23744 KB Output is correct
21 Correct 398 ms 23744 KB Output is correct
22 Correct 381 ms 23744 KB Output is correct
23 Correct 165 ms 23744 KB Output is correct
24 Correct 370 ms 23744 KB Output is correct
25 Correct 14 ms 23744 KB Output is correct
26 Correct 4 ms 23744 KB Output is correct
27 Correct 3 ms 23744 KB Output is correct
28 Correct 24 ms 23744 KB Output is correct
29 Correct 13 ms 23744 KB Output is correct
30 Correct 4 ms 23744 KB Output is correct
31 Correct 4 ms 23744 KB Output is correct
32 Correct 5 ms 23744 KB Output is correct
33 Correct 6 ms 23744 KB Output is correct
34 Correct 13 ms 23744 KB Output is correct
35 Correct 3 ms 23744 KB Output is correct
36 Correct 3 ms 23744 KB Output is correct
37 Correct 4 ms 23744 KB Output is correct
38 Correct 4 ms 23744 KB Output is correct
39 Correct 4 ms 23744 KB Output is correct
40 Correct 337 ms 23744 KB Output is correct
41 Correct 367 ms 23744 KB Output is correct
42 Correct 352 ms 23744 KB Output is correct
43 Correct 147 ms 23744 KB Output is correct
44 Correct 147 ms 23744 KB Output is correct
45 Correct 327 ms 23744 KB Output is correct
46 Correct 349 ms 23744 KB Output is correct
47 Correct 367 ms 23744 KB Output is correct
48 Correct 146 ms 23744 KB Output is correct
49 Correct 294 ms 23744 KB Output is correct
50 Correct 328 ms 23744 KB Output is correct
51 Correct 353 ms 23744 KB Output is correct