Cod sursa(job #1160155)

Utilizator sergiunascaSergiu Nasca sergiunasca Data 30 martie 2014 12:24:32
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <fstream>
#include <vector>
#include <bitset>
#define Nmax 101
#define INF 1<<30
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int n,x;
std::vector< int > a[Nmax];
void Roy_Floyd()
{
    for(int k=0;k<n;++k)
    {
        for(int i=0;i<n;++i)
        {
            for(int j=0;j<n;++j)
            {
                if((a[i][j] > a[i][k] + a[k][j] || !a[i][j]) && i!=j && a[i][k] && a[k][j])a[i][j] = a[i][k] + a[k][j];
            }
        }
    }
}
int main()
{
    fin>>n;
    for(int i=0;i<n;++i)
    {
        for(int j=1;j<=n;++j)
        {
            fin>>x;
            a[i].push_back(x);
        }
    }
    Roy_Floyd();
    for(int i=0;i<n;++i)
    {
        for(int j=0;j<n;++j)
        {
            if(a[i][j] == INF)fout<<"0 ";
            else fout<<a[i][j]<<" ";
        }
        fout<<'\n';
    }
    return 0;
}