POJ3122
来源:互联网 发布:小米双卡网络切换 编辑:程序博客网 时间:2024/05/21 09:06
Pie
Time Limit: 1000MS
Memory Limit: 65536KTotal Submissions: 14832
Accepted: 5088
Special Judge
Memory Limit: 65536KTotal Submissions: 14832
Accepted: 5088
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
运用二分其实并不困难,但要在各种各样的题中看出“二分”
却需要对二分思想的领悟
二分的条件:
1、顺序存储结构
2、有序表
#include<cstdio>#include<cmath>#define PI 3.1415926535898;int a[10005];int main (){ int T,N,F,f,i,max; double lo,hi,mid,x; scanf("%d",&T); while(T--) { x=0;max=0; scanf("%d%d",&N,&F); for(i=0;i<N;i++) { scanf("%d",&a[i]); a[i]=a[i]*a[i]; max=a[i]>max?a[i]:max; } lo=0;hi=max; while(fabs(lo-hi)>1e-7) { mid=(lo+hi)/2; f=0; for(i=0;i<N;i++) f+=(int)(a[i]/mid); if(f>=(F+1)) {x=mid;lo=mid;} else hi=mid; } x=x*PI; printf("%.4lf\n",x); } return 0;}
0 0
- poj3122
- poj3122
- poj3122
- poj3122
- poj3122
- poj3122
- POJ3122
- POJ3122
- POJ3122
- POJ3122
- POJ3122 pie
- poj3122 Pie
- Poj3122 Pie
- poj3122 二分
- POJ3122-Pie
- POJ3122------Pie
- 【poj3122】 Pie
- Pie<poj3122>
- POM(Project Object Model)项目对象模型详解
- hdfs HA + MR HA
- 重建控制文件时resetlogs与noresetlogs的使用情况
- ORA-12570:TNS:包阅读程序失败,解决办法。
- STM32F1学习-独立看门狗
- POJ3122
- [sql]分页查询
- 组合数性质
- PHP使用APC的主要用处(个人观点)
- 左偏树
- 使用qt开发ros应用
- * **ACM集训day11
- Vijos 1599 - 货币
- 二维数组作为函数参数---- error c2087:missing subscript