Pagini recente » Cod sursa (job #2553760) | Cod sursa (job #990720) | Cod sursa (job #872493) | Cod sursa (job #2664574) | Cod sursa (job #936422)
Cod sursa(job #936422)
#include<fstream>
#include<vector>
#include<set>
#define In "dijkstra.in"
#define Out "dijkstra.out"
#define Inf 2147483647
#define Nmax 50002
using namespace std;
int sol[Nmax],n;
vector<pair<int,int> >graf[Nmax];
multiset< pair<int,int> >S;
inline void Citire()
{
int x,y,c,m;
ifstream fin(In);
fin>>n>>m;
while(m--)
{
fin>>x>>y>>c;
graf[x].push_back(make_pair(c,y));
}
}
inline void Init()
{
for(int i=2;i<=n;i++)
sol[i] = Inf;
}
inline void Dijkstra()
{
pair<int,int> poz,vec;
S.insert(make_pair(0,1));
vector< pair<int,int> >::iterator it;
multiset< pair<int,int> >::iterator its;
while(!S.empty())
{
its = S.begin();
poz = *its;
S.erase(its);
for(it=graf[poz.second].begin();it!=graf[poz.second].end();it++)
{
vec = *it;
if(sol[vec.second]>sol[poz.second]+vec.first)
{
sol[vec.second] = sol[poz.second] + vec.first;
S.insert(vec);
}
}
}
}
inline void Afis()
{
ofstream fout(Out);
for(int i=2;i<=n;i++)
{
if(sol[i]==Inf)
fout<<"0 ";
else
fout<<sol[i]<<" ";
}
fout<<"\n";
fout.close();
}
int main()
{
Citire();
Init();
Dijkstra();
Afis();
return 0;
}