1491: [NOI2007]社交网络

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=105;
    maxm=4520;
var
    first,d:array[0..maxn]of longint;
    last,next,w:array[0..maxm*2]of longint;
    f:array[0..maxn,0..maxn]of longint;
    ans,a:array[0..maxn]of double;
    s:array[0..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[0..maxn]of longint;
    l,r:longint;
 
procedure work(x:longint);
var
    i:longint;
begin
    for i:=1 to n do s[i]:=0;
    for i:=1 to n do a[i]:=0;
    for i:=1 to n do d[i]:=0;
    for l:=1 to n do
        begin
            i:=first[l];
            while i<>0 do
                begin
                    if f[x,l]+w[i]=f[x,last[i]] then inc(d[last[i]]);
                    i:=next[i];
                end;
        end;
    l:=1;r:=1;q[1]:=x;s[x]:=1;
    while l<=r do
        begin
            i:=first[q[l]];
            while i<>0 do
                begin
                    if f[x,q[l]]+w[i]=f[x,last[i]] then
                    begin
                        dec(d[last[i]]);
                        if d[last[i]]=0 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 2 do
        begin
            i:=first[q[l]];
            while i<>0 do
                begin
                    if f[x,q[l]]+w[i]=f[x,last[i]] then a[q[l]]:=a[q[l]]+a[last[i]]+1/s[last[i]];
                    i:=next[i];
                end;
        end;
    for i:=1 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),1);
    for i:=1 to n do f[i,i]:=0;
    for i:=1 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:=1 to n do
        for i:=1 to n do
            for j:=1 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:=1 to n do work(i);
    for i:=1 to n do writeln(ans[i]:0:3);
end;
 
begin
    main;
end.