POJ - 1789 Truck History(最小生成树简单题)
2015-09-10 16:56
567 查看
Truck History
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
Time Limit: 2000MS | Memory Limit: 65536KB | 64bit IO Format: %I64d & %I64u |
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.
#include<iostream> #include<cstring> #include<cstdio> #include<algorithm> #include<string> using namespace std; const int mnx = 2000 + 100; const int mxe = mnx*(mnx - 1) / 2; struct edge { int u, v, c; bool operator < (edge &b)const { return c < b.c; } }e[mxe]; int fa[mnx]; int n, m; string s[mnx]; int dis(string a, string b) { int ret = 0; for (int i = 0; i < a.length(); i++) { if (a[i] != b[i]) ret++; } return ret; } int find(int t) { if (fa[t] != t) fa[t] = find(fa[t]); return fa[t]; } int kruskal() { sort(e + 1, e + m + 1); for (int i = 1; i <= n; i++) fa[i] = i; int ret = 0; for (int i = 1; i <= m; i++) { int u = e[i].u, v = e[i].v, c = e[i].c; u = find(u), v = find(v); if (u != v) { fa[u] = v; ret += c; } } return ret; } int main() { while (scanf("%d", &n) != EOF && n) { for (int i = 1; i <= n; i++) cin >> s[i]; m = n*(n - 1) / 2; int nume = 1; for (int i = 1; i <= n; i++) for (int j = i + 1; j <= n; j++) { e[nume].u = i; e[nume].v = j; e[nume].c = dis(s[i], s[j]); nume++; } int ans = kruskal(); printf("The highest possible quality is 1/%d.\n", ans); } }
相关文章推荐
- UVa 1602:Lattice Animals(BFS)
- MFC 通信方面遇到的问题
- [转]apache的源码安装详细过程全纪录
- JS重定向跳转代码
- 从决策树学习谈到贝叶斯分类算法、EM、HMM
- delegate为什么用ASSIGN 而不是retain
- android eventbus
- HashTable 与 HashMap 异同
- poj 1742
- 转载:天涯——散文天下——《甄环传与宫心计》——作者:南方孤驴
- ESB 客户端调用 处理类
- poj_1988 并查集
- 邓小平农村建设思想
- 基于原生JS移动端响应式解决方案——AUTOSTRAP
- 指针函数和函数指针
- cocos2dx eclopse不编译C++部分代码
- Sql 优化
- confluence-5.4.4 破解安装
- Centos 防火墙管理
- 前端代码说明v1.1.0