Cod sursa(job #2425565)

Utilizator teodor.dumitrescuDumitrescu Teodor teodor.dumitrescu Data 24 mai 2019 21:41:01
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.13 kb
#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#include <tuple>

using namespace std;

vector <int> graf[50005];
int dist[50005];
vector <tuple<int,int,int> > muchii;
int main()
{
    ifstream in("bellmanford.in");
    ofstream out("bellmanford.out");
    int i,j,N,x,y,c,p=1,M;
    in>>N>>M;
    for(i=1;i<=M;i++)
    {
        in>>x>>y>>c;
        graf[x].push_back(y);
        muchii.push_back(make_tuple(x,y,c));
    }
    for(i=2;i<=N;i++)
        dist[i]=500005;
    for(i=1;i<=N-1;i++)
    {
        for(j=0;j<M;j++)
        {
            x=get<0>(muchii[j]);
            y=get<1>(muchii[j]);
            c=get<2>(muchii[j]);
            if(dist[y]>dist[x]+c)
                dist[y]=dist[x]+c;
        }
    }
    for(j=0;j<M;j++)
    {
        x=get<0>(muchii[j]);
        y=get<1>(muchii[j]);
        c=get<2>(muchii[j]);
        if(dist[y]>dist[x]+c)
        {
            p=0;
            dist[y]=dist[x]+c;
        }
    }
    if(p==0)
        out<<"Ciclu negativ!";
    else
    {
        for(i=2;i<=N;i++)
            out<<dist[i]<<" ";
    }
    return 0;
}