[dijkstra+heap优化] 模板

 var
     n,m,s,i,j,x,y,z,l,tot                :longint;
     pre,last,other,len                    :array[..] of longint;
     heap,d,pl                            :Array[..] of longint;

 procedure swap(var x,y:longint);
 var
     z                                    :longint;
 begin
     z:=x;
     x:=y;
     y:=z;
 end;

 procedure add(u,v,r:longint);
 begin
     inc(l);
     pre[l]:=last[u];
     last[u]:=l;
     other[l]:=v;
     len[l]:=r;
 end;

 procedure up(x:longint);
 var
     i                                    :longint;
 begin
     i:=x;
     while (i>>)> do
     begin
         if (d[heap[i>>]]<=d[heap[i]]) then break;
         swap(heap[i],heap[i>>]);
         pl[heap[i]]:=i;
         pl[heap[i>>]]:=i>>;
         i:=i>>;
     end;
 end;

 procedure down(x:longint);
 var
     i,j                                    :longint;
 begin
     i:=x;
     while (i<<)<=tot do
     begin
         j:=i<<;
         if (j+<=tot) and (d[heap[j+]]<d[heap[j]]) then inc(j);
         if (d[heap[i]]<=d[heap[j]]) then break;
         swap(heap[i],heap[j]);
         pl[heap[i]]:=i;
         pl[heap[j]]:=j;
         i:=j;
     end;
 end;

 procedure delete(x:longint);
 begin
     heap[x]:=heap[tot];
     dec(tot);
     pl[heap[x]]:=x;
     down(x);
 end;

 procedure dijkstra;
 var
     cur,p,q,i                            :longint;
 begin
     for i:= to n do
     begin
         cur:=heap[];
         delete();
         p:=last[cur];
         while p<> do
         begin
             q:=other[p];
             if d[q]>d[cur]+len[p] then
             begin
                 d[q]:=d[cur]+len[p];
                 up(pl[q]);
             end;
             p:=pre[p];
         end;
     end;
 end;

 begin
     //assign(input,'input.txt');reset(input);
     //assign(output,'output.txt');rewrite(output);
     read(n,m,s);
     for i:= to m do
     begin
         read(x,y,z);
         add(x,y,z);
     end;
     for i:= to n do d[i]:=maxlongint>>;
     d[s]:=;
     for i:= to n do
     begin
         heap[i]:=i;
         pl[i]:=i;
     end;
     up(s);
     tot:=n;
     dijkstra;
     for i:= to n do if d[i]=maxlongint>> then d[i]:=;
     for i:= to n do write(d[i],' ');
     close(input);
     close(output);
 end.