杭电4081 Qin Shi Huang's National Road System(次小生成树)
来源:互联网 发布:mac网页图片显示问号 编辑:程序博客网 时间:2024/04/30 07:49
Qin Shi Huang's National Road System
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3419 Accepted Submission(s): 1197
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/*题目大意:有n个点,每个点有个点权值,求任意两点的点权值之和与生成树权值中减掉这两点的路径的比值最大心得:刚做了一道次小生成树,还好,就是忘了注释掉wa了一次*/#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>using namespace std;const int MAX=1002;const double INF=100000+10.0;struct Point{int x,y;double w;};double Get_Dis(Point a,Point b){return sqrt((a.x-b.x)*(a.x-b.x)*1.0+(a.y-b.y)*(a.y-b.y)*1.0);}int N,M;double map[MAX][MAX],path[MAX][MAX];bool used[MAX][MAX],vis[MAX];double Prim(){double Mst=0;double d[MAX];int pre[MAX];memset(d,0,sizeof(d));memset(pre,0,sizeof(pre));for(int i=1;i<=N;i++){d[i]=map[1][i];pre[i]=1;//printf("%lf\n",d[i]);}vis[1]=true;int u;for(int i=1;i<N;i++){double minV=INF;for(int j=1;j<=N;j++){if(!vis[j]&&d[j]<minV){minV=d[j];u=j;}}if(minV==INF) return Mst;//printf("%lf\n",Mst);vis[u]=true;Mst+=d[u];used[u][pre[u]]=used[pre[u]][u]=true;for(int j=1;j<=N;j++){if(vis[j]&&j!=u){//一定要记得加 j!=upath[u][j]=path[j][u]=max(path[pre[u]][j],d[u]);}if(!vis[j]){if(d[j]>map[u][j]){pre[j]=u;d[j]=map[u][j];}}}}return Mst;}int main(){int T;scanf("%d",&T);while(T--){scanf("%d",&N);for(int i=1;i<=N;i++){//initial for(int j=1;j<=N;j++){if(i==j){map[i][j]=0;} else map[i][j]=map[j][i]=INF;path[j][i]=path[i][j]=0;used[j][i]=used[i][j]=0;vis[i]=0;}}Point R[MAX];for(int i=1;i<=N;i++){scanf("%d%d%lf",&R[i].x,&R[i].y,&R[i].w);}for(int i=1;i<=N;i++){for(int j=i+1;j<=N;j++){map[i][j]=map[j][i]=Get_Dis(R[i],R[j]);//printf("i=%d j=%d %lf\n",i,j,map[i][j]);}}double Mst=Prim();//printf("%.2lf\n",Mst);double ans=-1.0;for(int i=1;i<=N;i++){for(int j=1;j<=N;j++){if(i!=j){if(used[i][j]){ans=max(ans,(R[i].w+R[j].w)/(Mst-map[i][j]));}if(!used[i][j]){ans=max(ans,(R[i].w+R[j].w)/(Mst-path[i][j]));} //printf("%lf %lf\n",R[i].w,R[j].w);}}}printf("%.2lf\n",ans);}return 0;}
0 0
- 杭电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(次小生成树)
- hdoj 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(次小生成树-Kruskal)
- HDU 4081 Qin Shi Huang's National Road System (2011北京-次小生成树)
- 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 2721(字符串处理,位运算 暴力)
- HDU 4946 凸包 判重点 多校练习赛8 1002
- Android之ListView原理学习与优化总结
- 递归及递推问题系列之 报数问题
- OC中字符串的简单操作
- 杭电4081 Qin Shi Huang's National Road System(次小生成树)
- poj 3277 City Horizon 线段树加上离散化
- 关于android:launchMode 的有趣现象
- 使用AsyncHttpClient 实现get和post请求
- HDU 4946 Area of Mushroom 凸包 第八次多校
- hdu 1501 Zipper(记忆化DFS)
- HDU 4951 Multiplication table 阅读题
- Oracle创建用户表空间授权
- 存储关于带内管理和带外管理概念