oj.uz

Submission #294975

# Submission time Handle Problem Language Result Execution time Memory
294975 2020-09-09T11:25:00 Z thebes Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 502 ms 31212 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll,ll> pll;
#define F first
#define S second

const int MN = 1e5+5, MM = 2e5+5;
int N, M, i, j, x, y, w, S, T, U, V, ww[MM], nd[4], deg[MN];
vector<pll> adj[MN]; vector<int> dag[MN]; ll dis[4][MN], dp[MN][2], ans;
priority_queue<pll,vector<pll>,greater<pll>> q;
queue<int> Q; pll ed[MM];

inline void dij(int idx){
    memset(dis[idx],-1,sizeof(dis[idx]));
    int st = nd[idx];
    q.push({0, st});
    while(q.size()){
        pll cur = q.top(); q.pop();
        if(dis[idx][cur.S]!=-1) continue;
        dis[idx][cur.S] = cur.F;
        for(auto v : adj[cur.S]){
            if(dis[idx][v.F]!=-1) continue;
            q.push({cur.F+v.S,v.F});
        }
    }
}

int main(){
    scanf("%d%d%d%d%d%d",&N,&M,&S,&T,&U,&V);
    nd[0]=S, nd[1]=T, nd[2]=U, nd[3]=V;
    for(i=1;i<=M;i++){
        scanf("%d%d%d",&x,&y,&w);
        ed[i] = {x, y}; ww[i] = w;
        adj[x].push_back({y, w});
        adj[y].push_back({x, w});
    }
    for(i=0;i<4;i++) dij(i);
    for(i=1;i<=M;i++){
        x = ed[i].F, y = ed[i].S;
        if(dis[0][x]>dis[0][y]) swap(x,y);
        if(dis[0][x]+dis[1][y]+ww[i]==dis[0][T]){
            dag[y].push_back(x);
            deg[x]++;
        }
    }
    ans = 1LL<<60;
    for(i=1;i<=N;i++){
        if(!deg[i]) Q.push(i);
    }
    memset(dp,0x3f,sizeof(dp));
    while(Q.size()){
        x = Q.front(); Q.pop();
        for(i=0;i<2;i++) dp[x][i] = min(dp[x][i], dis[i^2][x]);
        for(i=0;i<2;i++) ans = min(ans, dp[x][i]+dis[i^3][x]);
        for(auto v : dag[x]){
            deg[v] --;
            if(!deg[v]) Q.push(v);
            for(i=0;i<2;i++) dp[v][i] = min(dp[v][i], dp[x][i]);
        }
    }
    printf("%lld\n",ans);
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   31 |     scanf("%d%d%d%d%d%d",&N,&M,&S,&T,&U,&V);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   34 |         scanf("%d%d%d",&x,&y,&w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 28008 KB Output is correct
2 Correct 451 ms 29804 KB Output is correct
3 Correct 487 ms 31008 KB Output is correct
4 Correct 475 ms 30056 KB Output is correct
5 Correct 441 ms 30080 KB Output is correct
6 Correct 467 ms 30180 KB Output is correct
7 Correct 461 ms 30692 KB Output is correct
8 Correct 476 ms 30692 KB Output is correct
9 Correct 461 ms 30316 KB Output is correct
10 Correct 416 ms 30308 KB Output is correct
11 Correct 189 ms 20600 KB Output is correct
12 Correct 454 ms 30184 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 28008 KB Output is correct
2 Correct 449 ms 29668 KB Output is correct
3 Correct 439 ms 29544 KB Output is correct
4 Correct 458 ms 29688 KB Output is correct
5 Correct 452 ms 29968 KB Output is correct
6 Correct 469 ms 30948 KB Output is correct
7 Correct 452 ms 30692 KB Output is correct
8 Correct 452 ms 29944 KB Output is correct
9 Correct 453 ms 29928 KB Output is correct
10 Correct 447 ms 29628 KB Output is correct
11 Correct 194 ms 21240 KB Output is correct
12 Correct 464 ms 31204 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 11780 KB Output is correct
2 Correct 7 ms 9728 KB Output is correct
3 Correct 7 ms 9728 KB Output is correct
4 Correct 56 ms 13812 KB Output is correct
5 Correct 30 ms 11900 KB Output is correct
6 Correct 8 ms 9856 KB Output is correct
7 Correct 9 ms 9984 KB Output is correct
8 Correct 10 ms 9984 KB Output is correct
9 Correct 8 ms 9856 KB Output is correct
10 Correct 30 ms 11900 KB Output is correct
11 Correct 7 ms 9728 KB Output is correct
12 Correct 7 ms 9636 KB Output is correct
13 Correct 7 ms 9728 KB Output is correct
14 Correct 7 ms 9856 KB Output is correct
15 Correct 7 ms 9856 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 462 ms 28008 KB Output is correct
2 Correct 451 ms 29804 KB Output is correct
3 Correct 487 ms 31008 KB Output is correct
4 Correct 475 ms 30056 KB Output is correct
5 Correct 441 ms 30080 KB Output is correct
6 Correct 467 ms 30180 KB Output is correct
7 Correct 461 ms 30692 KB Output is correct
8 Correct 476 ms 30692 KB Output is correct
9 Correct 461 ms 30316 KB Output is correct
10 Correct 416 ms 30308 KB Output is correct
11 Correct 189 ms 20600 KB Output is correct
12 Correct 454 ms 30184 KB Output is correct
13 Correct 481 ms 28008 KB Output is correct
14 Correct 449 ms 29668 KB Output is correct
15 Correct 439 ms 29544 KB Output is correct
16 Correct 458 ms 29688 KB Output is correct
17 Correct 452 ms 29968 KB Output is correct
18 Correct 469 ms 30948 KB Output is correct
19 Correct 452 ms 30692 KB Output is correct
20 Correct 452 ms 29944 KB Output is correct
21 Correct 453 ms 29928 KB Output is correct
22 Correct 447 ms 29628 KB Output is correct
23 Correct 194 ms 21240 KB Output is correct
24 Correct 464 ms 31204 KB Output is correct
25 Correct 31 ms 11780 KB Output is correct
26 Correct 7 ms 9728 KB Output is correct
27 Correct 7 ms 9728 KB Output is correct
28 Correct 56 ms 13812 KB Output is correct
29 Correct 30 ms 11900 KB Output is correct
30 Correct 8 ms 9856 KB Output is correct
31 Correct 9 ms 9984 KB Output is correct
32 Correct 10 ms 9984 KB Output is correct
33 Correct 8 ms 9856 KB Output is correct
34 Correct 30 ms 11900 KB Output is correct
35 Correct 7 ms 9728 KB Output is correct
36 Correct 7 ms 9636 KB Output is correct
37 Correct 7 ms 9728 KB Output is correct
38 Correct 7 ms 9856 KB Output is correct
39 Correct 7 ms 9856 KB Output is correct
40 Correct 450 ms 29636 KB Output is correct
41 Correct 457 ms 30180 KB Output is correct
42 Correct 476 ms 30180 KB Output is correct
43 Correct 206 ms 22264 KB Output is correct
44 Correct 211 ms 22264 KB Output is correct
45 Correct 500 ms 31080 KB Output is correct
46 Correct 502 ms 30816 KB Output is correct
47 Correct 453 ms 29996 KB Output is correct
48 Correct 203 ms 21752 KB Output is correct
49 Correct 453 ms 29380 KB Output is correct
50 Correct 480 ms 30700 KB Output is correct
51 Correct 502 ms 31212 KB Output is correct