poj1789 Truck Historyq
来源:互联网 发布:opengl mac性能差 编辑:程序博客网 时间:2024/05/16 07:25
Truck History
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 24649 Accepted: 9601
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.
这个题又看了好久的意思,感觉自己英语好渣啊QAQ。
这个题就是说给你个字符串表示卡车标示,让后规定每个卡车之间的距离是每个位置上不同字母的个数qwq,然后全部的卡车之间相加得到Σ(to,td)d(to,td),
取倒数最大就是这个和最小也就是求最小生成树~
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <string>#include <cmath>#include <map>using namespace std;const int inf=0x3f3f3f;int n;int tu[2002][2002];char s[2000][10];int vis[2005];int dis[2005];int prim(){ int i,j; for(i=0;i<n;++i) { dis[i]=tu[0][i]; vis[i]=0; } int mm,pos; int sum=0; vis[0]=1; for(i=0;i<n-1;++i) { mm=inf; for(j=0;j<n;++j) { if(!vis[j]&&dis[j]<mm) { mm=dis[j]; pos=j; } } vis[pos]=1; sum+=mm; for(j=0;j<n;++j)if(!vis[j]&&dis[j]>tu[pos][j])dis[j]=tu[pos][j]; } return sum;}int main(){ int i,j,k; while(~scanf("%d",&n)) { if(!n)break; for(i=0;i<n;++i) { scanf("%s",s[i]); } for(i=0;i<n;++i) for(j=i+1;j<n;++j) { int sum=0; for(k=0;k<7;++k) { if(s[i][k]!=s[j][k])sum++; } tu[i][j]=tu[j][i]=sum; } int ans=prim(); printf("The highest possible quality is 1/%d.\n",ans); } return 0;}
0 0
- poj1789 Truck Historyq
- POJ1789 Truck History
- Truck History(POJ1789)
- poj1789 - Truck History
- Truck History poj1789
- poj1789 Truck History
- poj1789--Truck History
- poj1789 Truck History
- poj1789 Truck History(Prim)
- POJ1789 Truck History【Prim】
- POJ1789--Truck History
- poj1789 Truck History
- POJ1789 Truck History
- POJ1789 Truck History
- POJ1789-Truck History .
- POJ1789 Truck History
- POJ1789 Truck History
- POJ1789 Truck History
- poj-1611-The Suspects【并查集】
- Error Domain=NSCocoaErrorDomain Code=3840 "JSON text did not start with array or object and option
- [实用]送你一个短小精悍的curl命令
- 使用Xmanager远程连接Linux RedHat 6.4图形桌面
- SGU 106 The equation (扩展GCD/多特判)
- poj1789 Truck Historyq
- 矩阵快速幂取模
- WEB开发中,输入框被弹起的虚拟键盘遮挡住原因收集
- list::remove_if()
- python 第五(6)章编程练习
- 算法导论之二项堆
- Javascript的面向对象语法
- unity 游戏例模式
- UVA 1401 Remember the Word