[POJ3122]Pie
来源:互联网 发布:unity ugui 源码下载 编辑:程序博客网 时间:2024/06/14 12:14
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.
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.
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.
33 34 3 31 24510 51 4 2 3 4 5 6 5 4 2
25.13273.141650.2655
题意: 有n个蛋糕, m+1个人, 每个蛋糕的h均为1,
给出每个蛋糕的半径, 求出每个人能够得到的最大蛋糕体积,
蛋糕只能进行切分, 不能组合
题解: 二分法
#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<algorithm>using namespace std;const int N=1e4+10;const double esp=0.0000001;const double pi=3.14159265359;int T, n, m;double v[N];int main() {for( scanf( "%d", &T ); T; T-- ) {scanf( "%d%d", &n, &m ); m++;double upV=0, downV=0;for( int i=1; i<=n; i++ ) {double r; scanf( "%lf", &r );v[i]=pi*r*r;upV=max( upV, v[i] );}while( upV-downV>=esp ) {int peo=m;double midV=(upV+downV)/2;for( int i=1; i<=n; i++ )peo=peo-(int)(v[i]/midV);if( peo>0 ) upV=midV;else downV=midV;}printf( "%.4lf\n", upV );}return 0;}
注意pi至少开11位, 别问为什么
阅读全文
0 0
- POJ3122 pie
- poj3122 Pie
- Poj3122 Pie
- POJ3122-Pie
- POJ3122------Pie
- 【poj3122】 Pie
- Pie<poj3122>
- poj3122 Pie
- [POJ3122]Pie
- poj3122 Pie 二分法
- POJ3122--Pie--二分
- poj3122 Pie(二分查找)
- 贪心 - poj3122 Pie
- Pie(二分POJ3122)
- POJ3122 Pie 二分查找
- (POJ3122)Pie <二分法>
- POJ3122——pie
- poj3122 pie 二分
- RAML for JAX-RS的raml-to-jaxrs子项目简介
- OSI七层与TCP/IP五层网络架构详解
- SaaS,软件即服务
- @RequestMapping 用法详解之地址映射
- 机器学习:诊断偏差和方差
- [POJ3122]Pie
- Gitlab在Ubuntu、Debian、CentOS 6、CentOS 7、OpenSUSE、Raspberry Pi2安装
- if语句的猜拳游戏
- Ubuntu MongoDB安装
- Android Studio怎么新建Android公共库模块
- flume到kafka,structuredStreaming从kafka消费
- HDU
- 高并发之Linux优化
- 如何通过apache2配置多站点