zoj_2966 Build TheElectric System

B - Build TheElectric System

Crawling in process...Crawlingfailed Time Limit:2000MS     Memory Limit:65536KB    64bit IO Format:%lld & %llu

Submit Status

题目连接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2966

Description

In last winter, therewas a big snow storm in South China. Theelectric system was damaged seriously. Lots of power lines were broken and lotsof villages lost contact with the main power grid. The government wants toreconstruct the electric system as soon as possible. So, as a professionalprogrammer, you are asked to write a program to calculate the minimum cost toreconstruct the power lines to make sure there's at least one way between everytwo villages.

Input

Standard input willcontain multiple test cases. The first line of the input is a single integerT(1 <= T <= 50) which is the number of test cases. And it will befollowed byT consecutive test cases.

In each test case, thefirst line contains two positive integersN and E (2 <= N<= 500, N <= E <= N * (N - 1) / 2),representing the number of the villages and the number of the original powerlines between villages. There followE lines, and each of them contains threeintegers, A, B,K (0 <= A, B < N,0 <= K < 1000). A and B respectively means the indexof the starting village and ending village of the power line. IfK is 0,it means this line still works fine after the snow storm. If K is apositive integer, it means this line will cost K to reconstruct. Therewill be at most one line between any two villages, and there will not be anyline from one village to itself.

Output

For each test case inthe input, there's only one line that contains the minimum cost to recover theelectric system to make sure that there's at least one way between every twovillages.

Sample Input

1

3 3

0 1 5

0 2 0

1 2 9

Sample Output

5

 

解题思路：这个题目是一个比较典型的并查集，我用一个结构体来保存输入村庄的起点和终点和全职，需要注意的是数组空间的大小，对结构体数组进行从小到大排序，然后依次取出节点进行合并查找，记录集合中节点的数量是否等于村庄的数量，如果等于，直接输出总和

      

 

代码：

 

#include<stdio.h>
#include<iostream>
#include<algorithm>
#define MAX 502
using namespace std;
struct edge
{
	int start;
	int end;
	int weight;
};
edge e[MAX*MAX/2];

int point[MAX];
int number=1;//记录合并的点数
int sum=0;//记录总长度
int T,N,E;//测试用例，点数，边数

int findSet(int t)
{
	if(t==point[t])
		return point[t];
	//number++;
	return point[t]=findSet(point[t]);
}

void unionSet(edge temp)
{
	int a=findSet(temp.start);
	int b=findSet(temp.end);
	if(a==b)//x,y具有相同的祖先
		return ;
	point[a]=b;//合并——b的父亲变为a
	number++;
	sum+=temp.weight;
}

int main()
{
	scanf("%d",&T);
	int a,b,k;
	int i,j;
	while(T--)
	{
		number=1;
		sum=0;
		scanf("%d%d",&N,&E);
		for(i=0;i<N;i++)
		{
			point[i]=i;
		}
		//E条边
		
		for(i=0;i<E;i++)
		{
			scanf("%d%d%d",&e[i].start,&e[i].end,&e[i].weight);
		}
		for(i=0;i<E;i++)
		{
			for(j=i;j<E;j++)
			{
				if(e[i].weight>e[j].weight)
				{
					edge temp;
					temp=e[i];
					e[i]=e[j];
					e[j]=temp; 
				}	
			}
		}
		for(i=0;i<E;i++)
		{
			if(number==N)
			{
				printf("%d\n",sum);
				break;
			}
			unionSet(e[i]);
		}
		
	}
	return 0;
}