Cod sursa(job #606381)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 4 august 2011 08:45:11
Problema Algoritmul Bellman-Ford Scor 85
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include<fstream.h>
#define N 50001
typedef struct
{long p,u,k,e[30*N];}qu;
typedef struct nod
{long co,in;
nod *urm;}Nod;
Nod *g[N],*r;
qu q;
long m,d[N],c,n,i,j,t,l;

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

long dQ(qu &q)
{q.k--,q.p++;
return q.e[q.p-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.k=q.p=q.u=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>>l>>j>>c,push(g[l],j,c);
d[1]=0,aQ(q,1);
while(q.k)
     {t=dQ(q);
     for(r=g[t];r;r=r->urm)
     if(d[r->in]>d[t]+r->co)
            d[r->in]=d[t]+r->co,aQ(q,r->in);
     else
            if(d[r->in]>0&&d[t]<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;}