Pagini recente » Cod sursa (job #3123161) | Cod sursa (job #2861795) | Cod sursa (job #778348) | Cod sursa (job #2990050) | Cod sursa (job #2966757)
#include <fstream>
#include <vector>
#include <set>
#define DIM 50001
#define INF 1000000001
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,x,y,c,d[DIM];
vector<pair<int,int> > l[DIM];
set<pair<int,int> > s;
int main()
{
fin>>n>>m;
for (int i=1; i<=n; i++)
d[i]=INF;
d[1]=0;
for (int i=1; i<=m; i++)
{
fin>>x>>y>>c;
l[x].push_back(make_pair(y,c));
}
s.insert(make_pair(c,1));
while (!s.empty())
{
int nod=s.begin()->second;
s.erase(s.begin());
for (int i=0; i<l[nod].size(); i++)
{
int vec=l[nod][i].first;
int cost=l[nod][i].second;
if (d[nod]+cost<d[vec])
{
s.erase(make_pair(d[vec],vec));
d[vec]=d[nod]+cost;
s.insert(make_pair(d[vec],vec));
}
}
}
for (int i=2; i<=n; i++)
if (d[i]==INF)
fout<<"0 ";
else
fout<<d[i]<<" ";
return 0;
}