Cod sursa(job #3166462)

Utilizator stefanpiturStefan Alexandru Pitur stefanpitur Data 8 noiembrie 2023 19:36:44
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <iostream>
#include <fstream>
#include <climits>

using namespace std;

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

const int NMAX = 101;

int dp[NMAX][NMAX];

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

int main()
{
    int n, w;
    fin >> n;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++) {
            fin >> w;
            if (i != j && w == 0)
                w = INT_MAX;
            dp[i][j] = w;
        }

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

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++)
            fout << dp[i][j] << " ";
        fout << "\n";
    }
    return 0;
}