首页 > 其他分享 >HDU 4081 Qin Shi Huang's National Road System(次小树,4级)

HDU 4081 Qin Shi Huang's National Road System(次小树,4级)

时间:2023-02-24 11:32:53浏览次数:56  
标签:4081 HDU Qin int edge Shi best dis



A - Qin Shi Huang's National Road System

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u


Submit  ​​Status​


System Crawler  (2013-08-20)



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. 


HDU 4081	 Qin Shi Huang


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.


 


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


2
4
1 1 20
1 2 30
200 2 80
200 1 100
3
1 1 20
1 2 30
2 2 40


 


Sample Output


65.00
70.00

思路:次小树差不多


#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<queue>
#include<algorithm>
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define clr(f,z) memset(f,z,sizeof(f))
using namespace std;
const int mp=1009;
const double oo=1e18;
class Edge
{
public:
int v,next;double w;
};
class _point
{
public:double x,y;int w;
double get_dis(_point t)
{
return sqrt((x-t.x)*(x-t.x)+(y-t.y)*(y-t.y));
}
}p[mp];
class MST_tree
{
public:
int head[mp],edge;
double edge_max[mp][mp],dis[mp];
Edge e[mp*mp*2];
int n;
bool vis[mp];
int pre[mp];///x's father
void clear()
{
clr(head,-1);edge=0;
}
void add(int u,int v,double w)
{
e[edge].v=v;e[edge].w=w;e[edge].next=head[u];head[u]=edge++;
}
double prim()
{
FOR(i,0,n)dis[i]=oo,vis[i]=0;
FOR(i,0,n)FOR(j,0,n)edge_max[i][j]=0;
int v;
for(int i=head[1];~i;i=e[i].next)
{ v=e[i].v;
dis[v]=min(dis[v],e[i].w);
}
int best;double MAX;
double MST=0;
vis[1]=1;dis[1]=0;
FOR(i,0,n)pre[i]=1;
FOR(i,2,n)
{
best=-1;MAX=oo;
FOR(j,1,n)
if(!vis[j]&&dis[j]<MAX)
MAX=dis[j],best=j;
vis[best]=1;MST+=MAX;
for(int j=head[best];~j;j=e[j].next)///get max_tree_edge
{
v=e[j].v;
if(vis[v])///visted
{
if(edge_max[v][ pre[best] ]<dis[best])
{
edge_max[v][ best ]=edge_max[ best ][v]=dis[best];
}
else
{
edge_max[v][ best ]=edge_max[ best ][v]=edge_max[ v ][ pre[best] ];
}
}
}
for(int j=head[best];~j;j=e[j].next)
{
v=e[j].v;
if(vis[v])continue;
if(dis[v]>e[j].w)
{dis[v]=e[j].w;
pre[v]=best;
}
}
}
return MST;
}
void get_ans()
{ int v;
double MST=prim();
double ans=0,A;
for(int i=1;i<=n;++i)
for(int j=head[i];~j;j=e[j].next)
{
v=e[j].v;
A=p[v].w+p[i].w;
ans=max(ans,A/(MST-edge_max[i][v]));
}
//cout<<ans<<endl;
printf("%.2lf\n",ans);
}
}sp;
int main()
{
int cas;
while(~scanf("%d",&cas))
{
while(cas--)
{
int n;
scanf("%d",&n);sp.n=n;
sp.clear();
FOR(i,1,n)
{
scanf("%lf%lf%d",&p[i].x,&p[i].y,&p[i].w);
}
FOR(i,1,n)FOR(j,i+1,n)
{ double dis=p[i].get_dis(p[j]);
// cout<<i<<" -> "<<j<<" "<<dis<<endl;
sp.add(i,j,dis);sp.add(j,i,dis);
}
// cout<<sp.prim()<<endl;
sp.get_ans();
}
}
}






标签:4081,HDU,Qin,int,edge,Shi,best,dis
From: https://blog.51cto.com/u_15953788/6083320

相关文章

  • hdu 4284 Travel(压缩DP,4级)
    TravelTimeLimit:10000/5000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):2641    AcceptedSubmission(s):724......
  • hdu 2608 0 or 1(数论)
    0or1TimeLimit:6000/2000MS(Java/Others)    MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):1659    AcceptedSubmission(s):418Pro......
  • HDU 2888 Check Corners (二维RMQ,3级)
    A-CheckCornersCrawlinginprocess...CrawlingfailedTimeLimit:10000MS    MemoryLimit:32768KB    64bitIOFormat:%I64d&%I64u​​Submit......
  • HDUOJ 2000-2100
    2024C语言合法标识符ProblemDescription输入一个字符串,判断其是否是C的合法标识符。 Input输入数据包含多个测试实例,数据的第一行是一个整数n,表示测试实例的个数,然......
  • [hdu 5307] He is Flying (FFT)
    题意给出长度为的数列,对于任意,求出区间和为的区间的长度之和题目分析有了几道fft题的经验,套路就是把可加性的计算化为幂的次数做多项式卷积有分别把看成两个多项式,做FF......
  • [HDU 5608]Function(莫比乌斯反演 + 杜教筛)
    题目描述有求只有最多组数据题目分析如此一来就可以杜教筛了,然而仅仅这样还是会T,于是我们在想一想如何筛出前面一部分的值令,根据莫比乌斯反演于是用筛出前项就行了......
  • HDU 1238 Substrings
    SubstringsTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):7699    AcceptedSubmission(s):3474......
  • HDU 1256 画8
    画8TimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):4645    AcceptedSubmission(s):2004Proble......
  • HDU 1219 AC Me
    ACMeTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):13482    AcceptedSubmission(s):5934Pro......
  • HDOJ2111 Saving HDU(背包问题)
    题目链接:​​SavingHDU​​这题是个背包问题,首先按照单价排序,然后,装的下就装,装不下就分割。importjava.util.Scanner;//背包问题publicclassMain{privatestaticScan......