Pagini recente » Cod sursa (job #3209919) | Cod sursa (job #2863539) | Cod sursa (job #3226766) | Cod sursa (job #2447595) | Cod sursa (job #2488345)
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <utility>
#define NMAX 100000
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
struct cmp
{
bool operator () (pair <int,int>a,pair <int,int> b)
{
return a.second<b.second;
}
};
int n,m;
vector <pair <int,int>> v[NMAX];
vector <int> viz,res;
multiset <pair <int,int>,cmp> q;
void afis()
{
for(auto x:q)
cout<<x.first<<' '<<x.second<<" ; ";
cout<<'\n';
}
void dijkstra()
{
viz[0]=1;
for(auto x:v[0])
q.insert(make_pair(x.first,x.second));
while(!q.empty())
{
//afis();
pair <int,int> p=*q.begin();
q.erase(q.begin());
if(viz[p.first])
continue;
res[p.first]=p.second;
viz[p.first]=1;
for(auto x:v[p.first])
if(!viz[x.first] && (!res[x.first] || p.second+x.second<res[x.first]))
q.insert(make_pair(x.first,p.second+x.second));
}
}
int main()
{
f>>n>>m;
for(int i=0;i<n;++i)
{
viz.push_back(0);
res.push_back(0);
}
while(m--)
{
int x,y,z;
f>>x>>y>>z;;
v[x-1].push_back(make_pair(y-1,z));
}
dijkstra();
for(int i=1;i<n;++i)
g<<res[i]<<' ';
return 0;
}