poj 1789 Truck History
2013-08-10 18:50
302 查看
首先吐一下槽这是英语阅读训练啊、、、玛德,看不懂啊、、受不了啊,英语太水了啊、、呜呜呜呜呜
这是一道最小生成树的题啊、克鲁斯卡尔+并查集的路径压缩啊、、跟啸哥学习的啊、、自己不会路径压缩啊、、膜拜啊。。。
Truck History
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.
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
这是一道最小生成树的题啊、克鲁斯卡尔+并查集的路径压缩啊、、跟啸哥学习的啊、、自己不会路径压缩啊、、膜拜啊。。。
Truck History
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 15079 | Accepted: 5768 |
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.
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 <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> #include <iostream> #include <algorithm> using namespace std; struct Edge { int u, v, w; } edge[4000100]; char s[3100][10]; bool cmp(Edge a, Edge b) { return a.w < b.w; } int mark[2100], sum; int find(int x) { int k, j, r; r = x; while(r != mark[r]) r = mark[r]; k = x; while(k != r) { j = mark[k]; mark[k] = r; k = j; } return r; } void merge(int n) { int fu, fv; for(int i = 0; i < n; i++) { fu = find(edge[i].u); fv = find(edge[i].v); if(fu != fv) { sum += edge[i].w; mark[fu] = fv;//压缩路径,将父亲不同的点并在一起。 } } printf("The highest possible quality is 1/%d.\n",sum); } int main() { int n, i, j, k, num, t; while(~scanf("%d",&n) && n) { for(i = 0; i < n; ++i) cin >>s[i]; for(i = 0; i < n; ++i) mark[i] = i; for(i = 0,t = 0; i < n; ++i) for(j = i+1; j < n; ++j) { for(num = 0,k = 0; k < 7; k++) if(s[i][k] != s[j][k]) ++num; edge[t].u = i; edge[t].v = j; edge[t++].w = num; } sort(edge, edge+t, cmp); sum = 0; merge(t); } return 0; }
相关文章推荐
- POJ 1789 Truck History
- poj 1789 Truck History
- POJ 刷题系列:1789. Truck History
- POJ 1789 Truck History
- poj 1789 Truck History 最小生成树
- poj1789——Truck History
- POJ1789 Truck History 最小生成树
- poj 1789 Truck History(最小生成树)
- POJ 1789 、Truck History
- POJ1789--Truck History(最小生成树)
- POJ - 1789 Truck History
- POJ 1789 Truck History
- poj 1789 Truck History
- poj 1789 Truck History
- poj 1789 Truck History
- poj1789 Truck History
- POJ 1789 Truck History 解题报告
- POJ 1789 Truck History
- 最小生成树--Truck History(poj 1789);
- zoj 2158 poj 1789 Truck History (Prim)