Cod sursa(job #1124902)

Utilizator IliescuDanAndreiIliescu Dan Andrei IliescuDanAndrei Data 26 februarie 2014 14:20:42
Problema Floyd-Warshall/Roy-Floyd Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream in("royfloyd.in");
ofstream out("royfloyd.out");

int graf[1000][1000][2];
int n;

int main()
{
    int i, j, k, l=0;
    in>>n;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            in>>graf[i][j][0];
        }
    }
    for(k=1;k<=n;k++)
    {
        l=1-l;
        for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++)
            {
                graf[i][j][l]=graf[i][j][1-l];
                if(graf[i][k][1-l]+graf[k][j][1-l]<graf[i][j][l] || !graf[i][j][l] && i!=j) graf[i][j][l]=graf[i][k][1-l]+graf[k][j][1-l];
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            out<<graf[i][j][l]<<" ";
        }
        out<<"\n";
    }
    return 0;
}