Cod sursa(job #2023584)

Utilizator proflaurianPanaete Adrian proflaurian Data 19 septembrie 2017 09:47:19
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <bits/stdc++.h>
#define vec it.first
#define cst (c+it.second)
#define PII pair<int,int>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int N=50010,oo=1000000000;
vector<PII > v[N];
priority_queue<PII > q;
int n,m,a,b,c,i,d[N];
bitset<N> viz;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        f>>a>>b>>c;
        v[a].push_back({b,c});
    }
    for(i=2;i<=n;i++)d[i]=oo;
    q.push({0,1});
    while(q.size())
    {
        tie(c,a)=q.top();
        c=-c;
        q.pop();
        if(viz[a])continue;
        viz[a]=1;
        for(auto it:v[a])
            if(d[vec]>cst)
            {
                d[vec]=cst;
                q.push({-d[vec],vec});
            }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]==oo)g<<"0 ";
        else g<<d[i]<<' ';
    }

    return 0;
}