Cod sursa(job #2113857)

Utilizator MaaaaaCristina Ma Maaaaa Data 25 ianuarie 2018 10:20:04
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.54 kb
#include <fstream>
#include <vector>
#define inf 2000000000
#define nmax 50005
using namespace std;
fstream f1("bellmanford.in", ios::in);
fstream f2("bellmanford.out", ios::out);
int n, m, viz[nmax], nrit[nmax], prim, ultim, k, coada[nmax], d[nmax], ok;
vector <pair < int, int > > v[nmax];
void citire()
{
    int i, x, y, c;
    f1>>n>>m;
    for(i=1; i<=m; i++)
    {
        f1>>x>>y>>c;
        v[x].push_back(make_pair(y, c));
        ///v[y].push_back(make_pair(x, c));
    }
}
void bell()
{
    int i, nod, ct, vec;
    prim=ultim=k=1;
    coada[prim]=1;
    d[1]=0;
    viz[1]=1;

    for(i=2; i<=n; i++)
        d[i]=inf;
    ok=1;
    while((k!=0)&&(ok))
    {
        nod=coada[prim];
        viz[nod]=0;
        prim++;
        if(prim> nmax-3) prim=1;
        k--;
        for(auto it=v[nod].begin();(it!=v[nod].end())&&ok; ++it)
        {
            vec=(*it).first;
            ct=(*it).second;
            if(d[vec]> ct+d[nod])
            {
                d[vec]=ct+d[nod];
                if(!viz[vec])
                {
                    viz[vec]=1;
                    ultim++;
                    if(ultim> nmax-3) ultim=1;
                    k++;
                    coada[ultim]=vec;
                    nrit[vec]++;
                    if(nrit[vec]> n) ok=0;
                }
            }
        }
    }
    if(!ok) f2<<"Ciclu negativ!";
    else
    {
        for(i=2; i<=n; i++)
            f2<<d[i]<<' ';

    }
}
int main()
{
    citire();
    bell();
    return 0;
}