제출 #91253

#제출 시각아이디문제언어결과실행 시간메모리
91253tmwilliamlin168새로운 문제 (POI13_cen)C++14
30 / 100
238 ms4800 KiB
#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]=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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...