越獄之-卡车的历史(Truck History)
来源:互联网 发布:mysql 分区 分表 编辑:程序博客网 时间:2024/06/10 19:48
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.
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 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
4aaaaaaabaaaaaaabaaaaaaabaaaa0
Sample Output
The highest possible quality is 1/3./* 题目的意思是给出N个由7个字符组成的卡车编码,他们都是唯一的。 由每一对编码不同字符的数目来建立最小生成树,例如样例输入中 给出的第一个和第二个就有1个字符不同,类似于a[i][j]。输出是要求 输出生成树的权值之和的倒数。*/#include <algorithm>#include <cstdio>#include <cstring>#include <iostream>#include <queue>#include <stack>#include <vector>#include <cmath>#define INF 0x3f3f3f3fusing namespace std;char str[2010][8];bool vis[2010];int dis[2010];int f(char x[],char y[]){ int sum = 0; for(int i=0;i<7;i++) { if(x[i] != y[i]) sum++; } return sum;}int lp(int n){ int qmin,ans = 0,k,t; memset(vis,0,sizeof(vis)); vis[1] = 1; dis[1] = 0; for(int i=2;i<=n;i++) dis[i] = f(str[1],str[i]); for(int i=2;i<=n;i++) { qmin = INF; for(int j=1;j<=n;j++) { if(!vis[j] && qmin>dis[j]) { k = j; qmin = dis[j]; } } vis[k] = 1; ans+=qmin; for(int j=1;j<=n;j++) { if(!vis[j] && (t=f(str[k],str[j]))< dis[j]) { dis[j] = t; } } } return ans;}int main(){ int n; while(~scanf("%d",&n) && n) { for(int i=1;i<=n;i++) scanf("%s",str[i]); printf("The highest possible quality is 1/%d.\n",lp(n)); } return 0;}
0 0
- 越獄之-卡车的历史(Truck History)
- Truck History(汽车的历史)——最小生成树
- Truck History
- Truck History
- Truck History
- Truck History
- Truck History
- Truck History
- Truck History
- Truck History
- Truck History
- Truck History
- Truck History
- Truck History
- Truck History
- POJ之路11-1789 Truck History
- 【最小生成树之prim算法】POJ 1789---Truck History
- POJ1789 Truck History
- python 用pyftplib快速建设ftp
- 内存管理
- 机房收费系统问题总结(一)
- 先临三维 真的收购 天远三维啦 我的天啊
- PLSQL Developer常用设置及快捷键
- 越獄之-卡车的历史(Truck History)
- const与指针之间搭配使用的规则
- 在IT这条不归路上走得越来越远
- 2011 多项式求和
- 一些DP经典问题:HDU(hdoj) 2126,1176,2546,1159
- 如何准备机器学习工程师的面试 ?
- leetcode 51: N-Queens
- STM32 boot跳转到APP的Jump_Address()分析
- NOIP 2011TG 解题报告