Qin Shi Huang's National Road System
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2234 Accepted Submission(s): 806
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
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
Source
Recommend
lcy
题意是说有n个城市,给你每个城市的坐标和人口,现在要使这n个城市相连,并且保证A/B最大,A代表这条路连接连个城市的总人口,B是代表除了这条路以外的所有路之和。
思路就是按照次小生成树的求法,先求出最小生成树,然后枚举边,求最小的。
#include<stdio.h>
#include<string.h>
#include<math.h>
#define M 1005
#define inf 0x3f3f3f
double g[M][M],dis[M],max_g[M][M];
int pre[M];
bool vis[M];
double ans;
int n;
struct node
{
int x,y,p;
} city[M];
double distance(node a,node b)
{
double len=(a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);
return sqrt(len*1.0);
}
void prime()
{
int k;
double mm;
for(int i=1; i<=n; i++)
{
dis[i]=inf;
pre[i]=i;
vis[i]=false;
}
dis[1]=0;
ans=0;
for(int i=1; i<=n; i++)
{
mm=inf;
for(int j=1; j<=n; j++)
if(!vis[j]&&dis[j]<mm)
{
k=j;
mm=dis[j];
}
ans+=mm;
int u=pre[k];
for(int j=1; j<=n; j++)
if(vis[j])
{
if(max_g[j][u]<mm)
max_g[j][k]=max_g[k][j]=mm;
else
max_g[j][k]=max_g[k][j]=max_g[j][u];
}
vis[k]=true;
for(int j=1; j<=n; j++)
if(!vis[j]&&dis[j]>g[j][k])
{
dis[j]=g[j][k];
pre[j]=k;
}
}
}
double solve()
{
int A;
double maxx=-1,B;
for(int i=1; i<=n; i++)
for(int j=1; j<i; j++)
{
A=city[i].p+city[j].p;
B=ans-max_g[i][j];
if(maxx<(A*1.0/B))
maxx=A*1.0/B;
}
return maxx;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1; i<=n; i++)
scanf("%d%d%d",&city[i].x,&city[i].y,&city[i].p);
for(int i=1; i<=n; i++)
for(int j=1; j<i; j++)
{
max_g[i][j]=max_g[j][i]=0;
g[i][j]=g[j][i]=distance(city[i],city[j]);
}
prime();
double count=solve();
printf("%.2f\n",count);
}
return 0;
}