#1 WA 求救 QWQ
查看原帖
#1 WA 求救 QWQ
1015482
huzixiao楼主2024/12/4 16:39
#include<iostream>
using namespace std;
int n, m;
int G[105][105];
const int MAXN = 1000000007;
int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) {
                G[i][j] = 0;
            }
            else {
                G[i][j] = MAXN;
            }
        }
    }
    while (m--) {
        int u, v, w;
        cin >> u >> v >> w;
        G[u][v] = G[v][u] = w;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            for (int k = 1; k <= n; k++) {
                G[j][k] = min(G[j][k], G[j][i] + G[i][k]);
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            cout << G[i][j] << " ";
        }
        cout << endl;
    }
    return 0;
}
2024/12/4 16:39
加载中...