Cod sursa(job #2964904)

Utilizator hhhhhhhAndrei Boaca hhhhhhh Data 14 ianuarie 2023 09:38:26
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.24 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
typedef pair<int,int> pii;
const int INF=1e9;
int n,m;
vector<pii> muchii[50005];
int dist[50005];
int cnt[50005];
set<pii> coada;
void bellman()
{
    for(int i=2;i<=n;i++)
        dist[i]=INF;
    dist[1]=0;
    coada.insert({0,1});
    while(!coada.empty())
    {
        auto it=coada.begin();
        int nod=(*it).second;
        coada.erase(it);
        cnt[nod]++;
        if(cnt[nod]>n)
        {
            fout<<"Ciclu negativ!";
            exit(0);
        }
        for(auto i:muchii[nod])
            if(dist[i.first]>dist[nod]+i.second)
            {
                if(coada.find({dist[i.first],i.first})!=coada.end())
                    coada.erase({dist[i.first],i.first});
                dist[i.first]=dist[nod]+i.second;
                coada.insert({dist[i.first],i.first});
            }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(0);
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        muchii[a].push_back({b,c});
    }
    bellman();
    for(int i=2;i<=n;i++)
        fout<<dist[i]<<' ';
    return 0;
}