Cod sursa(job #3197127)

Utilizator Robert_NicuNicu Robert Cristian Robert_Nicu Data 25 ianuarie 2024 18:44:46
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.16 kb
#include <bits/stdc++.h>
#define DIM 100001
using namespace std;

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

int n, m, a, b, c, nod, ans;
int drum[DIM], cic_neg_cnt[DIM];
int i, j;
bool ok, in_q[DIM];
vector <pair <int, int> > G[DIM];
queue <int> q;

int main(){
    fin>>n>>m;
    for(i=1; i<=m; i++){
        fin>>a>>b>>c;
        G[a].push_back(make_pair(b, c));
    }
    for(i=2; i<=n; i++)
        drum[i]=DIM;
    q.push(1);
    in_q[1]=1;
    cic_neg_cnt[1]=1;
    while(!q.empty()){
        nod=q.front();
        q.pop();
        in_q[nod]=0;
        for(auto fiu:G[nod]){
            if(drum[fiu.first]>drum[nod]+fiu.second){
                drum[fiu.first]=drum[nod]+fiu.second;
                if(!in_q[fiu.first]){
                    q.push(fiu.first);
                    in_q[fiu.first]=1;
                    cic_neg_cnt[fiu.first]++;
                    if(cic_neg_cnt[fiu.first]>n){
                        fout<<"Ciclu negativ!";
                        return 0;
                    }
                }
            }
        }
    }
    for(i=2; i<=n; i++){
        fout<<drum[i]<<" ";
    }
}