题目来源:http://poj.org/problem?id=1789
Truck History
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 28946 | Accepted: 11301 |
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.
任意两种车牌间都有一个距离值,该值为7位的车牌号中号码不同的字符的个数。
要让quality值最大,也就是让分母的值最小,即可转化成完全图的最小生成树问题。
本题不宜用Kruskal,会MLE,应用O(n^2)的Prim。
采用邻接矩阵存这样稠密的图O(n^2)的算法效率也算是不错了。
代码:
#include <cstdio>
#include <string>
#include <queue>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=2e3+1;
int n;
int g[maxn][maxn];
int vis[maxn];
int dis[maxn];
string name[maxn];
int got(int x,int y)
{
int tot=0;
for(int i=0;i<7;i++)
{
if(name[x][i]!=name[y][i])tot++;
}
return tot;
}
int main()
{
ios::sync_with_stdio(false);cin.tie(0);
cin>>n;
while(n)
{
for(int i=1;i<=n;i++)cin>>name[i];
memset(g,0,sizeof(g));
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)
{
for(int j=1;j<i;j++)
{
g[i][j]=g[j][i]=got(i,j);
}
}
int tot=0;
memset(dis,63,sizeof(dis));
int pos=1;dis[1]=0;
for(int i=1;i<n;i++)
{
vis[pos]=1;
for(int j=1;j<=n;j++)
{
if(!vis[j]&&g[pos][j]<dis[j])dis[j]=g[pos][j];
}
int s=11000000;
for(int j=1;j<=n;j++)
{
if(!vis[j])
{
if(dis[j]<s)
{
s=dis[j];
pos=j;
}
}
}
tot+=dis[pos];
}
// cout<<tot<<endl;
cout<<"The highest possible quality is 1/"<<tot<<"."<<endl;
cin>>n;
}
return 0;
}