Cod sursa(job #3198941)

Utilizator GuessImHereNowAndy Coste GuessImHereNow Data 31 ianuarie 2024 10:06:50
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.21 kb
#include <bits/stdc++.h>

using namespace std;

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

int n,cost[1005][1005];

void roy_floyd()
{
    for(int k = 1 ; k <= n ; k++)
    {
        for(int i = 1 ; i <= n ; i++)
        {
            for(int j = 1 ; j <= n ; j++)
            {
                if(i != j && cost[i][k] != INT_MAX && cost[k][j] != INT_MAX)
                {
                    if(cost[i][k] + cost[k][j] < cost[i][j])
                    {
                        cost[i][j] = cost[i][k] + cost[k][j];
                    }
                }
                if(i == j)
                {
                    cost[i][j] = 0;
                }
            }
        }
    }
}

int main()
{
f >> n;
int x,y,cc;
        for(int i = 1 ; i <= n ; i++)
        {
            for(int j = 1 ; j <= n ; j++)
            {
                cost[i][j] = INT_MAX;
            }
        }
        while(f >> x >> y >> cc)
        {
            cost[x][y] = cc;
            cost[y][x] = cc;
        }

roy_floyd();
for(int i = 1 ; i <= n ; i++)
{
    for(int j = 1 ; j <= n ; j++)
    {
        o << cost[i][j] << " ";
    }
    o << '\n';
}

    return 0;
}