Truck History
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 11665 | Accepted: 4376 |
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位小写字母组成。卡车的进化历史,都是从一种卡车,衍生出一种新卡车。
求1/Q的最大值,也就是求Q的最小值。Q为N种卡车进化所需的权值和。从一种卡车进化成另一种卡车的权值为,7位代号,相同位
不同字母的数量。
题目分析:可以抽象成,一种卡车演化成另一个种卡车。相当于两个节点之间有一条边。
求Q的最小值,相当于求把所有卡车连通在一起需要的最小费用。即最小生成树问题。
代码如下:
#include <iostream>
#include <stdio.h>
#include <algorithm>
#define V 2001
#define E V * (V-1) / 2
using namespace std;
int n,k;
char trucks[V][8];
int f[V];
int rank[V];
struct Edge{
int u,v,w;
};
Edge edge[E];
bool cmp(Edge a,Edge b){
if(a.w < b.w){
return true;
} else {
return false;
}
}
void createEdge(char a[],char b[],int u,int v) {
int sum = 0;
for(int i = 0; i < 8; i++){
if(a[i] != b[i]) {
sum++;
}
}
k++;
edge[k].u = u;
edge[k].v = v;
edge[k].w = sum;
}
void makeSet(){
for (int i = 0; i < n; i++){
f[i] = i;
rank[i] = 0;
}
}
int findRoot(int x){
if( x == f[x]){
return x;
} else {
return f[x] = findRoot(f[x]);
}
}
void merge(int a,int b){
int ra = findRoot(a);
int rb = findRoot(b);
if(ra != rb){
if(rank[ra] < rank[rb]){
f[ra] = rb;
} else {
f[rb] = ra;
if(rank[ra] == rank[rb]){
rank[ra]++;
}
}
}
}
int main()
{
while(scanf("%d",&n),n){
int sum = 0;
k = -1;
getchar();
for(int i = 0; i < n; i++){
gets(trucks[i]);
for(int j = 0; j < i; j++){
createEdge(trucks[i],trucks[j],i,j);
}
}
makeSet();
sort(edge,edge+k+1,cmp);
for(int i = 0; i <= k ; i++){
int ru = findRoot(edge[i].u);
int rv = findRoot(edge[i].v);
if(ru != rv){
sum += edge[i].w;
merge(edge[i].u,edge[i].v);
}
}
printf("The highest possible quality is 1/%d.\n",sum);
}
return 0;
}