POJ-1789-Truck History
2016-08-02 08:07
204 查看
Truck History
DescriptionAdvanced 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 lowercaseletters (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 typeswere 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 differentletters 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 as1/Σ(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.InputThe 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 thatthe 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.OutputFor 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
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 24666 | Accepted: 9610 |
4 aaaaaaa baaaaaa abaaaaa aabaaaa 0Sample Output
The highest possible quality is 1/3.
#include<string.h>#include<stdio.h>using namespace std;const int MAXN = 2001;const int INF = 0x3f3f3f;int Map[MAXN][MAXN], dis[MAXN];char s[MAXN][100];bool vis[MAXN];int f(char s1[], char s2[]) //判断两个字符串中同一位置不同字符的个数{int k = 0;for(int i = 0;i<7;++i){if(s1[i]!=s2[i])++k;}return k;}int main(){int n;while(~scanf("%d",&n)&&n){memset(Map,0,sizeof(Map));for(int i= 0;i<n;++i){scanf("%s",s[i]);for(int j = 0;j<i;++j)Map[i][j] = Map[j][i] = f(s[i], s[j]); //<span style="font-family: 'Courier New', Courier, monospace;"> 两点间距离就是字符串中不同字符的个数</span>}memset(vis,0,sizeof(vis));int sum = 0, pos;for(int i = 0;i<n;++i)dis[i] = Map[0][i];vis[0] = true;for(int i = 0; i<n-1;++i) //Prim();{int MIN = INF;for(int j = 0;j<n;++j){if(dis[j]<MIN&&!vis[j]){MIN = dis[j];pos = j;}}vis[pos] = true;sum+=MIN;for(int j = 0;j<n;++j){if(!vis[j]&&Map[pos][j]<dis[j])dis[j] = Map[pos][j];}}printf("The highest possible quality is 1/%d.\n",sum);}return 0;}[/code]
相关文章推荐
- POJ 1789 Truck History
- POJ 1789 Truck History
- POJ 1789 Truck History(最小生成树)
- poj 1789 Truck History【最小生成树prime】
- POJ 1789 Truck History
- POJ - 1789 Truck History
- POJ1789 Truck History(最小生成树)
- poj 1789 Truck History 最小生成树
- poj 1789 Truck History 最小生成树
- POJ 1789 Truck History
- poj 1789 Truck History
- POJ 1789 Truck History
- poj 1789 -- Truck History
- 最小生成树-水题-POJ-1789-Truck History
- poj 1789 Truck History(java + prim)
- poj 1789 Truck History
- poj 1789 Truck History
- POJ 1789:Truck History(prim&&最小生成树)
- POJ-1789-Truck History-最小生成树
- POJ ~ 1789 ~ Truck History (最小生成树)