Cod sursa(job #1713881)

Utilizator RaduMirceaAndreiRadu Mircea Andrei RaduMirceaAndrei Data 6 iunie 2016 20:48:18
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.23 kb
# include <fstream>
# include <vector>
# include <deque>
# 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];
deque <int> c;
int Marcat[DIM],nr[DIM],d[DIM],n,m,i,x,y,cost,nc,nv;
int main () {
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>cost;
        Lista[x].push_back(make_pair(y,cost));
    }
    c.push_back(1);
    nr[1]=1;
    Marcat[1]=1;
    for(i=2;i<=n;i++)
        d[i]=INF;
    while(!c.empty()){
        nc=c.front();
        for(i=0;i<Lista[nc].size();i++){
            nv=Lista[nc][i].f;
            cost=Lista[nc][i].s;
            if(d[nc]+cost<d[nv]){
                d[nv]=d[nc]+cost;
                if(Marcat[nv]==0){
                    c.push_back(nv);
                    nr[nv]++;
                    Marcat[nv]=1;
                    if(nr[nv]==n){
                        fout<<"Ciclu negativ!\n";
                        return 0;
                    }
                }
            }
        }
        Marcat[nc]=0;
        c.pop_front();
    }
    for(i=2;i<=n;i++)
        fout<<d[i]<<" ";
    fout<<"\n";
    return 0;
}