//https://oj.uz/problem/view/JOI18_commuter_pass
#include<bits/stdc++.h>
#define int long long
const int N = 1e5 + 5;
const long long inf = 1e18 + 7;
using namespace std;
typedef pair <int, long long> 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].first; long long cost = adj[u][i].second;
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].first; long long cost = adj[u][i].second;
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){
MinU[u] = min(MinU[u], dU[u]);
MinV[u] = min(MinV[u], dV[u]);
ans = min(ans, MinU[u] + dV[u]);
ans = min(ans, MinV[u] + dU[u]);
}
}
signed main(){
scanf("%lld %lld %lld %lld %lld %lld", &n, &m, &S, &T, &U, &V);
for (int i = 1; i <= m; i++){
int u, v; long long c;
scanf("%lld %lld %lld", &u, &v, &c);
adj[u].push_back({v, c});
adj[v].push_back({u, c});
}
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(long long int, std::vector<long long int>&)':
commuter_pass.cpp:24: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(long long int)':
commuter_pass.cpp:39: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:58:67: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld %lld %lld %lld %lld", &n, &m, &S, &T, &U, &V);
^
commuter_pass.cpp:61:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld %lld", &u, &v, &c);
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
394 ms |
18560 KB |
Output is correct |
| 2 |
Correct |
414 ms |
18560 KB |
Output is correct |
| 3 |
Correct |
413 ms |
21624 KB |
Output is correct |
| 4 |
Correct |
385 ms |
21624 KB |
Output is correct |
| 5 |
Correct |
392 ms |
21624 KB |
Output is correct |
| 6 |
Correct |
397 ms |
21624 KB |
Output is correct |
| 7 |
Correct |
436 ms |
21624 KB |
Output is correct |
| 8 |
Correct |
410 ms |
21624 KB |
Output is correct |
| 9 |
Correct |
392 ms |
21624 KB |
Output is correct |
| 10 |
Correct |
340 ms |
21624 KB |
Output is correct |
| 11 |
Correct |
154 ms |
21624 KB |
Output is correct |
| 12 |
Correct |
401 ms |
21624 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
384 ms |
21624 KB |
Output is correct |
| 2 |
Correct |
406 ms |
21624 KB |
Output is correct |
| 3 |
Correct |
401 ms |
21624 KB |
Output is correct |
| 4 |
Correct |
479 ms |
21624 KB |
Output is correct |
| 5 |
Correct |
469 ms |
21624 KB |
Output is correct |
| 6 |
Correct |
402 ms |
21624 KB |
Output is correct |
| 7 |
Correct |
419 ms |
23812 KB |
Output is correct |
| 8 |
Correct |
421 ms |
23812 KB |
Output is correct |
| 9 |
Correct |
393 ms |
23812 KB |
Output is correct |
| 10 |
Correct |
406 ms |
23812 KB |
Output is correct |
| 11 |
Correct |
165 ms |
23812 KB |
Output is correct |
| 12 |
Correct |
403 ms |
23812 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
15 ms |
23812 KB |
Output is correct |
| 2 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 3 |
Correct |
5 ms |
23812 KB |
Output is correct |
| 4 |
Correct |
24 ms |
23812 KB |
Output is correct |
| 5 |
Correct |
14 ms |
23812 KB |
Output is correct |
| 6 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 7 |
Correct |
5 ms |
23812 KB |
Output is correct |
| 8 |
Correct |
6 ms |
23812 KB |
Output is correct |
| 9 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 10 |
Correct |
14 ms |
23812 KB |
Output is correct |
| 11 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 12 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 13 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 14 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 15 |
Correct |
4 ms |
23812 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
394 ms |
18560 KB |
Output is correct |
| 2 |
Correct |
414 ms |
18560 KB |
Output is correct |
| 3 |
Correct |
413 ms |
21624 KB |
Output is correct |
| 4 |
Correct |
385 ms |
21624 KB |
Output is correct |
| 5 |
Correct |
392 ms |
21624 KB |
Output is correct |
| 6 |
Correct |
397 ms |
21624 KB |
Output is correct |
| 7 |
Correct |
436 ms |
21624 KB |
Output is correct |
| 8 |
Correct |
410 ms |
21624 KB |
Output is correct |
| 9 |
Correct |
392 ms |
21624 KB |
Output is correct |
| 10 |
Correct |
340 ms |
21624 KB |
Output is correct |
| 11 |
Correct |
154 ms |
21624 KB |
Output is correct |
| 12 |
Correct |
401 ms |
21624 KB |
Output is correct |
| 13 |
Correct |
384 ms |
21624 KB |
Output is correct |
| 14 |
Correct |
406 ms |
21624 KB |
Output is correct |
| 15 |
Correct |
401 ms |
21624 KB |
Output is correct |
| 16 |
Correct |
479 ms |
21624 KB |
Output is correct |
| 17 |
Correct |
469 ms |
21624 KB |
Output is correct |
| 18 |
Correct |
402 ms |
21624 KB |
Output is correct |
| 19 |
Correct |
419 ms |
23812 KB |
Output is correct |
| 20 |
Correct |
421 ms |
23812 KB |
Output is correct |
| 21 |
Correct |
393 ms |
23812 KB |
Output is correct |
| 22 |
Correct |
406 ms |
23812 KB |
Output is correct |
| 23 |
Correct |
165 ms |
23812 KB |
Output is correct |
| 24 |
Correct |
403 ms |
23812 KB |
Output is correct |
| 25 |
Correct |
15 ms |
23812 KB |
Output is correct |
| 26 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 27 |
Correct |
5 ms |
23812 KB |
Output is correct |
| 28 |
Correct |
24 ms |
23812 KB |
Output is correct |
| 29 |
Correct |
14 ms |
23812 KB |
Output is correct |
| 30 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 31 |
Correct |
5 ms |
23812 KB |
Output is correct |
| 32 |
Correct |
6 ms |
23812 KB |
Output is correct |
| 33 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 34 |
Correct |
14 ms |
23812 KB |
Output is correct |
| 35 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 36 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 37 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 38 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 39 |
Correct |
4 ms |
23812 KB |
Output is correct |
| 40 |
Correct |
386 ms |
23812 KB |
Output is correct |
| 41 |
Correct |
450 ms |
23812 KB |
Output is correct |
| 42 |
Correct |
420 ms |
23812 KB |
Output is correct |
| 43 |
Correct |
198 ms |
23812 KB |
Output is correct |
| 44 |
Correct |
187 ms |
23812 KB |
Output is correct |
| 45 |
Correct |
403 ms |
23812 KB |
Output is correct |
| 46 |
Correct |
400 ms |
23812 KB |
Output is correct |
| 47 |
Correct |
436 ms |
23812 KB |
Output is correct |
| 48 |
Correct |
202 ms |
23812 KB |
Output is correct |
| 49 |
Correct |
356 ms |
23812 KB |
Output is correct |
| 50 |
Correct |
404 ms |
23812 KB |
Output is correct |
| 51 |
Correct |
367 ms |
23812 KB |
Output is correct |
