oj.uz

Submission #135174

# Submission time Handle Problem Language Result Execution time Memory
135174 2019-07-23T18:07:04 Z duality Commuter Pass (JOI18_commuter_pass) C++11
100 / 100
 536 ms 23116 KB 
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long int LLI;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

vpii adjList[100000];
LLI distS[100000],distT[100000],distU[100000],distV[100000];
priority_queue<pair<LLI,int> > H;
int findDist(int s,LLI *dist,int N) {
    int i;
    for (i = 0; i < N; i++) dist[i] = -1;
    dist[s] = 0,H.push(mp(0,s));
    while (!H.empty()) {
        int u = H.top().second;
        LLI d = -H.top().first;
        H.pop();

        if (d > dist[u]) continue;
        for (i = 0; i < adjList[u].size(); i++) {
            int v = adjList[u][i].first;
            if ((dist[v] == -1) || (d+adjList[u][i].second < dist[v])) {
                dist[v] = d+adjList[u][i].second;
                H.push(mp(-dist[v],v));
            }
        }
    }
    return 0;
}
LLI dist1[100000],dist2[100000];
int visited[100000];
LLI doDFS(int u,LLI *a,LLI *b,LLI *c) {
    if (visited[u]) return c[u];
    int i;
    visited[u] = 1,c[u] = b[u];
    for (i = 0; i < adjList[u].size(); i++) {
        int v = adjList[u][i].first;
        if (a[u] == a[v]+adjList[u][i].second) c[u] = min(c[u],doDFS(v,a,b,c));
    }
    return c[u];
}
int main() {
    int i;
    int N,M;
    int S,T,U,V;
    int A,B,C;
    scanf("%d %d %d %d %d %d",&N,&M,&S,&T,&U,&V);
    S--,T--,U--,V--;
    for (i = 0; i < M; i++) {
        scanf("%d %d %d",&A,&B,&C);
        A--,B--;
        adjList[A].pb(mp(B,C));
        adjList[B].pb(mp(A,C));
    }

    findDist(S,distS,N),findDist(T,distT,N);
    findDist(U,distU,N),findDist(V,distV,N);
    LLI ans = distU[V];
    for (i = 0; i < N; i++) doDFS(i,distS,distU,dist1);
    fill(visited,visited+N,0);
    for (i = 0; i < N; i++) doDFS(i,distT,distV,dist2);
    for (i = 0; i < N; i++) {
        if (distS[i]+distT[i] == distS[T]) ans = min(ans,dist1[i]+dist2[i]);
    }
    fill(visited,visited+N,0);
    for (i = 0; i < N; i++) doDFS(i,distS,distV,dist1);
    fill(visited,visited+N,0);
    for (i = 0; i < N; i++) doDFS(i,distT,distU,dist2);
    for (i = 0; i < N; i++) {
        if (distS[i]+distT[i] == distS[T]) ans = min(ans,dist1[i]+dist2[i]);
    }
    printf("%lld\n",ans);

    return 0;
}

Compilation message

