Qin Shi Huang's National Road System

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6407    Accepted Submission(s): 2239

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
题意:秦朝有n个城市,需要修建一些道路让任意两个城市(每个城市都有人口)都可以联通,徐福可以用用法力修一条路,这条路不需要劳动力,秦始皇希望其他的道路总长度
B尽量短,还希望连接的两个城市人口之和A尽量大,找到最大的A/B。
题解:这题的做法是去枚举每条边,如果枚举的这条边在最小生成树上,那么结果为 person[i]+person[j]/(MST-graph[i][j])
如果没在最小生成树上,那么加进去之后我们要删掉一条边,我们肯定是要i, j所在的环里面最大的边,这里就要用到次小生成树里面的path数组了. 结果为person[i]+person[j]/(MST-path[i][j])因为i - j不需要花费,所以不必再加上去.
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <math.h>
using namespace std;
typedef double type;
const int N = ;
const double INF = ;
struct Point
{
int x,y;
} p[N];
double graph[N][N];
int person[N];
int n,m;
int pre[N];
type path[N][N],low[N]; ///path[i][j]用于记录i到j路径上的权值最大的边
bool vis[N],used[N][N];
type prim(int pos,int n){
memset(used,false,sizeof(used));
memset(vis,false,sizeof(vis));
memset(path,,sizeof(path));
vis[pos]=true;
type cost = ;
for(int i=;i<=n;i++){
low[i]= graph[pos][i];
pre[i]=;
}
low[pos]=;
for(int i=;i<n;i++){
type Min = INF;
for(int j=;j<=n;j++){
if(!vis[j]&&low[j]<Min){
pos = j;
Min = low[j];
}
}
used[pre[pos]][pos] = used[pos][pre[pos]] = true;
cost+= Min;
vis[pos] = true;
for(int j=;j<=n;j++){
if(vis[j]&&j!=pos){
path[pos][j] = path[j][pos] = max(low[pos],path[j][pre[pos]]);
}
if(!vis[j]&&low[j]>graph[pos][j]){
low[j]=graph[pos][j];
pre[j] = pos;
}
}
}
return cost;
}
double dis(Point a,Point b)
{
return sqrt(1.0*((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y)));
}
void init()
{
for(int i=; i<=n; i++)
{
for(int j=; j<=n; j++)
{
if(i==j) graph[i][j] = ;
else graph[i][j] = INF;
}
}
} int main()
{
int tcase;
scanf("%d",&tcase);
while(tcase--)
{
scanf("%d",&n);
init();
for(int i=; i<=n; i++)
{
scanf("%d%d%d",&p[i].x,&p[i].y,&person[i]);
}
for(int i=;i<=n;i++){
for(int j=i+;j<=n;j++){
graph[i][j] = graph[j][i] = dis(p[i],p[j]);
}
}
double MST = prim(,n);
double Max = -;
for(int i=;i<=n;i++){ ///枚举所有的边
for(int j=;j<=n;j++){
if(i!=j){
if(used[i][j]){ ///如果枚举的边属于最小生成树,那么结果为 A/(MST-此边)
Max = max(Max,(person[i]+person[j])/(MST-graph[i][j]));
}else{ ///如果枚举的边不属于最小生成树,那么必定要删掉最小生成树中的一条边,删掉的肯定就是i-j之间最长的那条
Max = max(Max,(person[i]+person[j])/(MST-path[i][j]));
}
} }
}
printf("%.2lf\n",Max);
}
return ;
}

hdu 4081(次小生成树)的更多相关文章

  1. hdu 4081 Qin Shi Huang's National Road System(次小生成树prim)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4081 题意:有n个城市,秦始皇要修用n-1条路把它们连起来,要求从任一点出发,都可以到达其它的任意点. ...

  2. HDU 4081 Qin Shi Huang's National Road System 次小生成树变种

    Qin Shi Huang's National Road System Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/3 ...

  3. hdu 4081 Qin Shi Huang's National Road System (次小生成树)

    Qin Shi Huang's National Road System Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/3 ...

  4. HDU 4081 Qin Shi Huang's National Road System [次小生成树]

    题意: 秦始皇要建路,一共有n个城市,建n-1条路连接. 给了n个城市的坐标和每个城市的人数. 然后建n-2条正常路和n-1条魔法路,最后求A/B的最大值. A代表所建的魔法路的连接的城市的市民的人数 ...

  5. HDU 4081Qin Shi Huang's National Road System(次小生成树)

    题目大意: 有n个城市,秦始皇要修用n-1条路把它们连起来,要求从任一点出发,都可以到达其它的任意点.秦始皇希望这所有n-1条路长度之和最短.然后徐福突然有冒出来,说是他有魔法,可以不用人力.财力就变 ...

  6. HDU 4756 Install Air Conditioning(次小生成树)

    题目大意:给你n个点然后让你求出去掉一条边之后所形成的最小生成树. 比較基础的次小生成树吧. ..先prime一遍求出最小生成树.在dfs求出次小生成树. Install Air Conditioni ...

  7. [kuangbin带你飞]专题八 生成树 - 次小生成树部分

    百度了好多自学到了次小生成树 理解后其实也很简单 求最小生成树的办法目前遇到了两种 1 prim 记录下两点之间连线中的最长段 F[i][k] 之后枚举两点 若两点之间存在没有在最小生成树中的边 那么 ...

  8. hdu4081 次小生成树变形

    pid=4081">http://acm.hdu.edu.cn/showproblem.php?pid=4081 Problem Description During the Warr ...

  9. kuangbin带你飞 生成树专题 : 次小生成树; 最小树形图;生成树计数

    第一个部分 前4题 次小生成树 算法:首先如果生成了最小生成树,那么这些树上的所有的边都进行标记.标记为树边. 接下来进行枚举,枚举任意一条不在MST上的边,如果加入这条边,那么肯定会在这棵树上形成一 ...

随机推荐

  1. Android开发——事件分发机制详解

    0. 前言   转载请注明出处:http://blog.csdn.net/seu_calvin/article/details/52566965 深入学习事件分发机制,是为了解决在Android开发中 ...

  2. I2C中24C02从地址设置

    从设备地址 首先,先看一下AT24C02的芯片资料,我们会发现AT24C02有三个地址A0,A1,A2.同时,我们会在资料的Device Address介绍发现I2C器件一共有七位地址码,还有一位是读 ...

  3. python-使用pip安装第三方库报UnicodeDecodeError: 'utf8' codec can't decode byte 0xcb in position 7: invalid continuation byte 错误解决方案

    在python 的安装目录下找到Lib\ntpath.py文件,找到def join(path, *paths):方法,添加如下两行语句: reload(sys) sys.setdefaultenco ...

  4. winform对图片进行灰度处理

    //图片进行灰度处理 //originalImage为原图像 返回灰度图像 private Bitmap GrayImage(Bitmap originalImage) { ImageAttribut ...

  5. vue零碎收集

    在组件中创建dom: let a=document.querySelector('.test'); let newDom=document.createElement("div") ...

  6. Java TCP通信概念及实例

    TCP/UDP 协议 通俗解释: TCP协议和UDP协议的区别类似于电话系统和邮政系统. <1>TCP:类似于电话系统,建立双向的通信通道,确定连接,话音顺序接听. <2>UD ...

  7. 软工实践Beta冲刺前装备

    过去存在的问题 组员之间缺乏沟通,前后端缺乏沟通协作 组员积极性不高 基础知识不够扎实 手动整合代码效率过低 我们已经做了哪些调整/改进 通过会议加强组员之间的交流 组长请喝了奶茶提高大家积极性 努力 ...

  8. GDI+实现双缓冲绘图方法一

    private void Form5_MouseMove(object sender, MouseEventArgs e) { int intOX = rectDrawArea.X; int intO ...

  9. selenium webdriver——JavaScript警告窗处理

    在WebDriver中处理JavaScript所生成的alert.confirm以及prompt,具体方法是使用switch_to_alert()方法定位到alert.confirm以及 prompt ...

  10. lua中是 ffi 解析 【是如何处理数据包的/pkt是如何传进去的】 fsfsfs

    lua中的ffi是如何解析的呢? 拿bcc中对proto的解析说起: metatype是有大学问的: ffi.metatype(ffi.typeof('struct ip_t'), { __index ...