POJ 1789 Truck History
来源:互联网 发布:淘宝网夏季女装上衣 编辑:程序博客网 时间:2024/06/05 17:02
Truck History
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 22929 Accepted: 8879
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
思路:很基础的一道最小生成树题目,理解题目,两个点的距离就是两行字母不同的个数,然后就能过了
AC代码:
#include <iostream>#include <cstring>#include <string>using namespace std;#define INF 0x3f3f3f3fconst int maxn=2000+5;int mp[maxn][maxn];string s[maxn];int vis[maxn],dis[maxn];void calc(int x){ int cnt=0; for(int i=0;i<x;i++){ cnt=0; for(int j=0;j<7;j++) if(s[i][j]!=s[x][j]) cnt++; mp[i][x]=mp[x][i]=cnt; }}void prim(int n){ int sum=0; for(int i=0;i<n;i++) dis[i]=mp[0][i]; vis[0]=1;dis[0]=0; for(int i=1;i<n;i++){ int minn=INF,p; for(int j=0;j<n;j++){ if(!vis[j] && minn>dis[j]){ minn=dis[j]; p=j; } } vis[p]=1; sum+=minn; for(int j=0;j<n;j++) if(!vis[j] && dis[j]>mp[p][j]){ dis[j]=mp[p][j]; } } cout<<"The highest possible quality is 1/"<<sum<<"."<<endl;}int main(){ int t; while(cin>>t && t){ memset(vis,0,sizeof(vis)); memset(mp,INF,sizeof(mp)); for(int i=0;i<t;i++){ cin>>s[i]; calc(i); } prim(t); } return 0;}
0 0
- 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
- 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
- POJ 1789 Truck History
- POJ 1789 Truck History
- 【剑指offer】5.3时间效率与空间效率的平衡——面试题34:丑数
- Spark性能优化——序列化、内存、并行度、数据存储格式、Shuffle
- NumPy的详细教程
- Android 中几个Context的区别,getApplicationContext(),Activity.this,getBaseContext()
- red5 + rtmp篇2
- POJ 1789 Truck History
- UIVIEW 设置圆角 +边框阴影
- 封装jquery适配seajs模式
- hdu 3367 Pseudoforest(伪森林)
- iOS开发UI篇—核心动画(UIView封装动画)
- 命令行的艺术
- CGContext小记
- 1 tornado入门
- 【剑指offer】5.3时间效率与空间效率的平衡——面试题35:第一个只出现一次的字符