Truck History
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 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 |
这道题的难点在于读懂题意,只要读懂了,剩下的就是手速的问题了。。。
题目大意:
有 n 个车牌号, 车牌号 i 是由 j 经过 x 次字母变化衍生而来,求 和 x 的最小值;
比如 例子当中,第二三四个车牌号都是由第一个衍生而来, 这样 和 才会最小。
说到这应该看出来这是一道最小生成树的题目,权值为两个车牌号所差的字母个数。
代码如下:
#include <iostream>
#include <cstdio>
#include <stdlib.h>
#include <cstring>
using namespace std;
const int N = 2010;
const int inf = 0x3f3f3f3f;
int mp[N][N];
char str[N][N];
int dis[N];
int vis[N];
int sum, n;
int distance(char *s1, char *s2) //返回两个车牌所差的字母个数
{
int t = 0;
for( int i = 0;i < 7;i++ )
{
if( s1[i]!=s2[i] )
t++;
}
return t;
}
void fun() //算法
{
memset( vis, 0, sizeof(vis) );
for( int i = 1;i <= n;i++ )
{
dis[i] = mp[1][i];
}
vis[1] = 1;
for( int i = 1;i < n;i++ )
{
int x, mn = inf;
for( int j = 1;j <= n;j++ )
{
if( !vis[j]&&dis[j]<mn )
{
mn = dis[j];
x = j;
}
}
vis[x] = 1;
sum += mn;
for( int j = 1;j <= n;j++ )
{
if( !vis[j] )
{
dis[j] = min(dis[j], mp[j][x]);
}
}
}
}
int main()
{
while(cin>>n&&n)
{
for( int i = 1;i <= n;i++ )
{
cin>>str[i];
}
for(int i = 1;i <= n;i++)
{
for( int j = i+1;j <= n;j++ )
mp[i][j] = mp[j][i] = distance(str[i], str[j]); //存下权值(i 和 j差的字母数)
mp[i][i] = 0;
}
sum = 0;
fun();
cout<<"The highest possible quality is 1/"<<sum<<"."<<endl;
}
return 0;
}