Pagini recente » Cod sursa (job #2131444) | Monitorul de evaluare | Istoria paginii runda/gg1 | Cod sursa (job #1951176) | Cod sursa (job #316033)
Cod sursa(job #316033)
#include <stdio.h>
#define DIM 50005
struct nod {int x,c;
nod *urm;} *lst[DIM];
int cost[DIM],q[4*DIM+3],viz[DIM];
int n,m;
void add (int a,int b,int c)
{
nod *p=new nod;
p->x=b;
p->c=c;
p->urm=lst[a];
lst[a]=p;
}
void read ()
{
int i,x,y,ct;
scanf ("%d%d",&n,&m);
for (i=1; i<=m; ++i)
{
scanf ("%d%d%d",&x,&y,&ct);
add (x,y,ct);
}
}
void solve ()
{
nod *p;
int i,in,sf;
for (q[in=sf=1]=1; in<=sf; ++in)
for (p=lst[q[in%(4*DIM+3)]]; p; p=p->urm)
if (!cost[p->x] || cost[q[in%(4*DIM+3)]]+p->c<cost[p->x])
{
cost[p->x]=cost[q[in%(4*DIM+3)]]+p->c;
++sf;
if (!viz[p->x])
q[sf%(4*DIM+3)]=p->x;
}
for (i=2; i<=n; ++i)
printf ("%d ",cost[i]);
}
int main ()
{
freopen ("dijkstra.in","r",stdin);
freopen ("dijkstra.out","w",stdout);
read ();
solve ();
return 0;
}