Cod sursa(job #3338845)

Utilizator CCCmanCiobanu Casian CCCman Data 5 februarie 2026 10:18:23
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.2 kb
#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
#define NMAX 50002
#define INF 1000000002

using namespace std;
ifstream fin ("bellmanford.in");
ofstream fout("bellmanford.out");

struct arc {int vf, c;} varf;
vector <arc> G[NMAX];
queue <int> C;
int n, m, start=1;
int cmin[NMAX];
int nr[NMAX];
bool circuitneg;

int main()
{
    int i, x, y, cost;
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y>>cost;
        varf.vf=y; varf.c=cost;
        G[x].push_back(varf);
    }

    x=0; y=0; cost=0;
    for (i=1; i<=n; i++) cmin[i]=INF;
    cmin[start]=0;
    C.push(start);
    while (!C.empty() && circuitneg==0)
    {
        x=C.front();
        C.pop();
        for (i=0; i<G[x].size(); i++)
        {
            y=G[x][i].vf;
            cost=G[x][i].c;
            if (cmin[y]>cmin[x]+cost)
            {
                cmin[y]=cmin[x]+cost;
                nr[y]++;
                if (nr[y]>n) circuitneg=1;
                else C.push(y);
            }
        }
    }
    if (circuitneg==1)  fout<<"Ciclu negativ!";
    else
        for (i=2; i<=n; i++)
            fout<<cmin[i]<<' ';
    fout<<'\n';

    return 0;
}