HDUOJ_1301（最小生成树）

HDUOJ_1301（最小生成树）

Jungle Roads

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5488    Accepted Submission(s): 3960

Problem Description

The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so the large road network is too expensive to maintain. The Council of Elders must choose to stop maintaining some roads. The map above on the left shows all the roads in use now and the cost in aacms per month to maintain them. Of course there needs to be some way to get between all the villages on maintained roads, even if the route is not as short as before. The Chief Elder would like to tell the Council of Elders what would be the smallest amount they could spend in aacms per month to maintain roads that would connect all the villages. The villages are labeled A through I in the maps above. The map on the right shows the roads that could be maintained most cheaply, for 216 aacms per month. Your task is to write a program that will solve such problems.

The input consists of one to 100 data sets, followed by a final line containing only 0. Each data set starts with a line containing only a number n, which is the number of villages, 1 < n < 27, and the villages are labeled with the first n letters of the alphabet, capitalized. Each data set is completed with n-1 lines that start with village labels in alphabetical order. There is no line for the last village. Each line for a village starts with the village label followed by a number, k, of roads from this village to villages with labels later in the alphabet. If k is greater than 0, the line continues with data for each of the k roads. The data for each road is the village label for the other end of the road followed by the monthly maintenance cost in aacms for the road. Maintenance costs will be positive integers less than 100. All data fields in the row are separated by single blanks. The road network will always allow travel between all the villages. The network will never have more than 75 roads. No village will have more than 15 roads going to other villages (before or after in the alphabet). In the sample input below, the first data set goes with the map above.

The output is one integer per line for each data set: the minimum cost in aacms per month to maintain a road system that connect all the villages. Caution: A brute force solution that examines every possible set of roads will not finish within the one minute time limit.

 

Sample Input

  
  

   
   9
A 2 B 12 I 25
B 3 C 10 H 40 I 8
C 2 D 18 G 55
D 1 E 44
E 2 F 60 G 38
F 0
G 1 H 35
H 1 I 35
3
A 2 B 10 C 40
B 1 C 20
0
  
  

Sample Output

  
  

   
   216
30
  
  

 

题意： 这道题大概是说，有n个村庄，村庄之间有很多条道路（大于n*(n-1)/2）而且任意两个村庄都连通,有些村庄之间有多条路径可以相通。为了节约养护道路的成本，现在需要计算如何花最少的成本养护道路，且使得任意两个村庄都直接或间接连通。（出于节约成本有些道路就不养护了，只要保证任意两个村庄相通就行）

 

注意：这道题和前面的几道畅通工程的题很相似，我感觉这道题的难点（格式）是怎么将给出的数据正确存放在相应的变量中。因为村庄的编号是字符，而在输入数据时编号和数字之间有空格，而且输入完每行数据后会有一个换行。换行和空格都会影响字符的输入，很难把村庄的编号和道路信息匹配。

My  solution:

/*2015.8.12*/

#include<stdio.h>
#include<algorithm>
using namespace std;
int per[30];
struct stu
{
	char a,b;
	int s;
}node[1000];/*存放两个村庄编号和村庄之间道路养护成本*/
int cmp(stu a,stu b)
{
	return a.s<b.s;
}
void chushihua()
{
	int i;
	for(i='A';i<='Z';i++)/*由于村庄的编号是字符，因此只能对相应的Ascall码进行操作*/
	   per[i]=i;	
}
int find(int x)
{
	int i,j;
	i=x;
	while(i!=per[i])
	i=per[i];
	while(x!=per[x])
	{
		j=per[x];
		per[x]=i;
		x=j;
	}
	return i;
}
bool join(int x,int y)
{
	int fx,fy;
	fx=find(x);
	fy=find(y);
	if(fx!=fy)
	{
		per[fx]=fy;
		return true;
	}
	else
	return false;
}
int main()
{
	int n,m,i,k,j,sum,a,b;
	char c;
	while(scanf("%d",&n)==1&&n)
	{
		chushihua();
		k=0;sum=0;
		for(j=0;j<n-1;j++)/*每一组测试数据下面都有n-1行数据*/
		{
		    getchar();/*吃掉换行*/
			scanf("%c%d",&c,&m);
			for(i=0;i<m;i++)/*控制每行的数据输入*/
			{
				k++;node[k].a=c;getchar();/*吃掉数字和后面待输入的字符之间的空格*/
				scanf("%c%d",&node[k].b,&node[k].s);
			}
	    }
	//	for(j=1;j<=k;j++)
	//	printf("%c  %c  %d  \n",node[j].a,node[j].b,node[j].s);/*检验数据是否正确放入相应变量中*/
	    sort(node+1,node+k+1,cmp);
		for(i=1;i<=k;i++)
		{
		//	a=node[i].a;b=node[i].b;/*把字符的Ascall码值赋给整型变量*/
		//	printf("%d %d\n",a,b);
		//	if(join(a,b))/*对转化的整型变量进行处理*/
		if(join(node[i].a,node[i].b))/*把字符直接当作整型处理*//*上面的方法也可以*/
			sum+=node[i].s;/*统计成本*/
		}
		printf("%d\n",sum);	
	}
	return 0;
}