Pagini recente » Cod sursa (job #1615914) | Cod sursa (job #1334900) | Cod sursa (job #1403731) | Cod sursa (job #2896956) | Cod sursa (job #3313948)
#include<fstream>
#include<vector>
#include<set>
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
vector<pair<unsigned short,int>> a[50001];
set<pair<int,int>> h;
int d[50001];
int main()
{
unsigned short n;
int m;
for(cin>>n>>m;m--;) {
int i,j,k;
cin>>i>>j>>k,a[i].push_back({j,k});
}
for(int i=2;i<=n;d[i]=2e9,h.insert({d[i],i}),++i);
for(h.insert({0,1});!h.empty();) {
int i=(*h.begin()).second;
h.erase(h.begin());
for(auto j:a[i])
if(d[j.first]>d[i]+j.second)
h.erase({d[j.first],j.first}),d[j.first]=d[i]+j.second,h.insert({d[j.first],j.first});
}
for(int i=2;i<=n;cout<<(d[i]==2e9?0:d[i])<<' ',++i);
return 0;
}