Cod sursa(job #2325193)

Utilizator RaduMirceaAndreiRadu Mircea Andrei RaduMirceaAndrei Data 22 ianuarie 2019 10:58:19
Problema Algoritmul lui Dijkstra Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.21 kb
# include <fstream>
# include <vector>
# include <set>
# define DIM 105
# 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<=n;i++){
        fin>>x>>y>>cost;
        Lista[x].push_back(make_pair(y,cost));
        Lista[y].push_back(make_pair(x,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));
    }
    for(j=1;j<=n;j++){
        it=myset.begin();
        nc=it->s;
        myset.erase(it);
        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){
                it=myset.find(make_pair(d[nv],nv));
                myset.erase(it);
                d[nv]=d[nc]+cost;
                myset.insert(make_pair(d[nv],nv));
            }
        }
    }
    for(i=2;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}