2539 Truck History【prim】

 

Truck History

时间限制(普通/Java):2000MS/20000MS     运行内存限制:65536KByte
总提交: 8            测试通过: 4

http://acm.tzc.edu.cn/acmhome/problemdetail.do?&method=showdetail&id=2539

描述

Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery, other for furniture, or for bricks. The company has its own code describing each type of a truck. The code is simply a string of exactly seven lowercase letters (each letter on each position has a very special meaning but that is unimportant for this task). At the beginning of company's history, just a single truck type was used but later other types were derived from it, then from the new types another types were derived, and so on.

Today, ACM is rich enough to pay historians to study its history. One thing historians tried to find out is so called derivation plan -- i.e. how the truck types were derived. They defined the distance of truck types as the number of positions with different letters in truck type codes. They also assumed that each truck type was derived from exactly one other truck type (except for the first truck type which was not derived from any other type). The quality of a derivation plan was then defined as

1/Σ_(to,td)d(t_o,t_d)

where the sum goes over all pairs of types in the derivation plan such that t _o is the original type and t _d the type derived from it and d(t _o,t _d) is the distance of the types.
Since historians failed, you are to write a program to help them. Given the codes of truck types, your program should find the highest possible quality of a derivation plan.

 

输入

The input consists of several test cases. Each test case begins with a line containing the number of truck types, N, 2 <= N <= 2 000. Each of the following N lines of input contains one truck type code (a string of seven lowercase letters). You may assume that the codes uniquely describe the trucks, i.e., no two of these N lines are the same. The input is terminated with zero at the place of number of truck types.

 

输出

For each test case, your program should output the text "The highest possible quality is 1/Q.", where 1/Q is the quality of the best derivation plan.

 

样例输入

 

4
aaaaaaa
baaaaaa
abaaaaa
aabaaaa
0

 

样例输出

 

The highest possible quality is 1/3.

分析：这里主要是distance怎么统计。

They defined the distance of truck types as 

the number of positions with different letters in truck type codes.

这句英语说明了。两个字符串同位置的不同的字符数。

所以这样获取：

	for(i=0;i<n;i++)
			
            for(j=i+1;j<n;j++)
				
            {
				
                count=0;
				
                for(k=0;k<7;k++)
					
                    if(truck[i].s[k]!=truck[j].s[k]){count++;}
					
					g[i][j]=count,g[j][i]=count;
					
            }
 

完整代码：

#include<stdio.h>
#include<string.h>
#define inf 99999999
#define abs(x) (x)<0?-(x):(x)
typedef struct
{
	char s[10];
	int w;
}node;


int g[2002][2002],disk[2002],visit[2002],n;

int minelem(int *w)
{
	int j,min=inf;
	for(j=0;j<n;j++)
	{
		if(!visit[j]&&disk[j]<min)
		{
			min=disk[j];
			(*w)=j;
			
		}
	}
	return min;
	
}


void updata(int w)
{
	int i;
	
	for(i=0;i<n;i++)
	{
		if(!visit[i]&&disk[i]>g[i][w])
		{
			disk[i]=g[i][w];
		}
	}
	
}




int prim()
{
	int i,min,w,sum=0;


	visit[0]=1;
	for(i=0;i<n;i++)
	{
		disk[i]=g[i][0];
	}//初始化

	for(i=1;i<n;i++)
	{
		w=-1;
		min=minelem(&w);
		if(w==-1)break;
		sum+=min;
		visit[w]=1;

		updata(w);

		
	}


	return sum;


}

int main()
{
	int i,j,tt,count,k;
	char c;
	node truck[2005];
	

	while(scanf("%d",&n),n)
	{
		memset(visit,0,sizeof(visit));
		
		for(i=0;i<n;i++)
		scanf("%s",truck[i].s);
		 for(i=0;i<n;i++)

            for(j=i+1;j<n;j++)

            {

                count=0;

                for(k=0;k<7;k++)

                    if(truck[i].s[k]!=truck[j].s[k]){count++;}

                g[i][j]=count,g[j][i]=count;

            }

	
	printf("The highest possible quality is 1/%d./n",prim());

	}




	return 0;
}