poj 3122 Pie(二分)
2017-07-08 09:44
316 查看
Pie
DescriptionMy 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
ps:直接二分枚举答案即可
代码:
#include<stdio.h> #include<math.h> #include<string.h> #include<algorithm> using namespace std; const double PI=acos(-1.0); double area[10010]; int main() { int t; scanf("%d",&t); while(t--) { int n,m,x; scanf("%d%d",&n,&m); ++m; double le=0.0,ri=1.0; for(int i=0; i<n; ++i) { scanf("%d",&x); area[i]=PI*1.0*x*x; if(area[i]>ri) ri=area[i]; } double ans=0.0; while(le<=ri) { double mid=(le+ri)/2.0; int cnt=0; for(int i=0; i<n; ++i) { double k=area[i]; while(k>=mid) ++cnt,k-=mid; } if(cnt>=m) { le=mid+0.00001; if(mid>ans) ans=mid; } else ri=mid-0.00001; } printf("%.4lf\n",ans); } return 0; }
相关文章推荐
- [POJ 3122] Pie 二分答案+贪心
- POJ-3122 Pie 解题报告(二分) 平分派饼
- 【POJ】3122 Pie [二分查找]
- 二分板子 poj 3122 pie
- POJ 3122 Pie 二分答案
- poj 3122 Pie(二分)
- poj3122 Pie(二分查找)
- POJ 3122 Pie 二分答案
- poj 3122 Pie(二分)
- POJ 3122 Pie 二分查找 +高精度
- POJ3122 Pie(二分)
- (Relax 数论1.23)POJ 3122 Pie(二分搜索)
- POJ 3122-Pie(二分+精度)
- poj 3122 Pie(二分)
- poj 3122 Pie (二分查找)
- POJ 3122 Pie 解题报告(二分)
- poj - 3122 Pie (二分查找)
- POJ 3122 pie 二分
- poj 3122:Pie(二分)
- poj 3122 Pie(二分)