Pagini recente » Cod sursa (job #2947261) | Cod sursa (job #694793) | Cod sursa (job #1606249) | Cod sursa (job #1040919) | Cod sursa (job #1700460)
#include <fstream>
#include<climits>
using namespace std;
ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");
int t[3][250001],start[250001],d[250001],coada[500001],viz[250001],n,m;
void citire ()
{
cin>>n>>m; int x;
for(int i=1;i<=m;i++)
{
cin>>x>>t[0][i]>>t[2][i];
t[1][i]=start[x]; start[x]=i;
}
}
void init ()
{
for(int i=2;i<=n;i++) d[i]=INT_MAX;
}
void ford ()
{
int pi=1,ps=1;
coada[pi]=1;
while(ps<=pi)
{ int nod=coada[ps]; viz[nod]=0;
int p=start[nod];
while(p!=0)
{
if(d[nod]+t[2][p]<d[t[0][p]])
{d[t[0][p]]=d[nod]+t[2][p];
if(viz[t[0][p]]==0)
{
viz[t[0][p]]=1; pi++; coada[pi]=t[0][p];
}
} p=t[1][p];
} ps++;
}
}
void scrie ()
{
for(int i=2;i<=n;i++) { if(d[i]==INT_MAX) d[i]=0; cout<<d[i]<<" ";}
}
int main()
{
citire();
init();
ford();
scrie();
cin.close();
cout.close();
return 0;
}