Cod sursa(job #1974312)

Utilizator gabrielinelusGabriel-Robert Inelus gabrielinelus Data 27 aprilie 2017 13:09:13
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <bits/stdc++.h>

using namespace std;
int DP[200][200];
const int INF = 0x3f3f3f3f;

int main()
{
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= N; ++j) {
            cin >> DP[i][j];
            if(DP[i][j] == 0)
                DP[i][j] = INF;
        }

    for(int k = 1; k <= N; ++k)
        for(int i = 1; i <= N; ++i)
            for(int j = 1; j <= N; ++j)
                if(i != j && j != k && i != k)
                DP[i][j] = min(DP[i][j], DP[i][k] + DP[k][j]);

    for(int i = 1; i <= N; ++i) {
        for(int j = 1; j <= N; ++j)
            if(DP[i][j] >= INF)
                    cout << "0 ";
                else
                    cout << DP[i][j] << " ";
        cout << "\n";
    }
    return 0;
}