Cod sursa(job #2551242)

Utilizator vaidaoctavVaida Octav vaidaoctav Data 19 februarie 2020 18:11:35
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <bits/stdc++.h>
#define Inf 1000000
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
vector<tuple<int,int,int>>v;
int dis[50010],n,m;
bool ok;
void citire()
{
    int a,b,w;
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        f>>a>>b>>w;
        v.push_back(make_tuple(a,b,w));
    }
}
void bf()
{
    for(int i=1;i<=n;i++)
        dis[i]=Inf;
        dis[1]=0;
    for(int i=1;i<=n;i++)
    {
        for(auto u:v)
        {
            int a,b,w;
            tie(a,b,w)=u;
            if(i==n)
            {
                if(dis[b]>dis[a]+w)
                    ok=true;
            }
            dis[b]=min(dis[b],dis[a]+w);
        }
    }
}
int main()
{
    citire();
    bf();
    if(ok==true)
        g<<"Ciclu negativ!";
    else
        for(int i=2;i<=n;i++)
            g<<dis[i]<<" ";
    return 0;
}