Cod sursa(job #1110775)

Utilizator thesvcoolmanLucian Bicsi thesvcoolman Data 18 februarie 2014 13:11:05
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 1.32 kb
#include<fstream>
#include<vector>
#include<deque>

#define INF 20000000


using namespace std;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
struct muchie {int val,vec;};

int q[200000];
vector<muchie> L[50001];
int n,m,i,x,nrviz[50001],cost[50001],start;
muchie y;
bool inq[50001];

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x;
        fin>>y.vec>>y.val;
        L[x].push_back(y);
    }
    start=1;

    for(i=1;i<start;i++) cost[i]=INF;
    for(i++;i<=n;i++) cost[i]=INF;

    q[1]=start;
    nrviz[start]++;inq[start]=true;
    int l;
    int inc=1,sf=1;
    while(inc<=sf)
    {
        for(l=0;l<L[q[inc]].size();l++)
            if(cost[L[q[inc]][l].vec]>cost[q[inc]]+L[q[inc]][l].val)
            {
                cost[L[q[inc]][l].vec]=cost[q[inc]]+L[q[inc]][l].val;
                if(!inq[L[q[inc]][l].vec])
                {
                    q[++sf]=L[q[inc]][l].vec;
                    inq[L[q[inc]][l].vec]=true;
                    nrviz[L[q[inc]][l].vec]++;
                    if(nrviz[L[q[inc]][l].vec]>=n)
                        {fout<<"Ciclu negativ!";return 0;}
                }
            }
        inq[q[inc]]=false;
        inc++;
    }

    for(i=2;i<=n;i++)
        fout<<cost[i]<<" ";

    return 0;
}