Pagini recente » Borderou de evaluare (job #2694310) | Borderou de evaluare (job #1606416) | Cod sursa (job #2844130)
#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <bitset>
#define INF 1000000001
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int N=5e4+1;
int n,m;
int d[N];
vector <pair<int,int>> succesori[N];
bitset <N> selectat;
priority_queue <pair<int,int>> h;
void dijkstra(int x0){
for(int i=1; i<=n; i++)
d[i]=INF;
d[x0]=0;
h.push({0,x0});
while(!h.empty()){
int x=h.top().second;
h.pop();
if(selectat[x])
continue;
selectat[x]=1;
for(auto p:succesori[x]){
int y=p.first;
int c=p.second;
if(d[x]+c<d[y]){
d[y]=d[x]+c;
h.push({-d[y],y});
}
}
}
}
int main()
{
f>>n>>m;
for(int i=1; i<=m; i++){
int x,y,c;
f>>x>>y>>c;
succesori[x].push_back({y,c});
}
dijkstra(1);
for(int i=2; i<=n; i++){
if(d[i]==INF)
d[i]=0;
g<<d[i]<<" ";
}
return 0;
}