Pagini recente » Cod sursa (job #2562431) | Cod sursa (job #2158466) | Cod sursa (job #675099) | Cod sursa (job #777054) | Cod sursa (job #1990983)
#include <fstream>
#include <vector>
#include <set>
#define DIM 50001
#define INF 2000000000
using namespace std;
ifstream fi("dijkstra.in");
ofstream fo("dijkstra.out");
int n,m;
vector<pair<int,int> > V[DIM];
set<pair<int,int> > S;
int D[DIM];
int main()
{
fi>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y,c;
fi>>x>>y>>c;
V[x].push_back(make_pair(y,c));
}
for(int i=1;i<=n;i++)
D[i]=INF;
D[1]=0;
S.insert(make_pair(0,1));
while(!S.empty())
{
int v=S.begin()->second,d=S.begin()->first;
S.erase(S.begin());
for(int i=0;i<V[v].size();i++)
{
int v1=V[v][i].first,c=V[v][i].second;
if(D[v1]>D[v]+c)
{
if(D[v1]!=INF)
S.erase(S.find(make_pair(D[v1],v1)));
D[v1]=D[v]+c;
S.insert(make_pair(D[v1],v1));
}
}
}
for(int i=2;i<=n;i++)
if(D[i]==INF)
fo<<"0 ";
else
fo<<D[i]<<" ";
fi.close();
fo.close();
return 0;
}