Cod sursa(job #606390)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 4 august 2011 09:10:58
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include<fstream.h>
#define N 50001
#define M 1500000
typedef struct
{long u,v,e[M];}qu;
typedef struct nod
{long co,in;
struct nod *urm;}Nod;
Nod *g[N],*r;
qu q;
long m,d[N],c,n,i,j;

void aQ(qu &q,long x)
{q.e[q.v++]=x;}

long dQ(qu &q)
{q.u++;
return q.e[q.u-1];}

void push(Nod *&r,long x,long c)
{Nod *p=new Nod;
p->in=x,p->co=c,p->urm=r,r=p;}

int main()
{q.u=q.v=0;
ifstream f("bellmanford.in");
ofstream h("bellmanford.out");
f>>n>>m;
for(i=1;i<=n;i++)
     d[i]=N,g[i]=NULL;
while(m--)
     f>>i>>j>>c,push(g[i],j,c);
d[1]=0,aQ(q,1);
while(q.u<q.v)
     {j=dQ(q);
     for(r=g[j];r;r=r->urm)
     if(d[r->in]>d[j]+r->co)
            d[r->in]=d[j]+r->co,aQ(q,r->in);
     else
            if(d[r->in]>0&&d[j]<0)
                  {h<<"Ciclu negativ!";
                  return 0;}}
for(i=2;i<=n;i++)
if(d[i]>0)
     h<<d[i]%N<<" ";
else
     h<<d[i]<<" ";
return 0;}