BZOJ 1601: [Usaco2008 Oct]灌水 最小生成树_超级源点
Code:
#include <bits/stdc++.h>
#define maxn 2000000
#define setIO(s) freopen(s".in","r",stdin)
using namespace std;
int A[maxn],u[maxn],v[maxn],val[maxn],cnt,w[maxn];
int cmp(int a,int b){ return val[a]<val[b]; }
struct U{
int p[maxn];
void init(){ for(int i=0;i<maxn;++i) p[i]=i; }
int find(int x){ return p[x]==x?x:p[x]=find(p[x]); }
void merge(int a,int b){
int x=find(a),y=find(b);
if(x==y) return;
p[x]=y;
}
}tree;
int main(){
// setIO("input");
tree.init();
int n;
scanf("%d",&n);
for(int i=1;i<=n;++i) ++cnt,scanf("%d",&val[cnt]),u[cnt]=0,v[cnt]=i;
for(int i=1;i<=n;++i)
for(int j=1,a;j<=n;++j) {
scanf("%d",&a);
if(i!=j) ++cnt,u[cnt]=i,v[cnt]=j,val[cnt]=a;
}
for(int i=1;i<=cnt;++i) A[i]=i;
sort(A+1,A+1+cnt,cmp);
int ans=0;
for(int i=1;i<=cnt;++i) {
int cur=A[i];
int a=u[cur],b=v[cur];
if(tree.find(a)!=tree.find(b)){
ans+=val[cur];
tree.merge(a,b);
}
}
printf("%d",ans);
return 0;
}