Cod sursa(job #3003574)

Utilizator gabriel.9619Gabriel Stefan Tita gabriel.9619 Data 15 martie 2023 20:02:09
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.29 kb
#include <fstream>
#include <deque>
#include <vector>
#define inf 100000000
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

struct muchie{
    int nod, cost;
};

deque <int> dq;
vector <muchie> l[50001];
int d[50001], viz[50001], ap[50001];

int main()
{
    int n, m, i, x, y, c;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        l[x].push_back({y, c});
    }
    for(i=2;i<=n;i++)
    {
        d[i]=inf;
    }
    d[1]=0;
    ap[1]++;
    viz[1]=1;
    dq.push_back(1);
    while(!dq.empty())
    {
        int nod=dq.front();
        dq.pop_front();
        viz[nod]=0;
        for(int i=0;i<l[nod].size();i++)
        {
            int vecin=l[nod][i].nod;
            int cost=l[nod][i].cost;
            if(d[vecin]>d[nod]+cost)
            {
                d[vecin]=d[nod]+cost;
                ap[vecin]++;
                if(viz[vecin]==0)
                {
                    dq.push_back(vecin);
                    viz[vecin]=1;
                }
                if(ap[vecin]>n)
                {
                    fout<<"Ciclu negativ!";
                    return 0;
                }
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        fout<<d[i]<<" ";
    }
}