Pagini recente » Cod sursa (job #294943) | Cod sursa (job #771653) | Cod sursa (job #1119552) | Cod sursa (job #1796223) | Cod sursa (job #2138835)
#include<fstream>
#define dim 251001
#define dim2 51001
//#define dim 10
//#define dim2 9
//#define oo 123456788
using namespace std;
int a[dim],b[dim],cost[dim],dist[dim2],i,ok,m,n,minn;
int main()
{
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int nr=1;
f>>n>>m;
minn=(1<<30);
for(i=2;i<=n;i++)
dist[i]=minn;
for(i=1;i<=m;i++)
{
f>>a[i]>>b[i]>>cost[i];
if(a[i]==1)
dist[b[i]]=cost[i];
}
ok=1;
while(ok and nr<n)
{
ok=0;
for(i=1;i<=m;i++)
{
if(dist[b[i]]>dist[a[i]]+cost[i])
{
dist[b[i]]=dist[a[i]]+cost[i];
ok=1;
}
}
nr++;
}
for(i=2;i<=n;i++)
if(dist[i]==minn)
g<<"0 ";
else
g<<dist[i]<<' ';
return 0;
}