POJ3122_Pie_二分
来源:互联网 发布:依祈怎么淘宝不能买了 编辑:程序博客网 时间:2024/06/08 05:40
Pie
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16604 Accepted: 5623 Special Judge
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
#include<cstdio>#include<cmath>const double PI=acos(-1.0);double S [10005];int cas,N,F,r;int main(){//freopen("in.txt","r",stdin);scanf("%d",&cas);while(cas--){scanf("%d%d",&N,&F);double Max=0;for(int i=0;i<N;i++){scanf("%d",&r);S[i]=PI*r*r;if(Max<S[i]) Max=S[i];}double l=0,r=Max;while(r-l>=0.00001){int sum=0;double mid=(l+r)/2;for(int i=0;i<N;i++)sum+=int(S[i]/mid);if(sum>=F+1) l=mid;else r=mid;}printf("%.4f\n",l);}return 0;}
0 0
- POJ3122_Pie_二分
- 二分
- 二分
- 二分
- 二分
- 二分
- 二分。
- 二分
- 二分
- 二分
- 二分
- 二分
- 二分
- 二分
- 二分
- 二分~~
- 二分
- 二分
- 如何快速转载CSDN中的博客
- Java面试题集及解答
- css样式
- Android开发--IM聊天项目(三)
- Java之自定义异常
- POJ3122_Pie_二分
- linux修改profile文件出错后所有命令用不了
- 面向对象—轮播图
- Android 中播放内存中视频
- 串口与并口的区别
- OpenGL ES 平台搭建教程(在包含Visual Studio 的Microsoft Windows 上构建)
- Android 事件的分发
- C语言实现各种排序算法
- 常见的几种最优化方法