Cod sursa(job #2937355)

Utilizator IanisBelu Ianis Ianis Data 10 noiembrie 2022 11:01:13
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.99 kb
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
ifstream fin("input.txt");
#define fout cout
#else
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
#endif

const int INF = 2e9;
const int NMAX = 105;

int n;
int a[NMAX][NMAX];
int dist[NMAX][NMAX];

void solve() {
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            dist[i][j] = a[i][j] ? a[i][j] : INF;
    for (int v = 1; v <= n; v++)
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                if (a[i][v] && a[v][j] && dist[v][j] != INF && dist[i][v] != INF)
                    dist[i][j] = min(dist[i][j], dist[i][v] + dist[v][j]);
}

int main() {
    fin >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            fin >> a[i][j];
    solve();
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++)
            fout << dist[i][j] << ' ';
        fout << '\n';
    }
    return 0;
}