Cod sursa(job #962260)

Utilizator timicsIoana Tamas timics Data 14 iunie 2013 11:02:30
Problema Algoritmul Bellman-Ford Scor 65
Compilator cpp Status done
Runda Arhiva educationala Marime 1.04 kb
#include<stdio.h>
#include<vector>
#define inf 1000000000
using namespace std;
int M,N,x,y,c,dist[55000];

struct muchie
{
    int nod1;
    int nod2;
    int cost;
} m[255000];

int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    scanf("%d%d",&N,&M);
    for(int i=1;i<=M;++i)
    {
        scanf("%d%d%d",&x,&y,&c);
        m[i].nod1=x;
        m[i].nod2=y;
        m[i].cost=c;
    }

    for(int i=2;i<=N;++i)
        dist[i]=inf;

    for(int j=1;j<N;++j)
    {
        int ok=0;
        for(int i=1;i<=M;++i)
            if(dist[m[i].nod1]+m[i].cost<dist[m[i].nod2])
            {
                ok=1;
                dist[m[i].nod2]=dist[m[i].nod1]+m[i].cost;
            }
        if(ok==0)
            break;
    }

    for(int i=1;i<=M;++i)
        if(dist[m[i].nod1]+m[i].cost<dist[m[i].nod2])
        {
            printf("Ciclu negativ!");
            return 0;
        }

    for(int i=2;i<=N;++i)
        printf("%d ",dist[i]);
    return 0;
}