Cod sursa(job #2332974)

Utilizator RaduMirceaAndreiRadu Mircea Andrei RaduMirceaAndrei Data 31 ianuarie 2019 15:45:02
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.23 kb
# include <fstream>
# include <vector>
# include <set>
# define DIM 50010
# define INF 1000000000
# define f first
# define s second
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector<pair<int,int> > Lista[DIM];
multiset<pair<int,int> > myset;
multiset<pair<int,int> >::iterator it;
int Marcat[DIM],d[DIM],n,m,x,y,i,j,nc,nv,cost;
int main () {
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>cost;
        Lista[x].push_back(make_pair(y,cost));
    }
    d[1]=0;
    myset.insert(make_pair(d[1],1));
    for(i=2;i<=n;i++){
        d[i]=INF;
        myset.insert(make_pair(d[i],i));
    }
    j=0;
    for(;j<n;){
        it=myset.begin();
        nc=it->s;
        myset.erase(it);
        if(Marcat[nc]==1)
            continue;
        Marcat[nc]=1;
        j++;
        for(i=0;i<Lista[nc].size();i++){
            nv=Lista[nc][i].f;
            cost=Lista[nc][i].s;
            if(Marcat[nv]==0&&d[nv]>d[nc]+cost){
                d[nv]=d[nc]+cost;
                myset.insert(make_pair(d[nv],nv));
            }
        }
    }
    for(i=2;i<=n;i++)
        if(d[i]==INF)
            fout<<"0 ";
        else
            fout<<d[i]<<" ";
    return 0;
}