#include <bits/stdc++.h>
using namespace std;
const int NN = 200200;
int N, M;
int S, T, U, V;
int deg[NN];
long long fr[NN];
long long to[NN];
long long f[4][NN];
vector < int > dag[NN];
vector < pair < int, int > > e[NN];
bool minimize(long long &x, long long y){
if(x > y){
x = y;
return true;
}
return false;
}
void Dijkstra(int start, long long *d){
fill(d, d + N + 1, 1e18);
d[start] = 0;
vector < bool > done(N + 1, 0);
set < pair < long long, int > > heap;
heap.emplace(0, start);
while(!heap.empty()){
int x = heap.begin() -> second;
heap.erase(heap.begin());
if(done[x]) continue;
done[x] = 1;
for(auto c : e[x]){
if(minimize(d[c.first], d[x] + c.second)){
heap.emplace(d[c.first], c.first);
}
}
}
}
int main(){
scanf("%d%d%d%d%d%d", &N, &M, &S, &T, &U, &V);
while(M--){
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
e[u].emplace_back(v, w);
e[v].emplace_back(u, w);
}
Dijkstra(S, f[0]);
Dijkstra(T, f[1]);
Dijkstra(U, f[2]);
Dijkstra(V, f[3]);
long long ans = f[2][V];
for(int x = 1; x <= N; ++x){
for(auto c : e[x]){
int y = c.first, w = c.second;
if(f[0][x] + w == f[0][y]) dag[x].push_back(y), ++deg[y];
}
}
vector < int > lst, perm;
for(int i = 1; i <= N; ++i){
if(deg[i] == 0) lst.push_back(i);
}
while(!lst.empty()){
int x = lst.back();
lst.pop_back();
perm.push_back(x);
for(int y : dag[x]){
if(--deg[y] == 0) lst.push_back(y);
}
}
reverse(perm.begin(), perm.end());
for(int x : perm){
fr[x] = to[x] = 1e18;
if(f[0][x] + f[1][x] != f[0][T]) continue;
fr[x] = f[2][x];
to[x] = f[3][x];
for(int y : dag[x]){
fr[x] = min(fr[x], fr[y]);
to[x] = min(to[x], to[y]);
}
ans = min(ans, f[3][x] + fr[x]);
ans = min(ans, f[2][x] + to[x]);
}
cout << ans;
return 0;
}
Compilation message
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:50:47: 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:54:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &u, &v, &w);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
628 ms |
25300 KB |
Output is correct |
| 2 |
Correct |
532 ms |
25300 KB |
Output is correct |
| 3 |
Correct |
533 ms |
25412 KB |
Output is correct |
| 4 |
Correct |
582 ms |
25540 KB |
Output is correct |
| 5 |
Correct |
486 ms |
25540 KB |
Output is correct |
| 6 |
Correct |
617 ms |
26076 KB |
Output is correct |
| 7 |
Correct |
530 ms |
26076 KB |
Output is correct |
| 8 |
Correct |
498 ms |
26076 KB |
Output is correct |
| 9 |
Correct |
525 ms |
26076 KB |
Output is correct |
| 10 |
Correct |
404 ms |
26076 KB |
Output is correct |
| 11 |
Correct |
161 ms |
26076 KB |
Output is correct |
| 12 |
Correct |
520 ms |
26076 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
541 ms |
26076 KB |
Output is correct |
| 2 |
Correct |
556 ms |
26076 KB |
Output is correct |
| 3 |
Correct |
519 ms |
26076 KB |
Output is correct |
| 4 |
Correct |
551 ms |
26076 KB |
Output is correct |
| 5 |
Correct |
549 ms |
26076 KB |
Output is correct |
| 6 |
Correct |
471 ms |
26076 KB |
Output is correct |
| 7 |
Correct |
565 ms |
26076 KB |
Output is correct |
| 8 |
Correct |
575 ms |
26076 KB |
Output is correct |
| 9 |
Correct |
552 ms |
26076 KB |
Output is correct |
| 10 |
Correct |
553 ms |
26076 KB |
Output is correct |
| 11 |
Correct |
212 ms |
26076 KB |
Output is correct |
| 12 |
Correct |
541 ms |
26076 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
26076 KB |
Output is correct |
| 2 |
Correct |
9 ms |
26076 KB |
Output is correct |
| 3 |
Correct |
9 ms |
26076 KB |
Output is correct |
| 4 |
Correct |
28 ms |
26076 KB |
Output is correct |
| 5 |
Correct |
19 ms |
26076 KB |
Output is correct |
| 6 |
Correct |
10 ms |
26076 KB |
Output is correct |
| 7 |
Correct |
10 ms |
26076 KB |
Output is correct |
| 8 |
Correct |
11 ms |
26076 KB |
Output is correct |
| 9 |
Correct |
10 ms |
26076 KB |
Output is correct |
| 10 |
Correct |
19 ms |
26076 KB |
Output is correct |
| 11 |
Correct |
8 ms |
26076 KB |
Output is correct |
| 12 |
Correct |
9 ms |
26076 KB |
Output is correct |
| 13 |
Correct |
9 ms |
26076 KB |
Output is correct |
| 14 |
Correct |
9 ms |
26076 KB |
Output is correct |
| 15 |
Correct |
10 ms |
26076 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
628 ms |
25300 KB |
Output is correct |
| 2 |
Correct |
532 ms |
25300 KB |
Output is correct |
| 3 |
Correct |
533 ms |
25412 KB |
Output is correct |
| 4 |
Correct |
582 ms |
25540 KB |
Output is correct |
| 5 |
Correct |
486 ms |
25540 KB |
Output is correct |
| 6 |
Correct |
617 ms |
26076 KB |
Output is correct |
| 7 |
Correct |
530 ms |
26076 KB |
Output is correct |
| 8 |
Correct |
498 ms |
26076 KB |
Output is correct |
| 9 |
Correct |
525 ms |
26076 KB |
Output is correct |
| 10 |
Correct |
404 ms |
26076 KB |
Output is correct |
| 11 |
Correct |
161 ms |
26076 KB |
Output is correct |
| 12 |
Correct |
520 ms |
26076 KB |
Output is correct |
| 13 |
Correct |
541 ms |
26076 KB |
Output is correct |
| 14 |
Correct |
556 ms |
26076 KB |
Output is correct |
| 15 |
Correct |
519 ms |
26076 KB |
Output is correct |
| 16 |
Correct |
551 ms |
26076 KB |
Output is correct |
| 17 |
Correct |
549 ms |
26076 KB |
Output is correct |
| 18 |
Correct |
471 ms |
26076 KB |
Output is correct |
| 19 |
Correct |
565 ms |
26076 KB |
Output is correct |
| 20 |
Correct |
575 ms |
26076 KB |
Output is correct |
| 21 |
Correct |
552 ms |
26076 KB |
Output is correct |
| 22 |
Correct |
553 ms |
26076 KB |
Output is correct |
| 23 |
Correct |
212 ms |
26076 KB |
Output is correct |
| 24 |
Correct |
541 ms |
26076 KB |
Output is correct |
| 25 |
Correct |
29 ms |
26076 KB |
Output is correct |
| 26 |
Correct |
9 ms |
26076 KB |
Output is correct |
| 27 |
Correct |
9 ms |
26076 KB |
Output is correct |
| 28 |
Correct |
28 ms |
26076 KB |
Output is correct |
| 29 |
Correct |
19 ms |
26076 KB |
Output is correct |
| 30 |
Correct |
10 ms |
26076 KB |
Output is correct |
| 31 |
Correct |
10 ms |
26076 KB |
Output is correct |
| 32 |
Correct |
11 ms |
26076 KB |
Output is correct |
| 33 |
Correct |
10 ms |
26076 KB |
Output is correct |
| 34 |
Correct |
19 ms |
26076 KB |
Output is correct |
| 35 |
Correct |
8 ms |
26076 KB |
Output is correct |
| 36 |
Correct |
9 ms |
26076 KB |
Output is correct |
| 37 |
Correct |
9 ms |
26076 KB |
Output is correct |
| 38 |
Correct |
9 ms |
26076 KB |
Output is correct |
| 39 |
Correct |
10 ms |
26076 KB |
Output is correct |
| 40 |
Correct |
629 ms |
27312 KB |
Output is correct |
| 41 |
Correct |
575 ms |
27312 KB |
Output is correct |
| 42 |
Correct |
580 ms |
27312 KB |
Output is correct |
| 43 |
Correct |
213 ms |
27312 KB |
Output is correct |
| 44 |
Correct |
206 ms |
27312 KB |
Output is correct |
| 45 |
Correct |
445 ms |
27312 KB |
Output is correct |
| 46 |
Correct |
447 ms |
27312 KB |
Output is correct |
| 47 |
Correct |
612 ms |
27312 KB |
Output is correct |
| 48 |
Correct |
186 ms |
27312 KB |
Output is correct |
| 49 |
Correct |
476 ms |
27312 KB |
Output is correct |
| 50 |
Correct |
457 ms |
27312 KB |
Output is correct |
| 51 |
Correct |
447 ms |
27312 KB |
Output is correct |
