题目链接
Truck History
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 30488 Accepted: 11923
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 to is the original type and td the type derived from it and d(to,td) 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个字母。
题解:
枚举每一个串变成其他串的代价建图,一个串看做一个点,两个串之间的代价就是边权,建一个n个点的完全图,求最小生成树就可以了。
注意如果用Kruskal算法的话会超时(我超时了),随便找了个prim的板子套了套。
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int MAX = 2005;
const int MAXCOST = 0x7fffffff ;
int f[2005];
char s[2005][7];
int e[2005][2005];
int dif(int t1,int t2)
{
int ans = 0;
for (int i = 0; i < 7; i++)
{
if(s[t1][i] != s[t2][i])
ans++;
}
return ans;
}
int prim(int graph[][MAX], int n)
{
int lowcost[MAX];
int mst[MAX];
int i, j, min, minid, sum = 0;
for (i = 2; i <= n; i++)
{
lowcost[i] = graph[1][i];
mst[i] = 1;
}
mst[1] = 0;
for (i = 2; i <= n; i++)
{
min = MAXCOST;
minid = 0;
for (j = 2; j <= n; j++)
{
if (lowcost[j] < min && lowcost[j] != 0)
{
min = lowcost[j];
minid = j;
}
}
sum += min;
lowcost[minid] = 0;
for (j = 2; j <= n; j++)
{
if (graph[minid][j] < lowcost[j])
{
lowcost[j] = graph[minid][j];
mst[j] = minid;
}
}
}
return sum;
}
int main()
{
int n;
while(~scanf("%d",&n)&&n)
{
for (int i = 1; i <= n; i++)
{
scanf("%s",s[i]);
}
for (int i = 0; i <= n; i++)
{
for (int j = 0; j <= n; j++)
{
e[i][j] = MAXCOST;
}
}
int tot = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
if(i == j)continue;
e[i][j] = dif(i,j);
}
}
int ans = prim(e, n);
printf("The highest possible quality is 1/%d.\n",ans);
}
}