代码如下（样例没过）：

#include <bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
const int maxn = 510;
// dis 注意初始化为 inf 再存储边权
ll dis[maxn][maxn];
int n;
void floyd()
{
    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]);
            }
        }
    }
}
signed main()
{
    memset(dis, 0x3f, sizeof(dis));
    int m, u, v, w;
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
        dis[i][i] = 0;
    for (int i = 0; i < m; ++i)
    {
        cin >> u >> v >> w;
        dis[u][v] = min(dis[u][v], w);
    }
    floyd();
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
            cout << dis[i][j] << " ";
        cout << endl;
    }
    return 0;
}

我太弱了，橙题甚至还是模板都过不了 /kel