Cod sursa(job #2095630)

Utilizator remus88Neatu Remus Mihai remus88 Data 27 decembrie 2017 20:39:42
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <fstream>
#include <vector>
#define Nmax 109
#define INF 2^30

using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int n,m,c[Nmax][Nmax],d[Nmax][Nmax];

void RoyFloyd() {

    for (int i=1; i<=n; ++i)
        for (int j=1; j<=n; ++j)
            if (!c[i][j])
                d[i][j]=0;
            else d[i][j]=c[i][j];
    for (int k=1; k<=n; ++k)
        for (int i=1; i<=n; ++i)
            for (int j=1; j<=n; ++j)
                if (c[i][k] && c[k][j] && d[i][k]+d[k][j]<d[i][j])
                    d[i][j]=d[i][k]+d[k][j];
}

int main() {

    f>>n;
    for (int i=1; i<=n; ++i)
        for (int j=1; j<=n; ++j)
            f>>c[i][j];

    RoyFloyd();
    for (int i=1; i<=n; ++i) {
        for (int j=1; j<=n; ++j)
            g<<d[i][j]<<' ';
        g<<'\n';
    }
}