Cod sursa(job #1123173)

Utilizator 4afterfunDocTordoi 4afterfun Data 25 februarie 2014 23:10:46
Problema Algoritmul Bellman-Ford Scor 15
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <fstream>
#define inf 0x3f3f3f3f

using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
struct muchie{int x,y,c;}v[250001];
int i,m,n,x,y,c,ok,d[50001];

int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>c;
        v[i].x=x;
        v[i].y=y;
        v[i].c=c;
        if(x==1)
            d[y]=c;
    }
    for(i=2;i<=n;i++)
        if(d[i]==0)
        d[i]=inf;
    do{
        ok=1;
        for(i=1;i<=m;i++)
            if(d[v[i].y]>d[v[i].x]+v[i].c)
        {
            d[v[i].y]=d[v[i].x]+v[i].c;
            ok=0;
        }

    }while(!ok);
    for(i=2;i<=n;i++)
    {
        if(d[i]!=inf)
            g<<d[i]<<" ";
        else
            g<<0<<" ";
    }




}