Cod sursa(job #3125785)

Utilizator andreiiorgulescuandrei iorgulescu andreiiorgulescu Data 4 mai 2023 14:30:47
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.13 kb
#include <bits/stdc++.h>

using namespace std;

ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

int n,a[105][105],dp[105][105][105];
int inf = 1e9;

int main()
{
    in >> n;
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            in >> a[i][j];
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            for (int k = 0; k <= n; k++)
                dp[i][j][k] = inf;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            if (i == j)
                dp[i][j][0] = 0;
            else if (a[i][j] > 0)
                dp[i][j][0] = a[i][j];
        }
    }
    for (int k = 1; k <= n; k++)
    {
        for (int i = 1; i <= n; i++)
        {
            for (int j = 1; j <= n; j++)
            {
                dp[i][j][k] = min(dp[i][j][k - 1],dp[i][k][k - 1] + dp[k][j][k - 1]);
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= n; j++)
        {
            out << dp[i][j][n] % inf << ' ';
        }
        out << '\n';
    }
    return 0;
}