Pagini recente » Cod sursa (job #955737) | Cod sursa (job #579301) | Cod sursa (job #1596346) | Cod sursa (job #2319804) | Cod sursa (job #3237841)
#include <bits/stdc++.h>
#define NMAX 50001
#define MOD 2e9+10
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int dist[NMAX],n,m,x,y,c;
bool use[NMAX];
vector<pair<int,int>> v[NMAX];
set<pair<int,int>>q;
int main()
{
fin>>n>>m;
for(int i=1;i<=m;++i)
{
fin>>x>>y>>c;
v[x].push_back({c,y});
}
dist[1]=0;
for(int i=2;i<=n;++i)
dist[i]=MOD;
q.insert({0,1});
while(q.empty()==false)
{
x=q.begin()->second;
y=q.begin()->first;
q.erase(q.begin());
use[x]=1;
if(dist[x]>=y)
for(auto i:v[x])
if(use[i.second]==0)
{
if(dist[i.second]>dist[x]+i.first)
dist[i.second]=dist[x]+i.first;
q.insert({dist[i.second],i.second});
}
}
for(int i=2;i<=n;++i)
if(dist[i]==MOD)
fout<<"0 ";
else
fout<<dist[i]<<" ";
return 0;
}