POJ1789 Truck History
来源:互联网 发布:mac怎么在pdf上写字 编辑:程序博客网 时间:2024/05/27 20:31
Truck History
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 27320 Accepted: 10627
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.
Source
CTU Open 2003
思路:先讲下题意,有一个长度为7的字符串组成的车牌号,求从一个车牌派生到另一个车牌的最小权值,两个车牌之间的权值是指对应位置上不相等的字符的个数,思路其实也很简单,首先求解从某一车牌到另一车牌的权值,然后利用prim求解即可。
#include <cstdio>#include <cstring>#define INF 0x3f3f3f3fusing namespace std;char str[2005][10],dis[2005],vis[2005];int map[2005][2005];int n,ans;void Prim(){for(int i = 0; i < n; i ++){dis[i] = map[0][i];vis[i] = 0;}vis[0] = 1;int min,k;for(int i = 0; i < n-1; i ++){//外层循环n-1次 min = INF; k = 0;for(int j = 0; j < n; j ++){if(!vis[j] && dis[j] < min){min = dis[j];k = j;}}ans += min;vis[k] = 1;for(int j = 0; j < n; j ++){if(!vis[j] && dis[j] > map[k][j])dis[j] = map[k][j];}}}int main(){while(~scanf("%d",&n) && n){for(int i = 0; i < n; i ++){scanf("%s",&str[i]);}ans = 0;for(int i = 0; i < n; i ++)for(int j = 0; j < n; j ++)map[i][j] = i == j ? 0 : INF;for(int i = 0; i < n; i ++){//求任意两个字符串之间不相等的字符的个数 for(int j = i+1; j < n; j ++){int t = 0;for(int k = 0; k < 7; k ++){if(str[i][k] != str[j][k]){t ++;}}map[i][j] = map[j][i] = t;}}Prim();printf("The highest possible quality is 1/%d.\n",ans);}return 0;}
0 0
- POJ1789 Truck History
- Truck History(POJ1789)
- poj1789 - Truck History
- Truck History poj1789
- poj1789 Truck History
- poj1789--Truck History
- poj1789 Truck History
- poj1789 Truck History(Prim)
- POJ1789 Truck History【Prim】
- POJ1789--Truck History
- poj1789 Truck History
- POJ1789 Truck History
- POJ1789 Truck History
- POJ1789-Truck History .
- POJ1789 Truck History
- POJ1789 Truck History
- POJ1789 Truck History
- POJ1789 Truck History
- 设计模式原则—组合重用原则
- BZOJ 1221: [HNOI2001] 软件开发 最小费用最大流
- 【LeetCode笔记】Construct Binary Tree from Preorder and Inorder Traversal 前序、中序还原二叉树
- 自己动手实现简单对象关系库之概述
- 二、SpringApplication
- POJ1789 Truck History
- Linux内核线性地址空间布局
- SAP HANA关于触发器的深入理解
- QBC对数据库查询
- CodeForces
- Unsupervised dimensionality reduction via PCA
- bzoj 1937: [Shoi2004]Mst 最小生成树 (KM算法)
- 数据结构-归并排序
- rpc netty