uva 12097 - Pie(二分,4级)
来源:互联网 发布:python web麻瓜编程 编辑:程序博客网 时间:2024/05/22 16:41
Problem C - Pie
Time limit: 1 second
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 ≤ 10000: the number of pies and the number of friends.
- One line with N integers ri with 1 ≤ ri ≤ 10000: 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
思路:二分结果,判断是否能切出符合的块数
#include<iostream>#include<cstring>#include<cstdio>#include<cmath>using namespace std;const double pi=acos(-1.0);const int mm=1e4+9;const double mx=1e-6;double f[mm];int n,m;bool judge(double mid){ int ans=0; for(int i=0;i<n;++i) ans+=int(f[i]/mid); if(ans>m)return 1; else return 0;}double fabs(double x){ if(x<0)return -x; return x;}int main(){ int cas; while(~scanf("%d",&cas)) { while(cas--) { scanf("%d%d",&n,&m); for(int i=0;i<n;++i) {scanf("%lf",&f[i]); f[i]=f[i]*f[i]*pi; } double l=0,r=1e10,mid; while(fabs(r-l)>mx) { mid=(l+r)/2; if(judge(mid))l=mid; else r=mid; } ///cout<<(l+r)/2<<endl; printf("%.4lf\n",(l+r)/2); } }}
- uva 12097 - Pie(二分,4级)
- UVA 12097 Pie(二分)
- 【UVA】12097 - Pie(二分枚举)
- uva 12097 Pie(二分搜索)
- UVa 12097 - Pie(二分查找)
- UVA 12097 Pie LA 3635 (二分)
- 12097 - Pie (二分)
- UVA - 12097 (pie 二分求解逼近值)
- uva - 12097 - Pie(二分法)
- PIE(二分)
- hdu1969 Pie (二分)
- Pie(二分)
- poj_3122 Pie(二分)
- #POJ3122#Pie (二分)
- Pie (二分)
- Pie (二分)
- POJ3122 Pie(二分)
- UVA - 12097 Pie
- 黑马程序员——单例设计模式
- C# 界面随父界面大小比例变化
- maps 和 reduces 的数量
- Prime ring problem
- Junit4 新断言语法介绍(转)
- uva 12097 - Pie(二分,4级)
- 设计模式-06-适配器模式
- YUM常用命令介绍
- iOS 新浪微博客户端Demo实践之(七) 应用程序图标设置及总结
- dataGridView增加可操作事件字段
- map feed back
- CSS 样式表
- shell中的if语句和case语句
- 站在淘宝角度,深度剖析直通车,想开通直通车的朋友请进