Cod sursa(job #2777361)

Utilizator radu.Radu Cristi radu. Data 23 septembrie 2021 09:25:00
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.1 kb
#include <iostream>
#include <fstream>
#define NMAX 105
#define INF 999999999
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int d[NMAX][NMAX], N;
void read() {
    fin >> N;
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j) {
            fin >> d[i][j];
        }
    }
}
void royfloyd() {
    for (int k = 1; k <= N; ++k) {
        for (int i = 1; i <= N; ++i) {
            for (int j = 1; j <= N; ++j) {
                if (d[i][k] && d[k][j]) {
                    if (d[i][j]) {
                        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
                    }
                    else if (i != j){
                        d[i][j] = d[i][k] + d[k][j];
                    }
                }
                else {
                    d[i][j] = d[i][j];
                }
            }
        }
    }
}
int main()
{
    read();
    royfloyd();
    for (int i = 1; i <= N; ++i) {
        for (int j = 1; j <= N; ++j) {
            fout << d[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}