Cod sursa(job #2433383)

Utilizator nicolaefilatNicolae Filat nicolaefilat Data 27 iunie 2019 10:24:49
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <iostream>
#include <fstream>

const int MAXN = 100 + 1,INF = 2e9;

using namespace std;

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

int n,matrice[MAXN][MAXN],dp[MAXN][MAXN];

int main()
{
    in>>n;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            in>>matrice[i][j];
            if(!matrice[i][j])
                dp[i][j] = INF;
            else
                dp[i][j] = matrice[i][j];
        }
    }
    for(int pivot = 1; pivot <= n; pivot++){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                if(dp[i][pivot] && dp[pivot][j] && i != j)
                    dp[i][j] = min(dp[i][j],dp[i][pivot] + dp[pivot][j]);
            }
        }
    }
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= n; j++){
            if(dp[i][j] == INF)
                dp[i][j] = 0;
            out<<dp[i][j]<<" ";
        }
        out<<"\n";
    }
    return 0;
}