Cod sursa(job #1713872)

Utilizator RaduMirceaAndreiRadu Mircea Andrei RaduMirceaAndrei Data 6 iunie 2016 20:28:28
Problema Algoritmul Bellman-Ford Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 1.05 kb
# include <fstream>
# include <vector>
# define DIM 50010
# define INF 1000000000
# define f first
# define s second
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
vector <pair<int,int> > Lista[DIM];
int Marcat[DIM],nr[DIM],d[DIM],c[DIM],n,m,i,x,y,cost,nc,nv,p,u;
int main () {
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>cost;
        Lista[x].push_back(make_pair(y,cost));
    }
    p=1;
    u=1;
    c[1]=1;
    for(i=2;i<=n;i++)
        d[i]=INF;
    while(p<=u){
        nc=c[p++];
        for(i=0;i<Lista[nc].size();i++){
            nv=Lista[nc][i].f;
            cost=Lista[nc][i].s;
            if(Marcat[nv]==0&&d[nc]+cost<d[nv]){
                d[nv]=d[nc]+cost;
                Marcat[nv]=1;
                c[++u]=nv;
            }
        }
        Marcat[nc]=0;
        nr[nc]++;
        if(nr[nc]>=n){
            fout<<"Ciclu negativ!\n";
            return 0;
        }
    }
    for(i=2;i<=n;i++)
        fout<<d[i]<<" ";
    fout<<"\n";
    return 0;
}