poj--1789--Truck History(prim)
2015-11-27 19:49
381 查看
[align=center]Truck History[/align]
Submit
Status
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 t
o is the original type and t d the type derived from it and d(t
o,t d) 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
Sample Output
Source
CTU Open 2003
Time Limit: 2000MS | Memory Limit: 65536KB | 64bit IO Format: %I64d & %I64u |
Status
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 t
o is the original type and t d the type derived from it and d(t
o,t d) 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.
Source
CTU Open 2003
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int map[1010][1010]; int vis[1010]; char str[1010][9]; int n; int prim() { int sum=0; int minn,k; for(int i=1;i<n;i++) { minn=100000; for(int j=2;j<=n;j++) { if(!vis[j]&&map[1][j]<minn) { minn=map[1][j]; k=j; } } vis[k]=1; sum+=minn; for(int j=2;j<=n;j++) { if(!vis[j]&&map[k][j]<map[1][j]) map[1][j]=map[k][j]; } } return sum; } int main() { while(scanf("%d",&n),n) { memset(map,0,sizeof(map)); memset(vis,0,sizeof(vis)); memset(str,'\0',sizeof(str)); for(int i=1;i<=n;i++) scanf("%s",str[i]); for(int i=1;i<=n;i++) { for(int j=i+1;j<=n;j++) { for(int k=0;k<7;k++) { if(str[i][k]!=str[j][k]) map[i][j]++; } map[j][i]=map[i][j]; } } printf("The highest possible quality is 1/%d.\n",prim()); } return 0; }
相关文章推荐
- 工业4.0时代是挑战也是机遇
- 2015.11.27
- Nginx实现浏览器实时查看访问日志
- C语言中的循环应用练习
- NSURLSession使用实战教程
- poj--1789--Truck History(prim)
- 线性表的查找操作(线性表的顺序查找、二分查找、分块查找)
- CDA数据分析师培训笔记(四)20151121-20151122
- 新手代码
- SQLserver关于教学楼中教室在某个时间段是否被占用的数据库设计
- Android中使用Handler造成内存泄露的分析和解决
- 汇编清除CMOS密码
- Objective-C 笔记二 类、对象和方法
- xv6-----CPU alarm
- Jackson
- XListView注意事项
- 数据结构基础6.5:拓扑排序TopOrder
- [1076]:An Easy Task
- 外星人笔记本 键盘灯不亮解决 Alienware 13
- Objective-C 字典、可变字典