Truck History
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 25921 | Accepted: 10060 |
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.
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
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.
Source
题意大概是这样的:用一个7位的string代表一个编号,两个编号之间的distance代表这两个编号之间不同字母的个数。一个编号只能由另一个编号“衍生”出来,代价是这两个编号之间相应的distance,现在要找出一个“衍生”方案,使得总代价最小,也就是distance之和最小。
prime算法是先加入第一个顶点,然后把后续顶点一个一个的加入
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define inf 0x3f3f3f3f
using namespace std;
int mp[2100][2100],vis[2100],dis[2100];
char str[2100][8];
int main()
{
int n,i,j,k;
while(~scanf("%d",&n)&&n)
{ int sum,ans=0;
memset(vis,0,sizeof(vis));
for(i=0;i<=n-1;i++)
{
scanf("%s",str[i]);
}
for(i=0;i<=n-1;i++)
{
for(j=0;j<=n-1;j++)
{
if(i==j)
mp[i][j]=0;
else mp[i][j]=inf;
}
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<=n-1;j++)
{ sum=0;
for(k=0;k<7;k++)
{
if(str[i][k]!=str[j][k])//每两个字符串之间的距离
{
sum++;
}
}
mp[i][j]=mp[j][i]=sum;
}
}
for(i=0;i<=n-1;i++)
{
dis[i]=mp[0][i];//现将第一个点加入树,初始化dis储存树与未加入树的点的距离
}
vis[0]=1;//标记
int min,t,count=1;
while(count<n)//最多剩余n-1个点
{
min=inf;
for(i=0;i<=n-1;i++)
{
if(!vis[i]&&dis[i]<min)
{
min=dis[i];
t=i;
}
}
vis[t]=1;//找出与树距离最近的点,将该点加入
count++;
ans+=min;
for(j=0;j<n;j++)
{
if(!vis[j]&&dis[j]>mp[t][j])//先前树中的点已经判断过了,只需判断新加入的点,刷新各点与树的最短距离
{
dis[j]=mp[t][j];
}
}
}
cout<<"The highest possible quality is 1/"<<ans<<"."<<endl;
}
return 0;
}