POJ 1789:Truck History 【Prim】

Truck History

Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 123   Accepted Submission(s) : 36
Problem Description
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(to,td)

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.
 

Input
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.
 

Output
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.
 

Sample Input
  
  
4 aaaaaaa baaaaaa abaaaaa aabaaaa 0
 

Sample Output
  
  
The highest possible quality is 1/3.
 


AC-code:

#include<cstdio>
#include<cstring>
int n,s[2000][2000];
#define max 0x3f3f3f3f
int distance(char a[8],char b[8])
{
	int di=0;
	for(int i=0;i<7;i++)
		if(a[i]!=b[i])
			di++;
	return di;
}

void prim()
{
	int i,j,k,vis[2000],dis[2000];
	memset(vis,0,sizeof(vis));
	for(i=1;i<n;i++)
		dis[i]=s[0][i];
	dis[0]=0;
	vis[0]=1;
	for(j=1;j<n;j++)
	{
		int min=max;
		for(i=1;i<n;i++)
			if(!vis[i]&&dis[i]<min)
			{
				k=i;
				min=dis[i];
			}
		vis[k]=1;
		for(i=1;i<n;i++)
			if(!vis[i]&&dis[i]>s[k][i])
				dis[i]=s[k][i];
	}
	int sum=0;
	for(i=1;i<n;i++)
		sum+=dis[i];
	printf("The highest possible quality is 1/%d.\n",sum);
}
int main()
{
	int i,j;
	char str[2000][8];
	while(scanf("%d",&n),n)
	{
		for(i=0;i<n;i++)
			for(j=i;j<n;j++)
				s[i][j]=s[j][i]=max;
		for(i=0;i<n;i++)
			scanf("%s",str[i]);
		for(i=0;i<n;i++)
			for(j=i;j<n;j++)
				s[i][j]=s[j][i]=distance(str[i],str[j]);
		prim();
	}
	return 0;
}


 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值