Cod sursa(job #2408219)

Utilizator flaviu_2001Craciun Ioan-Flaviu flaviu_2001 Data 17 aprilie 2019 18:49:44
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <bits/stdc++.h>
#define ff first
#define ss second

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;

const string file = "royfloyd";
const ll INF = 9223372036854775807ll;
const int inf = 2147483647;

int n, v[105][105];

int main()
{
    ifstream fin (file+".in");
    ofstream fout (file+".out");
    fin >> n;
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            fin >> v[i][j];
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                if(v[i][k] && v[k][j] && (v[i][j] > v[i][k]+v[k][j] || !v[i][j]))
                    v[i][j] = v[i][k]+v[k][j];
    for (int i = 1; i <= n; ++i, fout << "\n")
        for (int j = 1; j <= n; ++j)
            fout << v[i][j] << " ";
    return 0;
}