Cod sursa(job #905560)

Utilizator SPDionisSpinei Dionis SPDionis Data 5 martie 2013 22:02:03
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <fstream>
#include <vector>

const int Maxn = 105;
const int inf = 1e9;

std::ifstream in("grader_test2.in");
std::ofstream out("royfloyd.out");
using std::vector;

int N;
int a[Maxn][Maxn];
int dist[Maxn][Maxn];

int main()
{
    in >> N;

    for (int i = 0; i < N; ++i)
        for (int j = 0; j < N; ++j)
        in >> a[i][j];


    for (int k = 0; k < N; ++k)
        for (int i = 0; i < N; ++i)
        for (int j = 0; j < N; ++j)
        if ( (a[i][k] + a[k][j] < a[i][j] || !a[i][j]) && a[i][k] && a[k][j] && i != j)
             a[i][j] = a[i][k] + a[k][j];


    for (int i = 0; i < N; ++i) {
            if (i) out << '\n';
        for (int j = 0; j < N; ++j)
            out << a[i][j] << " ";
    }

    in.close();
    out.close();
    return 0;
}