Cod sursa(job #3258918)

Utilizator davidpandele0Pandele David davidpandele0 Data 24 noiembrie 2024 12:35:51
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.28 kb
#include <iostream>
#include<fstream>
#include<vector>
#include<climits>

using namespace std;

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


void citire(int& n, vector<vector<int>>& d)
{
    fin >> n;
    d.resize(n);
    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < n; ++j)
        {
            fin >> d[i][j];
            if(d[i][j] == 0 && i != j)
            {
                d[i][j] = INT_MAX;
            }
        }
    }
}

void roy(int n, vector<vector<int>>& d)
{
    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] != INT_MAX && d[k][j] != INT_MAX)
                {
                    d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
                }
            }
        }
    }
}

void afisare(int n, vector<vector<int>>& d)
{
    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < n; j++)
        {
            if(d[i][j] == INT_MAX)
                fout << "0 ";
            else
                fout << d[i][j] << ' ';
        }
        fout << "\n";
    }
}

int main()
{
    vector<vector<int>>d;
    int n;
    citire(n, d);
    roy(n, d);
    afisare(n, d);
    return 0;
}