Cod sursa(job #2343511)

Utilizator IulianOleniucIulian Oleniuc IulianOleniuc Data 14 februarie 2019 08:12:02
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.01 kb
#include <climits>
#include <fstream>

#define DMAX 110

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

int n;
int dp[DMAX][DMAX];

inline int min(int x, int y) {
    return x < y ? x : y;
}

int main() {
    int cost;

    fin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            fin >> cost;
            dp[i][j] = cost;

            if (!dp[i][j])
                dp[i][j] = INT_MAX;
        }

    for (int k = 1; k <= n; k++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                if (i != j)
                    if (dp[i][k] != INT_MAX && dp[k][j] != INT_MAX)
                        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++)
            if (i == j)
                fout << "0 ";
            else
                fout << dp[i][j] << ' ';
        fout << '\n';
    }

    fout.close();
    return 0;
}