poj 1789 -- Truck History

Truck History

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 17271		Accepted: 6621

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

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.


这道题就是一个最小生成树。每条字符串代表了一个类型的卡车，不同卡车之间有个演变的距离，我们define为两个字符串间相同位置上不同字母的个数和。可以把这个距离当作权值，
卡车当作点，所求的Q 就是最少生成树。分析出来后就是一个最小生成树的水题。

/*======================================================================
 *           Author :   kevin
 *         Filename :   TruckHistory.cpp
 *       Creat time :   2014-07-09 09:16
 *      Description :
========================================================================*/
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#define clr(a,b) memset(a,b,sizeof(a))
#define M 2014
#define INF 0x7f7f7f7f
using namespace std;
int c[M][M],dis[M];
char str[M][10];
void BuildGrap(int n)
{
    for(int i = 0; i < n; i++){
        for(int j = i+1; j < n; j++){
            int d = 0;
            for(int t = 0; t < 7; t++){
                if(str[i][t] != str[j][t]){
                    d += 1;
                }
            }
            c[i][j] = c[j][i] = d;
        }
    }
}
int prim(int n)
{
    int i,j,k,sum = 0;
    bool vis[M];
    for(i = 0; i < n; i++){
        dis[i] = c[0][i];
        vis[i] = false;
    }
    vis[0] = true;
    for(i = 1; i < n; i++){
        int _min = INF;
        j = 0;
        for(k = 0; k < n; k++){
            if(_min > dis[k] && !vis[k]){
                _min = dis[k];
                j = k;
            }
        }
        vis[j] = true;
        sum += dis[j];
        for(k = 0; k < n; k++){
            if(dis[k] > c[j][k] && !vis[k]){
                dis[k] = c[j][k];
            }
        }
    }
    return sum;
}
int main(int argc,char *argv[])
{
    int n;
    while(scanf("%d",&n)!=EOF && n){
        clr(c,0);
        for(int i = 0; i < n; i++){
            getchar();
            scanf("%s",str[i]);
        }
        BuildGrap(n);
        int ans = prim(n);
        printf("The highest possible quality is 1/%d.
",ans);
    }
    return 0;
}