1491: [NOI2007]社交网络 - BZOJ

Description

Input

Output
输出文件包括n 行，每行一个实数，精确到小数点后3 位。第i 行的实数表 示结点i 在社交网络中的重要程度。
Sample Input
4 4
1 2 1
2 3 1
3 4 1
4 1 1
Sample Output
1.000
1.000
1.000
1.000
HINT

为1

其实floyd已经够了，我这sb没想到，TM想了半天想出一个拓扑排序的，还用了floyd预处理最短路，而且还下了数据和标程才突然想起来，我TM没拓扑排序for个屁啊（最后写出来pascal第一，当然是因为floyd做了太多没用的事啦）

 const
     maxn=;
     maxm=;
 var
     first,d:array[..maxn]of longint;
     last,next,w:array[..maxm*]of longint;
     f:array[..maxn,..maxn]of longint;
     ans,a:array[..maxn]of double;
     s:array[..maxn]of int64;
     n,m,tot:longint;

 procedure insert(x,y,z:longint);
 begin
     inc(tot);
     last[tot]:=y;
     next[tot]:=first[x];
     first[x]:=tot;
     w[tot]:=z;
 end;

 var
     q:array[..maxn]of longint;
     l,r:longint;

 procedure work(x:longint);
 var
     i:longint;
 begin
     for i:= to n do s[i]:=;
     for i:= to n do a[i]:=;
     for i:= to n do d[i]:=;
     for l:= to n do
         begin
             i:=first[l];
             while i<> do
                 begin
                     if f[x,l]+w[i]=f[x,last[i]] then inc(d[last[i]]);
                     i:=next[i];
                 end;
         end;
     l:=;r:=;q[]:=x;s[x]:=;
     while l<=r do
         begin
             i:=first[q[l]];
             while i<> do
                 begin
                     if f[x,q[l]]+w[i]=f[x,last[i]] then
                     begin
                         dec(d[last[i]]);
                         if d[last[i]]= then
                         begin
                             inc(r);
                             q[r]:=last[i];
                         end;
                         inc(s[last[i]],s[q[l]]);
                     end;
                     i:=next[i];
                 end;
             inc(l);
         end;
     for l:=n downto  do
         begin
             i:=first[q[l]];
             while i<> do
                 begin
                     if f[x,q[l]]+w[i]=f[x,last[i]] then a[q[l]]:=a[q[l]]+a[last[i]]+/s[last[i]];
                     i:=next[i];
                 end;
         end;
     for i:= to n do ans[i]:=ans[i]+a[i]*s[i];
 end;

 procedure main;
 var
     i,j,k,x,y,z:longint;
 begin
     read(n,m);
     fillchar(f,sizeof(f),);
     for i:= to n do f[i,i]:=;
     for i:= to m do
         begin
             read(x,y,z);
             insert(x,y,z);
             insert(y,x,z);
             if z<f[x,y] then
             begin
                 f[x,y]:=z;
                 f[y,x]:=z;
             end;
         end;
     for k:= to n do
         for i:= to n do
             for j:= to n do
                 if f[i,k]+f[k,j]<f[i,j] then f[i,j]:=f[i,k]+f[k,j];
     for i:= to n do work(i);
     for i:= to n do writeln(ans[i]::);
 end;

 begin
     main;
 end.