ACM Contest and Blackout UVA - 10600
图论·次小生成树
题目大意:
求最小和次小生成树。
题解:
求就行了啊。
Code:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 105;
const int M = 10005;
const int INF = 0x3f3f3f3f;
int n,m;
vector<int> nodes;
int mxcost[N][N];
struct Edge{
int u,v,w,next;
bool operator < (const Edge & tp) const {
return w < tp.w;
}
}edge[M],e[N*2];
int head[N],ec;
void clear(){ memset(head,0,sizeof(head)); ec=0; }
void add(int a,int b,int w){
ec++; e[ec].u=a; e[ec].v=b; e[ec].w=w;
e[ec].next=head[a]; head[a]=ec;
}
int pa[N];
void init(){ for(int i=1;i<=n;i++)pa[i]=i; }
int find(int x){
if(x!=pa[x]) pa[x]=find(pa[x]);
return pa[x];
}
bool bo[M];
int kruskal(){
init(); int cnt=0; int cost=0;
for(int i=1;i<=m;i++){
int xx=find(edge[i].u), yy=find(edge[i].v);
if(xx!=yy){
pa[xx]=yy; bo[i]=true;
add(edge[i].u,edge[i].v,edge[i].w);
add(edge[i].v,edge[i].u,edge[i].w);
cost+=edge[i].w;
if(++cnt==n-1) break;
}
}
return cost;
}
void dfs(int u,int f,int w){
for(int i=0;i<nodes.size();i++){
int x=nodes[i];
mxcost[u][x]=mxcost[x][u]=max(mxcost[x][f],w);
}
nodes.push_back(u);
for(int i=head[u];i;i=e[i].next){
int v=e[i].v;
if(v==f) continue;
dfs(v,u,e[i].w);
}
}
void clearAll(){
clear();
memset(mxcost,0,sizeof(mxcost));
memset(bo,false,sizeof(bo));
nodes.clear();
}
int main(){
freopen("a.in","r",stdin);
int T; cin>>T;
while(T--){
clearAll();
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++){
scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].w);
}
sort(edge+1,edge+1+m);
int cost=kruskal();
dfs(1,0,0);
int cost2=INF;
for(int i=1;i<=m;i++) if(!bo[i]){
cost2=min(cost2,cost-mxcost[edge[i].u][edge[i].v]+edge[i].w);
}
printf("%d %d\n",cost,cost2);
}
}