Pie(派)
来源:互联网 发布:笑笑淘宝外设店 编辑:程序博客网 时间:2024/04/27 15:41
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。
用到二分法,代码如下:
#include <cstdio>#include <algorithm>using namespace std;const double PI = 3.14159;const int MAX = 10000;int N,F;double A[MAX];bool fun(double area){int count = 0;for (int i = 0; i < N; i++){count += int(A[i] / area);//取结果的整数(即每块饼可以分配的人数)相加}return count >= F + 1;}int main(){int T;scanf("%d",&T);while (T--){scanf("%d%d",&N,&F);double temp = -1;for (int i = 0; i < N; i++){int r;scanf("%d",&r);A[i] = PI * r * r;temp = __max(temp,A[i]);}double L = 0, R = temp;while (R - L > 1e-5)//二分法{double M = (L + R) / 2;if (fun(M)){L = M;}else{R = M;}}printf("%.3lf\n",L);}return 0;}
- Pie(派)
- LA 3635 Pie 派
- 例题1.13 派 Pie UVALive
- 派(Pie,NWERC 2006,LA 3635)
- POJ-3122 Pie 解题报告(二分) 平分派饼
- Life of Pie 少年派的奇幻漂流
- 小熊猫派猜想(pretty panda pie 猜想)
- 二分法-派(Pie, NWERC 2006, LA 3635)
- 派
- 派
- 派
- Pie
- Pie
- pie
- Pie
- Pie
- PIE
- Pie
- unity3d中的http通信
- 【连载】系统启动篇(三)[下]——控制台初始化续
- 部署tomcat应用的三种方法
- c++ 之旅
- 字典树 基础模版
- Pie(派)
- GNUStep:create our first gui application
- 使用Spread.Net添加一个未绑定的行
- 【活动】迎五一 炫彩读书节——全场满68元即可选择赠书一本
- Mozilla,Epic携手打造Unreal 3 游戏引擎
- 博客落地
- 基于shibboleth的分布式认证之SP配置
- 探本溯源——深入领略Linux内核绝美风光之系统启动篇(四)
- 一个猎人带着一只狼,一个女人带着两个小女孩,一个男人带着两个小男孩,他们要渡船过河