This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int dist[305][305], n, m, s, t, u, v;
void solve(){
cin >> n >> m >> s >> t >> u >> v;
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)dist[i][j] = 1e18, dist[i][i] = 0;
while(m--){
int a, b, c; cin >> a >> b >> c;
dist[a][b] = min(dist[a][b], c);
dist[b][a] = min(dist[b][a], c);
}
for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
int ans = 1e18;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(dist[s][i] + dist[i][j] + dist[j][t] == dist[s][t] || dist[t][i] + dist[i][j] + dist[j][s] == dist[s][t])ans = min({ans, dist[u][i] + dist[v][j], dist[u][j] + dist[v][i]});
}
}
cout << ans;
}
main(){
ios::sync_with_stdio(0);cin.tie(0);
int tc = 1;
//cin >> tc;
for(int tc1=1;tc1<=tc;tc1++){
// cout << "Case #" << tc1 << ": ";
solve();
}
}
Compilation message (stderr)
commuter_pass.cpp:33:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
33 | main(){
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |