Cod sursa(job #2723282)

Utilizator maria.rotaruMaria Rotaru maria.rotaru Data 13 martie 2021 20:33:40
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.47 kb
#include <fstream>
#include <vector>
#define NMAX 50000

using namespace std;

ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");

int n,m, coada[NMAX+1];
struct ura
{

    int nr, d;

} viz[NMAX+1];

vector < pair <int, int>> v[NMAX+1];
const int INF = 1000000000;


int main()
{
    cin>>n>>m;
    for (int i=1; i<=m; i++)
    {
        int n1,n2,c;
        cin>>n1>>n2>>c;
        v[n1].push_back({n2,c});
    }

     for (int i=1; i<=n; i++)
        viz[i].d=INF;
    viz[1].d=0;
    viz[1].nr=1;
    int inc=1;
    int sf=1;
    coada[inc]=1;
    while (inc<=sf)
    {
        int nod = coada[inc];
        for (int i=0; i<v[nod].size(); i++)
        {
            if (viz[v[nod][i].first].d==INF)
            {
                coada[++sf] = v[nod][i].first;
                viz[v[nod][i].first].nr = viz[coada[inc]].nr++;
            }

            if (viz[v[nod][i].first].d > viz[coada[inc]].d + v[nod][i].second)
            {
                 viz[v[nod][i].first].d = viz[coada[inc]].d + v[nod][i].second;
                 viz[v[nod][i].first].nr = viz[coada[inc]].nr++;
            }

            if (viz[v[nod][i].first].nr==n && viz[v[nod][i].first].d<0)
            {
                cout<<"Ciclu negativ";
                return 0;
            }


        }

        inc++;
    }

    for (int i=1; i<=n; i++)
        if (viz[i].d!=INF && viz[i].d!=0)
            cout<<viz[i].d<<" ";

    return 0;
}