Cod sursa(job #1635775)

Utilizator hackerliAndrei Ion hackerli Data 6 martie 2016 20:06:10
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 1.71 kb
#include <fstream>
#include <iostream>
#define inf 99999999
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
struct nod
{
    nod *next;
    int info, dist;
}*p[50001], *u[50001];
void adauga(nod *&p, nod *&u, int x, int dist)
{
    nod * c= new nod;
    c->info=x;
    c->dist=dist;
    c->next=0;
    if(p==0)
    {
        p=c;
        u=c;
    }
    else
    {
        u->next=c;
        u=c;
    }
}
int n, m, x, y, dist, d[50001];
int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        d[i]=inf;
    }
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>dist;
        adauga(p[x], u[x], y, dist);
    }
    for(nod *q=p[1]; q!=NULL; q=q->next)
    {
        d[q->info]=q->dist;
    }
    int ok=1, k=1;
    while(ok&&k<n)
    {
        ok=0;
        for(int i=2; i<=n; i++)
        {
            for(int j=2; j<=n; j++)
            {
                if(d[j]!=inf&&i!=j)
                {
                    for(nod *q=p[j]; q!=NULL; q=q->next)
                    {
                        if(q->info==i&&d[i]>d[j]+q->dist)
                        {
                            d[i]=d[j]+q->dist;
                            ok=1;
                        }
                    }
                }
            }
        }
        k++;
    }
    if(k>=n)
    {
        fout<<"Ciclu negativ!";
    }
    else
    {
        for(int i=2; i<=n; i++)
        {
            fout<<d[i]<<' ';
        }
    }
    fin.close();
    fout.close();
    return 0;
}
/*

5 10
2 5 3
3 4 13
5 3 -10
4 3 35
5 4 4
1 2 24
1 4 38
2 3 37
3 5 9
3 2 17

6 8
1 6 8
6 5 1
5 4 -1
4 3 -2
3 2 1
2 4 2
5 2 -4
1 2 10
*/