Cod sursa(job #2258850)

Utilizator NewGloryMihnea Andreescu NewGlory Data 12 octombrie 2018 11:51:59
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.14 kb
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=100+5;

int n,dp[N][N];

int main()
{
    ios_base::sync_with_stdio(0); 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>>dp[i][j];
            if(i!=j && dp[i][j]==0)
                dp[i][j]=(1<<29);
        }
    }
    for(int k=1;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                if(i==j || i==k || k==j)
                    continue;
                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(i==j)
                cout<<"0 ";
            else
            {
                if(dp[i][j]==(1<<29))
                    cout<<"0 ";
                else
                    cout<<dp[i][j]<<" ";
            }
        }
        cout<<"\n";
    }
    return 0;
}
/**

1
10 18 76

**/