HDOJ-----1969二分
来源:互联网 发布:网络教育统考网站 编辑:程序博客网 时间:2024/06/06 15:08
Pie
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9433 Accepted Submission(s): 3418
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
就是给出N块圆柱型蛋糕的直径,高都是1,F个朋友,算上自己,是F+1个人,每人相同的体积,蛋糕不能拼接,从0到最大的那一块蛋糕之间二分就可以了
#include<cstdio>#include<cmath>#include<algorithm>const double PI = acos(-1.0);//这是这道题最丧心病狂的地方,PI定义为3.1415926就WA,精度简直变态using namespace std;double ss[10010];int t, N, F, x;int judge(double a){int ans = 0;for(int i = 0; i < N; i++){ans += (int)(ss[i] / a);}return ans;}bool cmp(double x, double y){return x < y;}int main(){double s, e, m, v;scanf("%d", &t);while(t--){scanf("%d%d", &N, &F);s = e = 0;F++;for(int i = 0; i < N; i++){scanf("%d", &x);ss[i] = x*x*PI;}sort(ss, ss+N, cmp);e = ss[N-1];while(e-s > .000001){m = (e+s) / 2;if(judge(m) >= F){s = m;}else{e = m;}}printf("%.4lf\n", s);}return 0;}
0 0
- HDOJ 1969 二分
- hdoj 1969 Pie 【二分】
- HDOJ 1969 Pie (二分)
- hdoj 1969 Pie 【二分】
- HDOJ-----1969二分
- HDOJ 1969 Pie(二分查找)
- HDOJ 1969 Pie(二分)
- HDOJ 2899 二分算法
- HDOJ 4033 二分
- hdoj 2199二分搜索
- HDOJ 1068 二分匹配
- HDOJ 1083 二分匹配
- HDOJ 1151 二分匹配
- 【二分匹配】 HDOJ 3118
- Hdoj 2333 Assemble 【二分】
- HDOJ-----2199二分
- HDOJ-----1551二分
- HDOJ-----2141二分
- 负载均衡集群解决方案 Nginx
- poj 3045 Cow Acrobats (贪心)
- BAT及各大互联网公司2014前端笔试面试题--Html,Css篇
- MFC picture control控件不失真自适应图片显示
- 序列化
- HDOJ-----1969二分
- Http协议详解
- 图片要启用gzip压缩吗?绝对不要!
- 理清Activity、View及Window之间关系
- go语言反射reflect
- Windows的字体LOGFONT
- Linux夜间模式(f.lux)
- Hive On Spark执行计划总结
- BAT及各大互联网公司2014前端笔试面试题--JavaScript篇