poj 1789 Truck History
来源:互联网 发布:如何申请淘宝小号 编辑:程序博客网 时间:2024/06/06 12:34
Truck History
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 23409 Accepted: 9079
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.
这道题将每个号码看成一个结点,两个结点的距离就是不同的字母数;
这样这道题就转化为一道求最小生成树的题目;
我使用了Kruskal算法解决这个问题;
#include<iostream>#include<cstdlib>#include<string>#include<algorithm>#include<cstdio>#include<cmath>#include<cstring>#include<stack>#include<queue>#include<iomanip>#include<map>#include<set>#define pi 3.14159265358979323846using namespace std;int N;struct Line{ int from; int to; int weight;}line[4000000];bool cmp(const Line &a,const Line &b){ return a.weight<b.weight;}int pre[2001];char str[2001][10];int cnt;//并查集int find(int x){ return pre[x]==x?x:pre[x]=find(pre[x]);}void Union(int x,int y){ pre[x]=y;}int Kruskal(){ int ans=0; for(int i=0;i<N;++i) pre[i]=i; for(int i=0;i<cnt;++i) { int x=find(line[i].from); int y=find(line[i].to); if(x!=y) { ans+=line[i].weight; Union(x,y); } } return ans;}int main(){ while(scanf("%d",&N)!=EOF&&N) { int ans=0; cnt=0; for(int i=0;i<N;++i) { scanf("%s",str[i]); for(int j=0;j<i;++j) { line[cnt].from=i; line[cnt].to=j; int temp=0;//算出每条边的权重 for(int k=0;k<7;++k) { if(str[i][k]!=str[j][k]) ++temp; } line[cnt++].weight=temp; } } sort(line,line+cnt,cmp); ans=Kruskal(); printf("The highest possible quality is 1/%d.\n",ans); } 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
- POJ 1127_Jack Straws
- Windows开启网络对时方法
- C#操作Access通用类实例
- 正则表达式基础(1)
- 监控session
- poj 1789 Truck History
- 【Android】TextView中Spannable对象的使用
- poj2407——水题
- Fragment 慕课网笔记
- EFI基本概念之Event
- 2286: [Sdoi]2011消耗战 ||【虚树】【树形DP】
- C#动态创建Access数据库及表的方法
- mfc中控件的使用可以查看本地pdf文件(vs2013环境)
- 初次走入深搜DFS