Cod sursa(job #2953187)

Utilizator raresmihociMihoci Rares raresmihoci Data 10 decembrie 2022 16:55:15
Problema Floyd-Warshall/Roy-Floyd Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.96 kb
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int n, m, a[101][101], x, y, cost;

const int INF = 0x3f3f3f3f;

int main()
{
    fin >> n;

    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            fin >> a[i][j];
        }
    }

    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y >> cost;
        a[x][y] = cost;
    }


    for(int k = 1; k <= n; k++)
    {
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                if((a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i != j)
                {
                    a[i][j] = a[i][k] + a[k][j];
                }
            }
        }
    }


    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= n; j++)
        {
            fout << a[i][j] << ' ';
        }
        fout << '\n';
    }

    return 0;
}