hdoj 1969 Pie 【二分】
2015-08-03 11:36
441 查看
Pie
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6253 Accepted Submission(s): 2368
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.
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.
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
3 3 3 4 3 3 1 24 5 10 5 1 4 2 3 4 5 6 5 4 2
Sample Output
25.1327 3.1416 50.2655
题意:有F+1个人和N个饼,现在分这些饼,要求每个饼的体积一样(每个饼都是高为1的柱体,所以说求体积就是求底面积)。问你能分的最大体积(就是底面积)。
无语,太想省事了,直接右区间开到20000000,以为就OK了,没想到WA到死。。。
#include <cstdio> #include <cstring> #include <cmath> #include <cstdlib> #include <algorithm> #define eps 1e-6 #define MAXN 10000+10 #define PI acos(-1.0) using namespace std; double R[MAXN]; int N, F; bool judge(double mid) { int cnt = 0; for(int i = 0; i < N; i++) cnt += (int) (R[i] / mid); return cnt >= F+1;//自己也要。。。 } int main() { int t; scanf("%d", &t); while(t--) { scanf("%d%d", &N, &F); double r; for(int i = 0; i < N; i++) { scanf("%lf", &r); R[i] = PI * r * r; //sum += R[i]; } double left = 0, right = 200000000000.0, mid; while(right - left >= eps) { mid = (left + right) / 2; if(judge(mid)) left = mid; else right = mid; } printf("%.4lf\n", left); } return 0; }
相关文章推荐
- iOS 7 教程:定制iOS 7中的导航栏和状态栏
- HDU 4276-The Ghost Blows Light(树状背包)
- URAL 1027 D++ Again
- prefdm respawning too fast stopped
- android点击事件在不同级别view中的优先级问题
- Node.js学习入门手册
- 更新最新ADT
- gstreamer教程系列之动态插件的实现与原理
- msql报错显示法语改为英语
- 课堂笔记10
- STM32学习笔记(五) USART异步串行口输入输出(轮询模式)
- Xcode断点的一些黑魔法
- 基于NIO的Socket通信
- 关于 隐藏元素(样式为 display: none 的元素)及其子元素 获取不到高度的问题
- oracle over函数, wm_concat()字符串连接函数使用
- js实现圆盘记速表
- JSP和Servlet基础原理
- 宽带离网用户分析(2) 数据预处理和特征抽取
- hdu5199Gunner(二分查找)
- HDU1754 I Hate It 线段树(单点更新,区间最值)