Cod sursa(job #3302155)

Utilizator robigiirimias robert robigi Data 3 iulie 2025 20:48:36
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.26 kb
#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>

using namespace std;

int main()
{
    ifstream fin("royfloyd.in");
    ofstream fout("royfloyd.out");

    int n;
    fin >> n;

    vector<vector<int>> d(n, vector<int>(n, 1e9));

    for (int i = 0; i < n; ++i) 
    {
        for (int j = 0; j < n; ++j) 
        {
            fin >> d[i][j];
            if (d[i][j] == 0)
            {
                d[i][j] = 1e9; // No path
            }
            if (i == j) 
            {
                d[i][j] = 0; // Distance to self is zero
            }
        }
    }

    for (int k=0; k<n; ++k)
    {
        for (int i=0; i<n; ++i)
        {
            for (int j=0; j<n; ++j)
            {
                if (d[i][k] + d[k][j] < d[i][j])
                {
                    d[i][j] = d[i][k] + d[k][j];
                }
            }
        }
    }

    for (int i = 0; i < n; ++i) 
    {
        for (int j = 0; j < n; ++j) 
        {
            if (d[i][j] == 1e9) 
            {
                fout << "0 ";
            } 
            else 
            {
                fout << d[i][j] << " ";
            }
        }
        fout << endl;
    }


    return 0;
}