Cod sursa(job #2058290)

Utilizator silviuilasSilviu Ilas silviuilas Data 5 noiembrie 2017 14:01:01
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include <bits/stdc++.h>
#define pii pair<int,int>
#define mp make_pair
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int N = 50010;
const int oo = 2000000000;
int n,m,x,y,i,c,d[N],cst,vec;
bitset<N> viz;
vector<pii> v[N];
priority_queue<pii> q;
int main()
{
    f>>n>>m;
    for(; m; m--)
    {
        f>>x>>y>>c;
        v[x].push_back(make_pair(c,y));
    }
    for(i=2;i<=n;i++)
        d[i]=oo;
    q.push(make_pair(0,1));
    while(q.size())
    {
        tie(c,x)=q.top();c=-c;
        q.pop();
        if(viz[x])
            continue;
        viz[x]=1;
        for(auto it:v[x])
        {
            tie(cst,vec)=it;
            if(cst+c<d[vec])
            {
                d[vec]=cst+c;
                q.push(mp(-d[vec],vec));
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]==oo)
            d[i]=0;
        g<<d[i]<<' ';
    }
    return 0;
}