hdoj 1969 pie【二分法】
来源:互联网 发布:程序员试用期总结 编辑:程序博客网 时间:2024/05/17 07:05
Pie
Time Limit : 5000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 188 Accepted Submission(s) : 70
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.
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个饼和m个同学,给出n个饼的半径,求每个同学平均能分几个,但是每块饼必须均分。
代码:
#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>using namespace std;double ff[100050];int n,m;double pi = acos (-1.0);bool kk(double gg){int cout=0;int i;for(i=0;i<n;i++){cout+=int(ff[i]/gg);}if(cout>=m+1)return true;elsereturn false;}int main(){int t;scanf("%d",&t);while(t--){scanf("%d %d",&n,&m);double r;double sum=0.0;for(int i=0;i<n;i++){scanf("%lf",&r);ff[i]=r * r * pi;sum +=ff[i];}double max = sum / (m+1);double l=0.0,g=0.0,mid=0.0;g=max;while (g-l > 1e-6){mid=(l+g)/2;if(kk(mid)){l = mid;}else g=mid;}printf("%.4lf\n",mid);}return 0;}
0 0
- hdoj 1969 pie【二分法】
- HDU 1969:Pie【二分法】
- HDU-1969 PIE 二分法
- Num 23 : HDOJ : 2199 Can you solve this equation? + HDOJ : 1969 Pie [ 二分法 ]
- hdoj 1969 Pie 【二分】
- hdoj 1969 Pie
- hdoj 1969 Pie
- HDOJ 1969 Pie (二分)
- HDOJ 1969 Pie
- HDOJ 1969 Pie
- HDOJ-1969 Pie
- hdoj 1969 Pie 【二分】
- 二分法-Pie
- 二分法--Pie
- HDU 1969 Pie 二分法分蛋糕
- hdu 1969 &&nyoj 1193 Pie【二分法】
- hdu 1969 Pie (二分法+贪心)
- HDOJ 1969 Pie(二分查找)
- opencv——PNG格式图像读取转换函数
- C++第七节:继承
- 斐波那契数列四吧
- Codeforces 520D. Cubes 状态模拟+贪心
- vidibility属性visible,invisible与gone的区别
- hdoj 1969 pie【二分法】
- Linux系统拨号上网
- java基础-集合
- 【Unity】代码加密(一)编译libmono
- hdu 3760 Ideal Path 字典序最小的最短路
- codeforces 543D D. Road Improvement(树形dp)
- Material Design Tabs
- 树的重心及其一些性质
- HDU - 1864 最大报销额