Pagini recente » Cod sursa (job #1462340) | Cod sursa (job #1384798) | Cod sursa (job #129077) | Monitorul de evaluare | Cod sursa (job #2023584)
#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;
}