Cod sursa(job #2572244)

Utilizator IulianOleniucIulian Oleniuc IulianOleniuc Data 5 martie 2020 12:15:48
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda OJI 2020 Marime 0.73 kb
#include <bits/stdc++.h>
using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int main() {
    int n; fin >> n;
    vector<vector<int>> dp(n + 1, vector<int>(n + 1));

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            fin >> dp[i][j];
            if (!dp[i][j] && i != j)
                dp[i][j] = 1e9;
        }

    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) 
            fout << (dp[i][j] == 1e9 ? 0 : dp[i][j]) << ' ';
        fout << '\n';
    }

    fout.close();
    return 0;
}