#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 305;
int dis[N][N];
signed main(){
ios::sync_with_stdio(0), cin.tie(0);
int n, m, s, f, l, r;
cin>>n>>m;
cin>>s>>f;
cin>>l>>r;
memset(dis, 63, sizeof dis);
for(int i=1; i<=n; i++)dis[i][i] = 0;
while(m--){
int x, y, z;
cin>>x>>y>>z;
dis[x][y] = min(dis[x][y], z);
dis[y][x] = min(dis[y][x], z);
}
for(int k=1; k<=n; k++){
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
}
}
}
int res = dis[l][r];
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
if(dis[s][i] + dis[i][j] + dis[j][f] == dis[s][f]){
res = min(res, dis[l][i] + dis[j][r]);
res = min(res, dis[l][j] + dis[i][r]);
}
}
}
cout<<res<<"\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
1876 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
1876 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
33 ms |
980 KB |
Output is correct |
2 |
Correct |
28 ms |
1056 KB |
Output is correct |
3 |
Correct |
29 ms |
1064 KB |
Output is correct |
4 |
Correct |
40 ms |
1780 KB |
Output is correct |
5 |
Correct |
32 ms |
1364 KB |
Output is correct |
6 |
Correct |
28 ms |
980 KB |
Output is correct |
7 |
Correct |
33 ms |
1068 KB |
Output is correct |
8 |
Correct |
29 ms |
1108 KB |
Output is correct |
9 |
Correct |
29 ms |
980 KB |
Output is correct |
10 |
Correct |
34 ms |
1364 KB |
Output is correct |
11 |
Correct |
28 ms |
976 KB |
Output is correct |
12 |
Correct |
29 ms |
1044 KB |
Output is correct |
13 |
Correct |
27 ms |
980 KB |
Output is correct |
14 |
Correct |
28 ms |
980 KB |
Output is correct |
15 |
Correct |
28 ms |
1108 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
2 ms |
1876 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |