hdu-4081 Qin Shi Huang's National Road System(最小生成树+bfs)
2016-04-13 15:54
579 查看
题目链接:
Memory Limit: 32768/32768 K (Java/Others)
[align=left]Problem Description[/align]
[align=left] [/align]
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.
[align=left]Input[/align]
[align=left] [/align]
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.
[align=left]Output[/align]
[align=left] [/align]
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.
[align=left]Sample Input[/align]
[align=left] [/align]
2
4
1 1 20
1 2 30
200 2 80
200 1 100
3
1 1 20
1 2 30
2 2 40
[align=left]Sample Output[/align]
[align=left] [/align]
65.00
70.00
题意:
给了n个点的坐标和这个点的权值,问形成一棵树,这棵树上有一个条边,这条边的两个点的权值和比这棵树上除去这条边的所有边的和最大;
思路:
先生成最小树,再枚举要消除的那条边,bfs找到消除这条边后生成的两棵子树里的最大权的点就是要重新连接的点了;
AC代码:
Qin Shi Huang's National Road System
Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)
[align=left]Problem Description[/align]
[align=left] [/align]
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.
[align=left]Input[/align]
[align=left] [/align]
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.
[align=left]Output[/align]
[align=left] [/align]
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.
[align=left]Sample Input[/align]
[align=left] [/align]
2
4
1 1 20
1 2 30
200 2 80
200 1 100
3
1 1 20
1 2 30
2 2 40
[align=left]Sample Output[/align]
[align=left] [/align]
65.00
70.00
题意:
给了n个点的坐标和这个点的权值,问形成一棵树,这棵树上有一个条边,这条边的两个点的权值和比这棵树上除去这条边的所有边的和最大;
思路:
先生成最小树,再枚举要消除的那条边,bfs找到消除这条边后生成的两棵子树里的最大权的点就是要重新连接的点了;
AC代码:
/*4081 452MS 13060K 2555 B G++ 2014300227*/ #include <bits/stdc++.h> using namespace std; const int N=1e6+4; typedef long long ll; const ll mod=1e9+7; const double PI=acos(-1.0); int n,p[1003],vis[1003]; int findset(int x) { if(x==p[x])return x; return p[x]=findset(p[x]); } void same(int x,int y) { int fx=findset(x),fy=findset(y); if(fx!=fy)p[fx]=p[fy]; } struct node { double x,y; int pop; }; node point[1004]; struct Edge { int l,r,pop; double len; }edge ; int cmp(Edge a,Edge b) { return a.len<b.len; } queue<Edge>qu; vector<int>ve[1003]; int bfs(int num1,int num2)//bfs找两棵子树里权值最大的点; { memset(vis,0,sizeof(vis)); vis[num2]=1; queue<int>q; q.push(num1); int mmax=0; while(!q.empty()) { int fr=q.front(); q.pop(); mmax=max(mmax,point[fr].pop); int si=ve[fr].size(); for(int i=0;i<si;i++) { if(!vis[ve[fr][i]]) { vis[ve[fr][i]]=1; q.push(ve[fr][i]); } } } return mmax; } int main() { int t; scanf("%d",&t); while(t--) { scanf("%d",&n); int cnt=0; for(int i=1;i<=n;i++) { ve[i].clear(); p[i]=i; scanf("%lf%lf%d",&point[i].x,&point[i].y,&point[i].pop); } for(int i=1;i<=n;i++) { for(int j=i+1;j<=n;j++) { edge[cnt].l=i; edge[cnt].r=j; edge[cnt].pop=point[i].pop+point[j].pop; edge[cnt++].len=sqrt((point[i].x-point[j].x)*(point[i].x-point[j].x)+(point[i].y-point[j].y)*(point[i].y-point[j].y)); } } sort(edge,edge+cnt,cmp); double dis=0; for(int i=0;i<cnt;i++) { if(findset(edge[i].l)!=findset(edge[i].r)) { same(edge[i].l,edge[i].r); dis+=edge[i].len; qu.push(edge[i]); ve[edge[i].l].push_back(edge[i].r); ve[edge[i].r].push_back(edge[i].l); } } //cout<<"@"<<endl; double ans=0; while(!qu.empty()) { // memset(vis,0,sizeof(vis)); int ls=qu.front().l,rs=qu.front().r; int ans1=bfs(ls,rs); int ans2=bfs(rs,ls); ans=max(ans,(ans1+ans2)*1.0/(dis-qu.front().len)); qu.pop(); } printf("%.2lf\n",ans); } return 0; }
相关文章推荐
- hdu 1087 Super Jumping! Jumping! Jumping! dp
- Android使用Glide库小技巧
- SSLSplit实现中间人攻击
- 程序员的“非程序员”之路
- 基本类型和引用类型,执行环境和作用域 7fe0
- html里name和id的区别
- 不同内核浏览器的差异
- nyoj1239(最小生成树)
- lightoj 1148 - Mad Counting 简单数学
- The Pilots Brothers' refrigerator
- 稀疏矩阵的压缩存储
- NDK在eclipse下的配置及错误解决
- Android动画之旅一开篇动画简介
- git 使用(ssh key创建和github使用)
- HDU 2639 Bone Collector II(01背包、第k优解)
- ListView中的CheckBox全选反选
- hdu 2993 & POJ 2018 MAX Average Problem(斜率dp)
- 实习日志-php-分别用print_r,var_dump,var_export打印数组
- 想从微博引流量?这样做,效果杠杠滴!
- 《UML for Java Programmers》读书笔记——第二章