题意:问最小生成树是否唯一
思路:模版求次小生成树与最小生成树的值是否相同
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
const double INF=0x3f3f3f3f;
using namespace std;
int dis[105],path[105][105],G[105][105];
int n,m,pre[105],vis[105],used[105][105];
int prim(int v){
int i,j,u,sum,tmp;
sum=0;
memset(vis,0,sizeof(vis));
memset(used,0,sizeof(used));
memset(path,0,sizeof(path));
for(i=1;i<=n;i++){
dis[i]=G[v][i];
pre[i]=1;
}
vis[v]=1;
for(i=1;i<n;i++){
u=v;
tmp=INF;
for(j=1;j<=n;j++)
if(dis[j]<tmp&&vis[j]==0){
tmp=dis[j];
u=j;
}
sum+=tmp;
vis[u]=1;
used[u][pre[u]]=used[pre[u]][u]=1;
for(j=1;j<=n;j++){
if(vis[j]&&j!=u)
path[u][j]=path[j][u]=max(path[j][pre[u]],dis[u]);
if(!vis[j]){
if(dis[j]>G[u][j]){
dis[j]=G[u][j];
pre[j]=u;
}
}
}
}
return sum;
}
int second_prim(int tmp){
int i,j,ans;
ans=INF;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++){
if(i!=j&&used[i][j]==0)
ans=min(ans,tmp+G[i][j]-path[i][j]);
}
return ans;
}
int main(){
int i,j,x,y,z,ans,tmp,T;
scanf("%d",&T);
while(T--){
scanf("%d%d",&n,&m);
memset(G,INF,sizeof(G));
for(i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&z);
G[x][y]=G[y][x]=z;
}
tmp=prim(1);
ans=second_prim(tmp);
if(ans!=tmp)
printf("%d\n",tmp);
else printf("Not Unique!\n");
}
return 0;
}