PKU1679 the unique mst

         一个图论的题目——判断最小生成树是否唯一。

         首先我们能得到这样一个事实：如果对于一个图的两个不同的生成树权值相等且最小则最小生成树不唯一——说白了就是先求最小生成树，再求次小生成树，比较之！

         这个次小生成树怎么求呢？它可以通过最小生成树换边得到。至于证明呢，漫山遍野导出到时了，自己找找吧！

         当然，需要注意的是，当你再去边的时候，余下的图是否还连通呢？这就是我为什么贡献了一次WA…

program unique_mst; type rec=record u,v,w:longint; end; var edge:array[0..10000] of rec; father:array[0..100] of longint; i,t,n,m,ans:longint; flag:boolean; procedure qsort(s,t:longint); var l,r,key:longint; tt:rec; begin l:=s; r:=t; key:=edge[random(t-s+1)+s].w; while l<=r do begin while edge[l].w<key do inc(l); while edge[r].w>key do dec(r); if l<=r then begin tt:=edge[l]; edge[l]:=edge[r]; edge[r]:=tt; inc(l); dec(r); end; end; if s<r then qsort(s,r); if l<t then qsort(l,t); end; function find(x:longint):longint; begin if father[x]<>x then father[x]:=find(father[x]); exit(father[x]); end; procedure main; var i,k,c,tmp,fu,fv:longint; a:array[0..100] of longint; begin flag:=true; readln(n,m); for i:=1 to m do with edge[i] do readln(u,v,w); qsort(1,m); for i:=1 to n do father[i]:=i; c:=0; ans:=0; for i:=1 to m do with edge[i] do begin fu:=find(u); fv:=find(v); if fu<>fv then begin father[fv]:=fu; inc(c); inc(ans,w); a[c]:=i; if c=n-1 then break; end; end; for k:=1 to n-1 do begin for i:=1 to n do father[i]:=i; c:=0; tmp:=0; for i:=1 to a[k]-1 do with edge[i] do begin fu:=find(u); fv:=find(v); if fu<>fv then begin father[fv]:=fu; inc(c); inc(tmp,w); if c=n-1 then break; end; end; if c<n-1 then for i:=a[k]+1 to m do with edge[i] do begin fu:=find(u); fv:=find(v); if fu<>fv then begin father[fv]:=fu; inc(c); inc(tmp,w); if c=n-1 then break; end; end; if (tmp=ans) and (c=n-1) then begin flag:=false; exit; end; end; end; begin assign(input,'a.in'); reset(input); assign(output,'a.out'); rewrite(output); randomize; readln(t); for i:=1 to t do begin main; if flag then writeln(ans) else writeln('Not Unique!'); end; close(input); close(output); end.