oj.uz

Submission #595124

# Submission time Handle Problem Language Result Execution time Memory
595124 2022-07-13T11:29:56 Z Vanilla Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 556 ms 26992 KB 
#include <bits/stdc++.h>
using namespace std;typedef long long z;const int q=1e5+2;vector<pair<int,z>> g[q];z d[3][q];z dp[2][q];bitset<q>vis;int main(){int n,m,s1,t1,s2,t2;cin >>n>>m>>s1>>t1>>s2>>t2;for(int i=0;i<q;i++)for(int j=0;j<3;j++)d[j][i]=1e18;for(int i=0;i<m;i++){int x,y,c;cin>>x>>y>>c;g[x].push_back({y,c});g[y].push_back({x,c});}auto o=[&](int b, int i) {set<pair<z,z>>s;d[i][b]=0;s.insert({0,b});while(!s.empty()){int u=s.begin()->second;s.erase(s.begin());for(auto &[v,c]:g[u]) {if(d[i][u]+c<d[i][v]) {s.erase({d[i][v],v});d[i][v]=d[i][u]+c;s.insert({d[i][v],v});}}}};o(s2,0);o(t2,1);o(s1,2);z rs=d[0][t2];auto r=[&](int u,auto&& r)->void{vis[u]=1;dp[0][u]=d[0][u];dp[1][u]=d[1][u];for(auto &[v,c]:g[u]){if(d[2][u]-c!=d[2][v])continue;if(!vis[v])r(v,r);dp[0][u]=min(dp[0][u],dp[0][v]);dp[1][u]=min(dp[1][u],dp[1][v]);}rs=min(rs,min(dp[0][u]+d[1][u],dp[1][u]+d[0][u]));};r(t1,r);cout<<rs<<"\n";return 0;}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 506 ms 18316 KB Output is correct
2 Correct 442 ms 19348 KB Output is correct
3 Correct 460 ms 26968 KB Output is correct
4 Correct 465 ms 18520 KB Output is correct
5 Correct 484 ms 19024 KB Output is correct
6 Correct 514 ms 18392 KB Output is correct
7 Correct 480 ms 19020 KB Output is correct
8 Correct 455 ms 19260 KB Output is correct
9 Correct 471 ms 17392 KB Output is correct
10 Correct 445 ms 17612 KB Output is correct
11 Correct 190 ms 17116 KB Output is correct
12 Correct 494 ms 17296 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 524 ms 22748 KB Output is correct
2 Correct 536 ms 22644 KB Output is correct
3 Correct 485 ms 21908 KB Output is correct
4 Correct 533 ms 22456 KB Output is correct
5 Correct 460 ms 23268 KB Output is correct
6 Correct 500 ms 26128 KB Output is correct
7 Correct 512 ms 26992 KB Output is correct
8 Correct 495 ms 22576 KB Output is correct
9 Correct 470 ms 23344 KB Output is correct
10 Correct 509 ms 22244 KB Output is correct
11 Correct 170 ms 19540 KB Output is correct
12 Correct 454 ms 26700 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 6272 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 5 ms 4948 KB Output is correct
4 Correct 39 ms 7656 KB Output is correct
5 Correct 20 ms 6256 KB Output is correct
6 Correct 4 ms 5076 KB Output is correct
7 Correct 5 ms 5076 KB Output is correct
8 Correct 6 ms 5076 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 20 ms 6348 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 5 ms 5012 KB Output is correct
15 Correct 5 ms 5076 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 506 ms 18316 KB Output is correct
2 Correct 442 ms 19348 KB Output is correct
3 Correct 460 ms 26968 KB Output is correct
4 Correct 465 ms 18520 KB Output is correct
5 Correct 484 ms 19024 KB Output is correct
6 Correct 514 ms 18392 KB Output is correct
7 Correct 480 ms 19020 KB Output is correct
8 Correct 455 ms 19260 KB Output is correct
9 Correct 471 ms 17392 KB Output is correct
10 Correct 445 ms 17612 KB Output is correct
11 Correct 190 ms 17116 KB Output is correct
12 Correct 494 ms 17296 KB Output is correct
13 Correct 524 ms 22748 KB Output is correct
14 Correct 536 ms 22644 KB Output is correct
15 Correct 485 ms 21908 KB Output is correct
16 Correct 533 ms 22456 KB Output is correct
17 Correct 460 ms 23268 KB Output is correct
18 Correct 500 ms 26128 KB Output is correct
19 Correct 512 ms 26992 KB Output is correct
20 Correct 495 ms 22576 KB Output is correct
21 Correct 470 ms 23344 KB Output is correct
22 Correct 509 ms 22244 KB Output is correct
23 Correct 170 ms 19540 KB Output is correct
24 Correct 454 ms 26700 KB Output is correct
25 Correct 27 ms 6272 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 5 ms 4948 KB Output is correct
28 Correct 39 ms 7656 KB Output is correct
29 Correct 20 ms 6256 KB Output is correct
30 Correct 4 ms 5076 KB Output is correct
31 Correct 5 ms 5076 KB Output is correct
32 Correct 6 ms 5076 KB Output is correct
33 Correct 4 ms 5076 KB Output is correct
34 Correct 20 ms 6348 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 5 ms 5012 KB Output is correct
39 Correct 5 ms 5076 KB Output is correct
40 Correct 556 ms 20432 KB Output is correct
41 Correct 459 ms 17676 KB Output is correct
42 Correct 488 ms 17720 KB Output is correct
43 Correct 190 ms 17984 KB Output is correct
44 Correct 201 ms 17992 KB Output is correct
45 Correct 438 ms 18908 KB Output is correct
46 Correct 396 ms 18648 KB Output is correct
47 Correct 504 ms 19156 KB Output is correct
48 Correct 184 ms 14004 KB Output is correct
49 Correct 446 ms 20492 KB Output is correct
50 Correct 433 ms 18780 KB Output is correct
51 Correct 412 ms 18736 KB Output is correct