Hdoj 4081 Qin Shi Huang's National Road System(次小生成树)
来源:互联网 发布:乌克兰女人在中国知乎 编辑:程序博客网 时间:2024/06/05 02:14
Qin Shi Huang's National Road System
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5458 Accepted Submission(s): 1915
Problem Description
During the Warring States Period of ancient China(476 BC to 221 BC), there were seven kingdoms in China ---- they were Qi, Chu, Yan, Han, Zhao, Wei and Qin. Ying Zheng was the king of the kingdom Qin. Through 9 years of wars, he finally conquered all six other kingdoms and became the first emperor of a unified China in 221 BC. That was Qin dynasty ---- the first imperial dynasty of China(not to be confused with the Qing Dynasty, the last dynasty of China). So Ying Zheng named himself "Qin Shi Huang" because "Shi Huang" means "the first emperor" in Chinese.
Qin Shi Huang undertook gigantic projects, including the first version of the Great Wall of China, the now famous city-sized mausoleum guarded by a life-sized Terracotta Army, and a massive national road system. There is a story about the road system:
There were n cities in China and Qin Shi Huang wanted them all be connected by n-1 roads, in order that he could go to every city from the capital city Xianyang.
Although Qin Shi Huang was a tyrant, he wanted the total length of all roads to be minimum,so that the road system may not cost too many people's life. A daoshi (some kind of monk) named Xu Fu told Qin Shi Huang that he could build a road by magic and that magic road would cost no money and no labor. But Xu Fu could only build ONE magic road for Qin Shi Huang. So Qin Shi Huang had to decide where to build the magic road. Qin Shi Huang wanted the total length of all none magic roads to be as small as possible, but Xu Fu wanted the magic road to benefit as many people as possible ---- So Qin Shi Huang decided that the value of A/B (the ratio of A to B) must be the maximum, which A is the total population of the two cites connected by the magic road, and B is the total length of none magic roads.
Would you help Qin Shi Huang?
A city can be considered as a point, and a road can be considered as a line segment connecting two points.
Qin Shi Huang undertook gigantic projects, including the first version of the Great Wall of China, the now famous city-sized mausoleum guarded by a life-sized Terracotta Army, and a massive national road system. There is a story about the road system:
There were n cities in China and Qin Shi Huang wanted them all be connected by n-1 roads, in order that he could go to every city from the capital city Xianyang.
Although Qin Shi Huang was a tyrant, he wanted the total length of all roads to be minimum,so that the road system may not cost too many people's life. A daoshi (some kind of monk) named Xu Fu told Qin Shi Huang that he could build a road by magic and that magic road would cost no money and no labor. But Xu Fu could only build ONE magic road for Qin Shi Huang. So Qin Shi Huang had to decide where to build the magic road. Qin Shi Huang wanted the total length of all none magic roads to be as small as possible, but Xu Fu wanted the magic road to benefit as many people as possible ---- So Qin Shi Huang decided that the value of A/B (the ratio of A to B) must be the maximum, which A is the total population of the two cites connected by the magic road, and B is the total length of none magic roads.
Would you help Qin Shi Huang?
A city can be considered as a point, and a road can be considered as a line segment connecting two points.
Input
The first line contains an integer t meaning that there are t test cases(t <= 10).
For each test case:
The first line is an integer n meaning that there are n cities(2 < n <= 1000).
Then n lines follow. Each line contains three integers X, Y and P ( 0 <= X, Y <= 1000, 0 < P < 100000). (X, Y) is the coordinate of a city and P is the population of that city.
It is guaranteed that each city has a distinct location.
For each test case:
The first line is an integer n meaning that there are n cities(2 < n <= 1000).
Then n lines follow. Each line contains three integers X, Y and P ( 0 <= X, Y <= 1000, 0 < P < 100000). (X, Y) is the coordinate of a city and P is the population of that city.
It is guaranteed that each city has a distinct location.
Output
For each test case, print a line indicating the above mentioned maximum ratio A/B. The result should be rounded to 2 digits after decimal point.
Sample Input
241 1 201 2 30200 2 80200 1 10031 1 201 2 302 2 40
Sample Output
65.0070.00#include<iostream>#include<stdlib.h>#include<time.h>#include<string.h>#include<cmath>#include<cstdio>#define inf 0x3f3f3f3f#define ll long longint n;using namespace std;int pre[1010];bool vis[1010],use[1010][1010];struct node{ int a,b,c;}q[1010];double dis[1010],Max[1010][1010],Map[1010][1010];double prim(){ int i,j,k; memset(vis,false,sizeof(vis)); memset(use,false,sizeof(use)); memset(Max,0,sizeof(Max)); for(i=1; i<=n; i++) { dis[i]=Map[1][i]; pre[i]=1; } vis[1]=true; int po;double ma,s=0; for(j=1; j<n; j++) { ma=inf; po=-1; for(i=1; i<=n; i++) { if(!vis[i]&&ma>dis[i]) { ma=dis[i]; po=i; } } vis[po]=true; use[po][pre[po]]=use[pre[po]][po]=true; s+=ma; for(i=1;i<=n;i++) { if(vis[i]&&i!=po)//必须是i!=po Max[po][i]=Max[i][po]=max( Max[pre[po] ][i],dis[po] ); if(!vis[i]&&dis[i]>Map[po][i]) { dis[i]=Map[po][i]; pre[i]=po; } } } return s;}int main(){ int i,j,k; int cla; scanf("%d",&cla); while(cla--) { scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d%d%d",&q[i].a,&q[i].b,&q[i].c); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { if(i!=j) Map[j][i]=Map[i][j]=sqrt((q[i].a-q[j].a)*(q[i].a-q[j].a)+(q[i].b-q[j].b)*(q[i].b-q[j].b)); else Map[i][j]=Map[j][i]=0; } } double ans=prim(); double tmp=-1; for(i=1;i<=n;i++) { for(j=1;j<=n;j++) { if(i==j) continue; if(use[i][j]) { tmp=max(tmp,(q[i].c+q[j].c)/(ans-Map[i][j])); } else tmp=max(tmp,(q[i].c+q[j].c)/(ans-Max[i][j]) ); } } printf("%.2lf\n",tmp); } return 0;}
0 0
- hdoj 4081 Qin Shi Huang's National Road System 【次小生成树变形】
- HDOJ 4081 Qin Shi Huang's National Road System (次小生成树变形--prime)
- Hdoj 4081 Qin Shi Huang's National Road System(次小生成树)
- hdoj 4081 Qin Shi Huang's National Road System(次小生成树变形)
- 【hdoj 4081】 Qin Shi Huang's National Road System 【次小生成树 应用变形】
- HDOJ 4801 Qin Shi Huang's National Road System 次小生成树
- HDU 4081 Qin Shi Huang's National Road System (次小生成树算法)
- hdu 4081 Qin Shi Huang's National Road System(次小生成树)
- hdu 4081 Qin Shi Huang's National Road System(次小生成树变形)
- hdu 4081 Qin Shi Huang's National Road System(次小生成树变形)
- hdu 4081 Qin Shi Huang's National Road System (次小生成树的变形)
- HDU 4081 Qin Shi Huang's National Road System 最小/次小生成树的性质
- HDU 4081 Qin Shi Huang's National Road System (次小生成树)
- HDU 4081 Qin Shi Huang's National Road System (枚举次小生成树)
- 次小生成树学习小记 Hdu 4081 Qin Shi Huang's National Road System (模板)
- hdu 4081 Qin Shi Huang's National Road System(次小生成树)
- 杭电4081 Qin Shi Huang's National Road System(次小生成树)
- HDU 4081 Qin Shi Huang's National Road System 次小生成树
- LightOJ-1370 Bi-shoe and Phi-shoe
- Java对象池技术的原理及其实现
- 理解LSTM网络
- 编译过程的五个阶段
- Xcode自动注释插件:VVDocumenter-Xcode
- Hdoj 4081 Qin Shi Huang's National Road System(次小生成树)
- Java 文件操作
- [leedcode oj 8]String to Integer (atoi)
- 稀疏矩阵运算器
- atlassian JIRA 插件开发(八) — MVC实现
- 实时数据库
- 数值的整数次方
- C语言冒泡排序法分析及代码实现
- UVA 12657 Boxes in a Line