HDOJ-----1969二分
2016-07-28 10:13
260 查看
Pie
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9433 Accepted Submission(s): 3418
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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).
[align=left]Sample Input[/align]
3
3 3
4 3 3
1 24
5
10 5
1 4 2 3 4 5 6 5 4 2
[align=left]Sample Output[/align]
25.1327
3.1416
50.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;
}
相关文章推荐
- Spring自动装配
- 彻底弄懂css3的flex弹性盒模型
- 从一个简洁的进度刻度绘制中了解自定义View的思路流程
- Mui沉浸模式以及状态栏颜色改变
- Hadoop MapReduce概念学习系列之shuffle大揭秘(十九)
- 在web开发中可能经常遇到的是url编码、解码的问题
- nyoj 325 zb的生日(01 背包)
- 不用加减乘除做加法
- maven常用命令
- 百分比适配举例
- 2016.6.22笔记(3)-内存映射
- http://t.cn/xx 等链接的生成与还原
- 为了 SHELL脚本开发汉诺塔游戏 部分草稿 shell建立二维数组并打印
- 读代码笔记《一》
- Pro JPA2读书笔记系列(六)-第六章(实体管理器)
- leetcode Inorder Successor in BST
- 【POJ 2947】Widget Factory(高斯消元+逆元)
- 网络知识之七 httpclient 访问第三方服务的时候导致 connection reset
- HTML&CSS基础学习笔记1-简单网页中有哪些标签?
- spring源码分析之freemarker整合