Pagini recente » Cod sursa (job #652929) | Cod sursa (job #3267256) | Cod sursa (job #1408075) | Cod sursa (job #1531088) | Cod sursa (job #2718691)
#include<fstream>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int inf=2000000;
int a[250001][4],rez[50001],n,ok=1,i,x,y,z,m;
int main()
{
f>>n>>m;
int nr=1;
for(i=1; i<=n; i++)rez[i]=inf;
rez[1]=0;
for(i=1; i<=m; i++)
{
f>>a[i][1]>>a[i][2]>>a[i][3];
if(a[i][1]==1)rez[a[i][2]]=a[i][3];
}
while(ok and nr<n)
{
ok=0;
for(i=1; i<=m; i++)
{
x=a[i][1];
y=a[i][2];
z=a[i][3];
if(rez[y]>rez[x]+z)
{
rez[y]=rez[x]+z;
ok=1;
}
}
nr++;
}
for(i=2; i<=n; i++)if(rez[i]<inf)g<<rez[i]<<" ";
else g<<0<<" ";
return 0;
}