Cod sursa(job #1936624)

Utilizator GeorgeCalinPetruta George-Calin GeorgeCalin Data 23 martie 2017 11:27:50
Problema Algoritmul lui Dijkstra Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 1.25 kb
#include <fstream>
#include <climits>
#include <vector>
#include <bitset>
#include <set>
#define mp make_pair
#define NMAX 50002
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct NOD{
    int v,c;
};
vector <NOD> graf[NMAX];
int dist[NMAX];
bitset <NMAX> viz;

int main()
{
    int n,m,x,y,c1;
    fin>>n>>m;
    for(int i=2;i<=n;i++)
    {
        dist[i]=INT_MAX;
    }
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c1;
        NOD nod;
        nod.v=y;
        nod.c=c1;
        graf[x].push_back(nod);
    }
    dist[1]=0;
    viz[1]=1;
    set <pair<int,int> > nod;
    nod.insert(mp(0,1));
    while(!nod.empty())
    {
        int k=nod.begin() -> second;
        nod.erase(nod.begin());
        for(int i=0;i<graf[k].size();i++)
        {
            int s=graf[k][i].c;
            if(dist[graf[k][i].v]>s+dist[k])
            {
                dist[graf[k][i].v]=s+dist[k];
                nod.insert(mp(dist[graf[k][i].v],graf[k][i].v));
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(dist[i]!=INT_MAX)
        {
            fout<<dist[i]<<" ";
        }
        else
        {
            fout<<0<<" ";
        }
    }
    return 0;
}