Cod sursa(job #2658276)

Utilizator teisanumihai84Mihai Teisanu teisanumihai84 Data 13 octombrie 2020 17:07:10
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.18 kb
#include <fstream>
#include <vector>
#define dim 50001
#define inf 100000000
using namespace std;
ifstream fin ("bellmanford.in");
ofstream fout ("bellmanford.out");
int n, m, i, p, u, c[dim], d[dim], f[dim], viz[dim];
int x, y, z;
vector <pair <int, int > > L[dim];
int main()
{
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y>>z;
        L[x].push_back({y,z});
    }
    for (i=2; i<=n; i++)
        d[i]=inf;
    p=u=1;
    c[1]=1;
    while (p<=u)
    {
        int nod=c[p];
        viz[nod]=0;
        for (i=0; i<L[nod].size(); i++)
        {
            int vecin=L[nod][i].first;
            int cost=L[nod][i].second;
            if (d[vecin]>d[nod]+cost)
            {
                d[vecin]=d[nod]+cost;
                if (!viz[vecin])
                {
                    viz[vecin]=1;
                    c[++u]=vecin;
                    f[vecin]++;
                    if (f[vecin]==n)
                    {
                        fout<<"Ciclu negativ!";
                        return 0;
                    }
                }
            }
        }
        p++;
    }
    for (i=2; i<=n; i++)
        fout<<d[i]<<" ";
}