Cod sursa(job #2974776)

Utilizator 100pCiornei Stefan 100p Data 4 februarie 2023 16:57:43
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.07 kb
#include <bits/stdc++.h>

#define MAX 100
#define FILES freopen("royfloyd.in","r",stdin);\
              freopen("royfloyd.out","w",stdout);

using namespace std;

int dp[MAX + 5][MAX + 5], n, cost[MAX + 5][MAX + 5];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    FILES
    std::cin >> n;
    for(int i = 1;i <= n; ++i)
        for(int j = 1;j <= n; ++j)
            std::cin >> cost[i][j], dp[i][j] = cost[i][j];
    for(int i = 1;i <= n; ++i)
    {
        for(int j = 1;j <= n; ++j)
        {
            if(cost[i][j] == 0 && i != j)
                dp[i][j] = 1e9;
        }
    }
    for(int i = 1;i <= n; ++i)
    {
        for(int j = 1;j <= n; ++j)
        {
            for(int k = 1; k <= n; ++k){
                if(dp[j][i] != 1e9 && dp[i][k] != 1e9)
                    dp[j][k] = min(dp[j][k], dp[j][i] + dp[i][k]);
            }
        }
    }
    for(int i = 1;i <= n; ++i)
    {
        for(int j = 1;j <= n; ++j)
            std::cout << dp[i][j] << ' ';
        std::cout << '\n';
    }
}