【HDU1969】Pie(二分法)
来源:互联网 发布:java退格 编辑:程序博客网 时间:2024/06/09 14:34
点击打开题目
Pie
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13183 Accepted Submission(s): 4682
Problem Description
My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one piece of one pie, not several small pieces since that looks messy. This piece can be one whole pie though.
My friends are very annoying and if one of them gets a bigger piece than the others, they start complaining. Therefore all of them should get equally sized (but not necessarily equally shaped) pieces, even if this leads to some pie getting spoiled (which is better than spoiling the party). Of course, I want a piece of pie for myself too, and that piece should also be of the same size.
What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and they all have the same height 1, but the radii of the pies can be different.
My friends are very annoying and if one of them gets a bigger piece than the others, they start complaining. Therefore all of them should get equally sized (but not necessarily equally shaped) pieces, even if this leads to some pie getting spoiled (which is better than spoiling the party). Of course, I want a piece of pie for myself too, and that piece should also be of the same size.
What is the largest possible piece size all of us can get? All the pies are cylindrical in shape and they all have the same height 1, but the radii of the pies can be different.
Input
One line with a positive integer: the number of test cases. Then for each test case:
---One line with two integers N and F with 1 <= N, F <= 10 000: the number of pies and the number of friends.
---One line with N integers ri with 1 <= ri <= 10 000: the radii of the pies.
---One line with two integers N and F with 1 <= N, F <= 10 000: the number of pies and the number of friends.
---One line with N integers ri with 1 <= ri <= 10 000: the radii of the pies.
Output
For each test case, output one line with the largest possible volume V such that me and my friends can all get a pie piece of size V. The answer should be given as a floating point number with an absolute error of at most 10^(-3).
Sample Input
33 34 3 31 24510 51 4 2 3 4 5 6 5 4 2
Sample Output
25.13273.141650.2655
Source
NWERC2006
Recommend
wangye
直接上代码:
#include<iostream>#include<cstdio>#include<cmath>#include<algorithm>#include<iomanip>using namespace std;double pi = acos(-1.0);double r[10100];double n,f;bool judge(double m){int count=0;for(int i=0;i<n;i++){count+=int(r[i]/m); }if(count>=f)return true;return false;}int main(){int T;cin>>T;while(T--){double temp;double allV=0;cin>>n>>f;f+=1;for(int i=0;i<n;i++){cin>>temp;r[i]=temp*temp*pi;allV+=r[i];}double r,l,m;l=0.0;r=allV/f;while(r-l>1e-6){m=(l+r)/2;if(judge(m))l=m;elser=m;}printf("%.4lf\n",m);//setioflags(ios::fixed);//cout<<setprecision(4)<<m<<endl;}return 0;}
阅读全文
0 0
- 【HDU1969】Pie(二分法)
- Pie--hdu1969(二分法)
- hdu1969 Pie (二分)
- HDU1969:Pie(二分 + 贪心)
- hdu1969 Pie
- hdu1969 Pie
- HDU1969 Pie
- Hdu1969 Pie
- HDU1969-Pie
- hdu1969(二分法)
- HDU1969(二分法)
- Pie (二分法)
- (POJ3122)Pie <二分法>
- Pie(二分法)
- hdu1969 Pie 二分
- hdu1969(pie二分)
- HDU1969---Pie 二分
- HDU1969:Pie(二分)
- scala之函数编程进阶
- POJ-The Suspects
- SSH框架整合
- 编译PHP报错:make: *** [ext/fileinfo/libmagic/apprentice.lo]
- AbstractQueuedSynchronizer深度学习(独占锁)
- 【HDU1969】Pie(二分法)
- UVa10092: The Problem with the Problem Setter 题解
- QSettings 读写配置文件
- Oracle笛卡尔积与连接查询
- mac 下安装 ActiveMQ
- 八大排序算法之-归并排序 java代码
- 梯度
- sklearn中文文档——1.1. 普通线性模型
- 经典离线求lca[模板]