Cod sursa(job #2659457)

Utilizator Radu_FilipescuFilipescu Radu Radu_Filipescu Data 16 octombrie 2020 19:58:19
Problema Floyd-Warshall/Roy-Floyd Scor 10
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.15 kb
#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 105;
const int INF = 2000000001;

int N;
int Ad[NMAX][NMAX];
int best[NMAX][NMAX];

void Read()
{
    fin >> N;
    for( int i = 1; i <= N; ++i )
        for( int j = 1; j <= N; ++j )
            fin >> Ad[i][j];
}

void Do()
{
    for( int i = 1; i <= N; ++i )
        for( int j = 1; j <= N; ++j )
            best[i][j] = INF;

    for( int i = 1; i <= N; ++i )
        for( int j = 1; j <= N; ++j )
            if( Ad[i][j] ) best[i][j] = Ad[i][j];

    for( int i = 1; i <= N; ++i )
       for( int k = 1; k <= N; ++k )
            for( int j = 1; j <= N; ++j )
                if( i != j && j != k && i != j )
                    if( Ad[i][k] && Ad[k][j] && best[i][j] > Ad[i][k] + Ad[k][j] )
                       best[i][j] = Ad[i][k] + Ad[k][j];

    for( int i = 1; i <= N; ++i ) {
        for( int j = 1; j <= N; ++j )
            ( best[i][j] != INF ) ? fout << best[i][j] << ' ' : fout << "0 ";
        fout << '\n';
    }
}

int main()
{
    Read();
    Do();

    return 0;
}