#include <bits/stdc++.h>
using namespace std;
const int mxN=700;
int n, m, k, a, b, d[mxN][mxN], ui, vi;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> k >> a >> b, --k;
memset(d, 0x3f, sizeof(d));
while(m--) {
cin >> ui >> vi, --ui, --vi;
d[ui][vi]=d[vi][ui]=a;
}
for(int i=0; i<n; ++i)
for(int j=0; j<n; ++j)
if(d[i][j]==a)
for(int k=0; k<n; ++k)
if(d[j][k]==a&&d[i][k]!=a)
d[i][k]=-1;
for(int i=0; i<n; ++i)
for(int j=0; j<n; ++j)
if(d[i][j]==-1)
d[i][j]=b;
d[k][k]=0;
for(int k=0; k<n; ++k)
for(int i=0; i<n; ++i)
for(int j=0; j<n; ++j)
d[i][j]=min(d[i][k]+d[k][j], d[i][j]);
for(int i=0; i<n; ++i)
cout << d[k][i] << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2296 KB |
Output is correct |
2 |
Correct |
3 ms |
2300 KB |
Output is correct |
3 |
Correct |
3 ms |
2364 KB |
Output is correct |
4 |
Correct |
3 ms |
2408 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
2456 KB |
Output is correct |
2 |
Correct |
4 ms |
2468 KB |
Output is correct |
3 |
Correct |
4 ms |
2472 KB |
Output is correct |
4 |
Correct |
4 ms |
2496 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
209 ms |
2528 KB |
Output is correct |
2 |
Correct |
222 ms |
2656 KB |
Output is correct |
3 |
Correct |
219 ms |
2668 KB |
Output is correct |
4 |
Correct |
207 ms |
2668 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
4604 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
4668 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
5 ms |
4728 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
4860 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
4860 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
4860 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
4860 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |