Truck History POJ - 1789 （prim）

Truck History

  POJ - 1789 

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.

题意：n个长度为7的字符串，每个字符穿间的‘距离’是其二者不同的字符个数，求1/MST

思路：MST

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<utility>
#include<set>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#define maxn 2005
#define INF 0x3f3f3f3f
#define LL long long
#define ULL unsigned long long
#define mod 1000000007
#define P pair<int,int>
using namespace std;

int n,m,p,sum;
char s[maxn][10];
int d[maxn],v[maxn];
//v[i]: 若已经纳入生成树，则v[i]=1,否则为0
//d[i]：当前已生成树的点的集合内的点 到 其他点的最短距离

int find_dist(int x,int y)
{
    int cnt=0;
    for(int i=0;i<7;++i){
        if(s[x][i]!=s[y][i])
            cnt++;
    }
    return cnt;
}
void prim()
{
    for(int i=1;i<=n;++i){
        d[i] = find_dist(1,i);
        v[i] = 0;
    }
    v[1] = 1;
    for(int i=1;i<=n-m-1;++i){  //循环n次，每次加入一个点，共n个点
        int mi = INF;
        for(int j=1;j<=n;++j){  //找到符合生成树规则的权值最小的边
            if(!v[j] && d[j]<mi){
                mi = d[j];
                p = j;
            }
        }
        v[p] = 1;
        for(int j=1;j<=n;++j){
            if(!v[j] && find_dist(p,j)<d[j])
                d[j] = find_dist(p,j);
        }
    }
    sum = 0;
    for(int i=1;i<=n;++i){
        sum += d[i];
    }
}
int main()
{
    while(scanf("%d",&n)!=EOF&&n){
        getchar();
        memset(v,0,sizeof(v));
        for(int i=1;i<=n;++i){
            scanf("%s",s[i]);
            getchar();
        }
        prim();
        printf("The highest possible quality is 1/%d.\n",sum);
    }
    return 0;
}