Cod sursa(job #2417814)

Utilizator ALEx6430Alecs Andru ALEx6430 Data 1 mai 2019 16:02:28
Problema Floyd-Warshall/Roy-Floyd Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.85 kb
#include <fstream>
#include <vector>
using namespace std;

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

int main()
{
    int n;
    in >> n;

    vector<vector<int>> v(n,vector<int>(n));

    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++) in >> v[i][j];

    vector<vector<int>> d(v);

    for(int i = 0; i < n; i++)
        for(int j = 0; j < n; j++)
            if(i != j)
                for(int k = 0; k < n; k++)
                {
                    if(d[i][k] && d[k][j]) d[i][j] = (d[i][j] == 0 ? d[i][k]+d[k][j] : min(d[i][j],d[i][k]+d[k][j]));
                    if(d[j][k] && d[k][i]) d[j][i] = (d[j][i] == 0 ? d[j][k]+d[k][i] : min(d[j][i],d[j][k]+d[k][i]));
                }

    for(int i = 0; i < n; i++, out << '\n')
        for(int j = 0; j < n; j++) out << d[i][j] << ' ';

    return 0;
}