Cod sursa(job #3210544)

Utilizator MerlinTheWizardMelvin Abibula MerlinTheWizard Data 6 martie 2024 16:48:32
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.05 kb
#include<bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

const int NMAX = 105, INF = 1e9 + 7;
int n, v[NMAX][NMAX];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    freopen("royfloyd.in", "r", stdin);
    freopen("royfloyd.out", "w", stdout);

    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            cin >> v[i][j];
            if(!v[i][j] && i != j)
                v[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 || v[i][k] == 0 || v[k][j] == 0)
                    continue;
                if(v[i][j] > v[i][k] + v[k][j])  
                    v[i][j] = v[i][k] + v[k][j];
            }
        }
    }

    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
            cout << v[i][j] << " ";
        cout << "\n";
    }
}