zoj_1586 QS Network

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=586

 

//C++代码
#include<iostream>
#include<queue>
using namespace std;

struct Edge{
	int u,v,w;
	bool operator <(const Edge a) const{
		return w>a.w;
	}
}edge;

int n,a[1005][1005],s[1005];
priority_queue<Edge> pq;

void Union(int x,int y){
	s[y]=x;
}

int Find(int x){
	if(s[x]<0) return x;
	return s[x]=Find(s[x]);
}

void Kruskal(){
	int num=0,sum=0,i;
	for(i=1;i<=n;i++) s[i]=-1;
	while(!pq.empty() && num<n-1){
		edge=pq.top();
		pq.pop();
		if(Find(edge.u)!=Find(edge.v)){
			Union(Find(edge.u),Find(edge.v));
			sum+=edge.w;
			num++;
		}
	}
	cout<<sum<<endl;
	while(!pq.empty()) pq.pop();
}

int main(){
	int t,i,j,x[1005];
	cin>>t;
	while(t--){
		cin>>n;
		for(i=1;i<=n;i++) cin>>x[i];
		for(i=1;i<=n;i++){
			for(j=1;j<=n;j++) cin>>a[i][j];
		}
		for(i=1;i<n;i++){
			for(j=i+1;j<=n;j++){
				edge.u=i;
				edge.v=j;
				edge.w=a[i][j]+x[i]+x[j];
				pq.push(edge);
			}
		}
		Kruskal();
	}
	return 0;
}