baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2025-01-11 18:51:59 +00:00
Code Releases Activity

P6464 传送门

Browse Source 
R57865403
This commit is contained in:
Baoshuo Ren 2021-09-12 09:02:14 +08:00 committed by Baoshuo Ren
parent a9316b1655
commit 9028389fab
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 54 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

54
Luogu/problem/P6464/P6464.cpp Normal file
View File

@ -0,0 +1,54 @@
#include <bits/stdc++.h>
using namespace std;
int n, m, u, v, w, g[105][105], f[105][105], sum, ans = 0x3f3f3f3f;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
g[i][j] = i == j ? 0 : 0x3f3f3f3f;
}
}
for (int i = 1; i <= m; i++) {
cin >> u >> v >> w;
g[u][v] = g[v][u] = w;
}
for (int k = 1; k <= n; k++) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
f[i][j] = g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j < i; j++) {
for (int k = 1; k <= n; k++) {
for (int l = 1; l <= n; l++) {
f[k][l] = g[k][l];
}
}
f[i][j] = f[j][i] = 0;
for (int k = 1; k <= n; k++) {
for (int l = 1; l <= n; l++) {
f[k][l] = min(f[k][l], f[k][i] + f[i][l]);
}
}
for (int k = 1; k <= n; k++) {
for (int l = 1; l <= n; l++) {
f[k][l] = min(f[k][l], f[k][j] + f[j][l]);
}
}
sum = 0;
for (int k = 1; k <= n; k++) {
for (int l = 1; l < k; l++) {
sum += f[k][l];
}
}
ans = min(ans, sum);
}
}
cout << ans << endl;
return 0;
}