Cod sursa(job #2344747)

Utilizator serbandonceanSerban Doncean serbandoncean Data 15 februarie 2019 16:14:08
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
#include <bits/stdc++.h>
#define DMAX 50003
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
vector<pair<int,int> >a[DMAX];
queue<int>coada;
int dist[DMAX],viz[DMAX];
void citire();
int n,m;
void bellman();
int main()
{
    citire();
    bellman();
    return 0;
}
void citire()
{int i,c,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        a[x].push_back(make_pair(y,c));


    }
    for(i=2;i<=n;i++)
        dist[i]=INT_MAX-3;

}
void bellman()
{int poz,y,c,i;
    coada.push(1);
    while(!coada.empty())
    {
        poz=coada.front();
        coada.pop();
        viz[poz]++;
        if(viz[poz]>n)
        {
            fout<<"Ciclu negativ";
            return ;
        }
        for(vector< pair<int,int> >::iterator it=a[poz].begin();it!=a[poz].end();it++)
        {
            y=it->first;
            c=it->second;
            if(dist[y]>dist[poz]+c)
                {dist[y]=dist[poz]+c;coada.push(y);}
        }
    }
    for(i=2;i<=n;i++)
        fout<<dist[i]<<' ';

}