HDU1969---Pie 二分
来源:互联网 发布:繁体字转换软件 编辑:程序博客网 时间:2024/06/05 02:35
Pie
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3019 Accepted Submission(s): 1176
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
3
3 3
4 3 3
1 24
5
10 5
1 4 2 3 4 5 6 5 4 2
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
3.1416
50.2655
二分面积即可,水。。。。只能划水,这可怎么办啊,555555555555555.。
#include <iostream>#include <cstdlib>#include <cstring>#include <cstdio>#include <cmath>#include <algorithm>using namespace std;const int maxn=10000+5;const double PI=acos(-1.0);int N,F;double a[maxn],maxm;bool OK(double area){ int sum=0; for(int i=0;i<N;i++) sum+=floor(a[i]/area); return sum>=F+1;}int main(){ int test,r; cin>>test; while(test--) { cin>>N>>F; maxm=-1; for(int i=0;i<N;i++) { cin>>r; a[i]=PI*r*r; maxm=max(a[i],maxm); } double l=0,r=maxm; for(int i=0;i<100;i++) { double mid=(l+r)/2; if(OK(mid)) l=mid; else r=mid; } printf("%.4lf\n",l); } return 0;}
- hdu1969 Pie 二分
- hdu1969(pie二分)
- HDU1969---Pie 二分
- HDU1969:Pie(二分)
- 二分查找 hdu1969 pie
- hdu1969 Pie 二分
- HDU1969 PIE 二分查找
- hdu1969 Pie(二分答案)
- HDU1969 Pie(二分搜索)
- hdu1969 pie【二分】
- hdu1969 Pie (二分)
- HDU1969:Pie(二分)
- Hdu1969-Pie-【二分】
- poj 3122&&hdu1969 Pie(二分)
- 【hdu1969】Pie——二分
- HDU1969:Pie(二分 + 贪心)
- hdu1969 Pie
- hdu1969 Pie
- SEA禁用的函数和类
- 解析Qt4.7.3编译MySql数据库驱动,存中文乱码、过滤转义字符问题
- android的智能指针
- memcpy和strlen函数的实现
- Coroutines in C
- HDU1969---Pie 二分
- 字符串hash函数
- c++: the hint of pointer
- poj 1226 Substrings(二分 + kmp)
- Problem 1056 - 函数问题 ---三分法
- 远程提交Map/Reduce任务
- poj 2185 Milking Grid(最小矩阵覆盖,二维 kmp 匹配)
- mysql show columns等show的用法
- 关于斯特方码