最小全域树问题
//============================================================================
// Name : Re-connecting Computer Sites.cpp
// Date : 2013/4/13 上午11:26:43
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE\_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\\n")
#define I\_de(x,n)for(int i=0;i<n;i++)printf("%d ",x\[i\]);Pln()
#define De(x)printf(#x"%d\\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\
printf("%d ",dp\[htx\]\[hty\]);}Pln();}
#define M 5001000
#define PII pair<int,int\>
#define PB push\_back
#define oo INT\_MAX
#define Set\_oo 0x3f
#define Is\_debug true
#define debug(...) if(Is\_debug)printf("DEBUG: "),printf(\_\_VA\_ARGS\_\_)
#define FOR(it,c) for(\_\_typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
int tmp=min(x,y);
return min(tmp,z);
}
int max3(int x,int y,int z){
int tmp=max(x,y);
return max(tmp,z);
}
struct edge{
int x,y,w;
}edges\[M\];
int m,k,n;
int p\[M\];
int rank\[M\];
int getf(int x){
if(x!=p\[x\])p\[x\]=getf(p\[x\]);
return p\[x\];
}
void \_union(int x,int y){
if(rank\[x\]>rank\[y\]){
p\[y\]=x;
}else{
p\[x\]=y;
if(rank\[x\]==rank\[y\])rank\[y\]++;
}
}
bool cmp(edge a,edge b){
return a.w<b.w;
}
int main() {
ios\_base::sync\_with\_stdio(0);
int ff=0;
while(~scanf("%d",&n)){
int x,y,w;
int sum=0;
if(ff++)Pln();
for(int i=0;i<=n;i++){
p\[i\]=i;
rank\[i\]=0;
}
for(int i=0;i<n-1;i++){
scanf("%d%d%d",&x,&y,&w);
sum+=w;
}
printf("%d\\n",sum);
scanf("%d",&k);
for(int i=0;i<k;i++){
scanf("%d%d%d",&x,&y,&w);
edges\[i\].x=x;
edges\[i\].y=y;
edges\[i\].w=w;
}
scanf("%d",&m);
for(int i=k;i<k+m;i++){
scanf("%d%d%d",&x,&y,&w);
edges\[i\].x=x;
edges\[i\].y=y;
edges\[i\].w=w;
}
int ans=0;
m+=k;
sort(edges,edges+m,cmp);
for(int i=0;i<m;i++){
x=edges\[i\].x;
y=edges\[i\].y;
w=edges\[i\].w;
x=getf(x);
y=getf(y);
if(x!=y){
\_union(x,y);
ans+=w;
}
}
printf("%d\\n",ans);
}
}