commuter_pass.cpp: In function 'int findDist(int, LLI*, int)':
commuter_pass.cpp:23:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (i = 0; i < adjList[u].size(); i++) {
                     ~~^~~~~~~~~~~~~~~~~~~
commuter_pass.cpp: In function 'LLI doDFS(int, LLI*, LLI*, LLI*)':
commuter_pass.cpp:39:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < adjList[u].size(); i++) {
                 ~~^~~~~~~~~~~~~~~~~~~
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:50:10: 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:53:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&A,&B,&C);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 414 ms 19312 KB Output is correct
2 Correct 433 ms 18688 KB Output is correct
3 Correct 433 ms 21840 KB Output is correct
4 Correct 390 ms 19240 KB Output is correct
5 Correct 402 ms 18404 KB Output is correct
6 Correct 409 ms 19192 KB Output is correct
7 Correct 423 ms 18688 KB Output is correct
8 Correct 435 ms 18784 KB Output is correct
9 Correct 403 ms 19280 KB Output is correct
10 Correct 356 ms 19268 KB Output is correct
11 Correct 214 ms 17048 KB Output is correct
12 Correct 442 ms 19152 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 469 ms 20812 KB Output is correct
2 Correct 536 ms 20420 KB Output is correct
3 Correct 517 ms 21724 KB Output is correct
4 Correct 432 ms 21740 KB Output is correct
5 Correct 432 ms 21596 KB Output is correct
6 Correct 498 ms 22564 KB Output is correct
7 Correct 465 ms 23116 KB Output is correct
8 Correct 449 ms 21540 KB Output is correct
9 Correct 491 ms 19980 KB Output is correct
10 Correct 435 ms 20444 KB Output is correct
11 Correct 183 ms 17144 KB Output is correct
12 Correct 439 ms 22368 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 3704 KB Output is correct
2 Correct 5 ms 2680 KB Output is correct
3 Correct 5 ms 2808 KB Output is correct
4 Correct 25 ms 4728 KB Output is correct
5 Correct 14 ms 3832 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 5 ms 2808 KB Output is correct
8 Correct 6 ms 2936 KB Output is correct
9 Correct 6 ms 2808 KB Output is correct
10 Correct 16 ms 3704 KB Output is correct
11 Correct 4 ms 2808 KB Output is correct
12 Correct 4 ms 2680 KB Output is correct
13 Correct 4 ms 2680 KB Output is correct
14 Correct 6 ms 2808 KB Output is correct
15 Correct 5 ms 2808 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 414 ms 19312 KB Output is correct
2 Correct 433 ms 18688 KB Output is correct
3 Correct 433 ms 21840 KB Output is correct
4 Correct 390 ms 19240 KB Output is correct
5 Correct 402 ms 18404 KB Output is correct
6 Correct 409 ms 19192 KB Output is correct
7 Correct 423 ms 18688 KB Output is correct
8 Correct 435 ms 18784 KB Output is correct
9 Correct 403 ms 19280 KB Output is correct
10 Correct 356 ms 19268 KB Output is correct
11 Correct 214 ms 17048 KB Output is correct
12 Correct 442 ms 19152 KB Output is correct
13 Correct 469 ms 20812 KB Output is correct
14 Correct 536 ms 20420 KB Output is correct
15 Correct 517 ms 21724 KB Output is correct
16 Correct 432 ms 21740 KB Output is correct
17 Correct 432 ms 21596 KB Output is correct
18 Correct 498 ms 22564 KB Output is correct
19 Correct 465 ms 23116 KB Output is correct
20 Correct 449 ms 21540 KB Output is correct
21 Correct 491 ms 19980 KB Output is correct
22 Correct 435 ms 20444 KB Output is correct
23 Correct 183 ms 17144 KB Output is correct
24 Correct 439 ms 22368 KB Output is correct
25 Correct 15 ms 3704 KB Output is correct
26 Correct 5 ms 2680 KB Output is correct
27 Correct 5 ms 2808 KB Output is correct
28 Correct 25 ms 4728 KB Output is correct
29 Correct 14 ms 3832 KB Output is correct
30 Correct 5 ms 2808 KB Output is correct
31 Correct 5 ms 2808 KB Output is correct
32 Correct 6 ms 2936 KB Output is correct
33 Correct 6 ms 2808 KB Output is correct
34 Correct 16 ms 3704 KB Output is correct
35 Correct 4 ms 2808 KB Output is correct
36 Correct 4 ms 2680 KB Output is correct
37 Correct 4 ms 2680 KB Output is correct
38 Correct 6 ms 2808 KB Output is correct
39 Correct 5 ms 2808 KB Output is correct
40 Correct 374 ms 19528 KB Output is correct
41 Correct 422 ms 19312 KB Output is correct
42 Correct 422 ms 19260 KB Output is correct
43 Correct 205 ms 16516 KB Output is correct
44 Correct 211 ms 16888 KB Output is correct
45 Correct 496 ms 18168 KB Output is correct
46 Correct 365 ms 18008 KB Output is correct
47 Correct 492 ms 18976 KB Output is correct
48 Correct 171 ms 13736 KB Output is correct
49 Correct 322 ms 19240 KB Output is correct
50 Correct 410 ms 18296 KB Output is correct
51 Correct 447 ms 18192 KB Output is correct