Cod sursa(job #1306344)

Utilizator witselWitsel Andrei witsel Data 30 decembrie 2014 21:13:52
Problema Algoritmul lui Dijkstra Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include <iostream>
#include <fstream>
#include <vector>
#define grup pair<int,int>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int DIM=200000,inf=1<<30;
vector< pair<int,int> > v[DIM];
int N,M,d[DIM],poz[DIM],j,k;
void citire()
{
    int x,y,z;
    fin>>N>>M;
    while(M--)
    {
        fin>>x>>y>>z;
        v[x].push_back(make_pair(y,z));
    }
}
void dijkstra()
{
    for(int i=2;i<=N;++i)
        d[i]=inf;
    for(int i=1;i<=N;++i)
    {
        int min=inf,pmin;
        for(j=1;j<=N;++j)
            if(!poz[j] && min>d[j])
            min=d[j],pmin=j;
        poz[pmin]=1;
        for(k=0;k<v[pmin].size();++k)
        {

            if(d[v[pmin][k].first]>d[pmin]+v[pmin][k].second)
                d[v[pmin][k].first]=d[pmin]+v[pmin][k].second;

        }
    }
}
void afisare()
{
    for(int i=2;i<=N;++i)
        if(d[i]!=inf)
            fout<<d[i]<<" ";
        else
            fout<<0<<" ";

}
int main()
{

    citire();
    dijkstra();
    afisare();
    return 0;
}