Cod sursa(job #2355628)

Utilizator capmareAlexCapmare Alex capmareAlex Data 26 februarie 2019 10:47:35
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.02 kb
#include <bits/stdc++.h>
#define NMAX 50001
#define inf 2000000000
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int cost[NMAX];
int fr[NMAX];
int N,M;
vector<pair<int, int> >v[NMAX];
queue< int >q;
int ver[NMAX];
int main()
{
    fin>>N>>M;
    for(int i=1;i<=M;++i)
    {
        int x,y,c;
        fin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));

    }
    cost[1]=0;
    for(int i=2;i<=N;++i)cost[i]=inf;
    fr[1]=1;
    q.push(1);
    while(!q.empty())
    {
        int r=q.front();

        q.pop();
        fr[r]=0;
        ++ver[r];
        if(ver[r]>N)
        {
            fout<<"Ciclu negativ!";
            return 0;
        }
        for(auto x: v[r])
        {

            if(cost[x.first]>cost[r]+x.second)
            {

                cost[x.first]=cost[r]+x.second;
                if(fr[x.first]==0)q.push(x.first),fr[x.first]=1;
            }
        }
    }
    for(int i=2;i<=N;++i,fout<<" ")fout<<cost[i];
    return 0;
}