HDOJ 4081 Qin Shi Huang's National Road System
2014-02-21 17:14
399 查看
次小生成树。。。
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2735 Accepted Submission(s): 983
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.
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
Source
2011 Asia Beijing Regional Contest
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn=1100,INF=0x3f3f3f3f;
const double eps=1e-8;
int N;
double G[maxn][maxn];
struct CITY
{
int x,y,p;
}city[maxn];
double getdist(CITY a,CITY b)
{
double dx=(double)((a.x-b.x)*(a.x-b.x));
double dy=(double)((a.y-b.y)*(a.y-b.y));
return sqrt(dx+dy);
}
int vis[maxn],fa[maxn];
double dist[maxn],mind[maxn][maxn];
double prim()
{
double mst=0.;
for(int i=0;i<=N;i++) fa[i]=i,dist[i]=99999,vis[i]=0;
memset(mind,0,sizeof(mind));
dist[1]=0;
int mark;double dd;
for(int k=0;k<N;k++)
{
mark=-1;dd=99999;
for(int i=1;i<=N;i++)
{
if(!vis[i]&&dd+eps>dist[i])
{
mark=i; dd=dist[i];
}
}
vis[mark]=true;mst+=dd;
for(int i=1;i<=N;i++)
{
if(i==mark) continue;
if(vis[i])
{
mind[i][mark]=mind[mark][i]=max(dd,mind[fa[mark]][i]);
}
}
for(int i=1;i<=N;i++)
{
if(vis[i]==0&&dist[i]+eps>G[mark][i])
{
dist[i]=G[mark][i];
fa[i]=mark;
}
}
}
return mst;
}
int main()
{
int tr;
scanf("%d",&tr);
while(tr--)
{
scanf("%d",&N);
for(int i=1;i<=N;i++)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
city[i]=(CITY){a,b,c};
}
memset(G,0,sizeof(G));
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
if(i==j) G[i][j]=0;
else
{
G[i][j]=G[j][i]=getdist(city[i],city[j]);
}
}
}
double mst=prim();
double ans=0;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
if(i==j) continue;
if(i!=fa[j]&&j!=fa[i])
{
ans=max(ans,(city[i].p+city[j].p)/(mst-mind[i][j]));
}
else
{
ans=max(ans,(city[i].p+city[j].p)/(mst-G[i][j]));
}
}
}
printf("%.2lf\n",ans);
}
return 0;
}
Qin Shi Huang's National Road System
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2735 Accepted Submission(s): 983
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.
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
Source
2011 Asia Beijing Regional Contest
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn=1100,INF=0x3f3f3f3f;
const double eps=1e-8;
int N;
double G[maxn][maxn];
struct CITY
{
int x,y,p;
}city[maxn];
double getdist(CITY a,CITY b)
{
double dx=(double)((a.x-b.x)*(a.x-b.x));
double dy=(double)((a.y-b.y)*(a.y-b.y));
return sqrt(dx+dy);
}
int vis[maxn],fa[maxn];
double dist[maxn],mind[maxn][maxn];
double prim()
{
double mst=0.;
for(int i=0;i<=N;i++) fa[i]=i,dist[i]=99999,vis[i]=0;
memset(mind,0,sizeof(mind));
dist[1]=0;
int mark;double dd;
for(int k=0;k<N;k++)
{
mark=-1;dd=99999;
for(int i=1;i<=N;i++)
{
if(!vis[i]&&dd+eps>dist[i])
{
mark=i; dd=dist[i];
}
}
vis[mark]=true;mst+=dd;
for(int i=1;i<=N;i++)
{
if(i==mark) continue;
if(vis[i])
{
mind[i][mark]=mind[mark][i]=max(dd,mind[fa[mark]][i]);
}
}
for(int i=1;i<=N;i++)
{
if(vis[i]==0&&dist[i]+eps>G[mark][i])
{
dist[i]=G[mark][i];
fa[i]=mark;
}
}
}
return mst;
}
int main()
{
int tr;
scanf("%d",&tr);
while(tr--)
{
scanf("%d",&N);
for(int i=1;i<=N;i++)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
city[i]=(CITY){a,b,c};
}
memset(G,0,sizeof(G));
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
if(i==j) G[i][j]=0;
else
{
G[i][j]=G[j][i]=getdist(city[i],city[j]);
}
}
}
double mst=prim();
double ans=0;
for(int i=1;i<=N;i++)
{
for(int j=1;j<=N;j++)
{
if(i==j) continue;
if(i!=fa[j]&&j!=fa[i])
{
ans=max(ans,(city[i].p+city[j].p)/(mst-mind[i][j]));
}
else
{
ans=max(ans,(city[i].p+city[j].p)/(mst-G[i][j]));
}
}
}
printf("%.2lf\n",ans);
}
return 0;
}
相关文章推荐
- Hadoop源码分析之数据节点的握手,注册,上报数据块和心跳
- 将白色背景图片变透明
- Officescan 常用的端口
- Justep X5深度体验及点评(转载)
- android 增量更新之 服务端 附带java 调用示例
- XMLHttpRequest 及其open()的用法
- MFC picture控件中显示图片
- 抉择让一个人成长
- 安装和使用memcached
- cocos2d-x 入门——hello world 解析
- Oracle00-918:未明确定义列的错误
- java 面试 复习 II
- 2014-2-21
- MVC设计模式含义和优点
- hdu 1596
- get_called_class — 后期静态绑定("Late Static Binding")类的名称
- Java中ArrayList类详解
- java服务端技术
- python load mat
- Git + SourceTree + Eclipse + Dashboard(服务器端)的代码管理