二分板子 poj 3122 pie
来源:互联网 发布:神经网络算法实例说明 编辑:程序博客网 时间:2024/06/07 11:17
题目
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 ≤ 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 <iostream>#include <algorithm>#include <cstring>#include <stdio.h>#include <cmath>using namespace std;const int maxn=10005;const double pi=acos(-1.0);int pie[maxn],N,F;double V[maxn];bool judge(double x){ int num=0; for(int i=0;i<N;i++) { num=num+int(V[i]/x); if(num>=F+1) return 1; } return 0;}int main(){ int n; cin>>n; while(n--) { double maxv=0; cin>>N>>F; for(int i=0;i<N;i++) { cin>>pie[i]; V[i]=pie[i]*pie[i]*pi; maxv+=V[i]; } double mid,l=0,r=maxv/(F+1); while((r-l)>1e-6) { mid=(l+r)/2; if(judge(mid)) l=mid; else r=mid; } printf("%.4f\n",l); } return 0;}
做二分三分时注意循环条件的判断
double型时如while((r-l)>1e-6)
或int t=100;while(t--)
int型时注意r和l+1或-1,以及最终答案的确定
- 二分板子 poj 3122 pie
- POJ 3122 Pie 二分
- POJ 3122 Pie 二分
- poj 3122 Pie (二分)
- Pie - POJ 3122 二分
- POJ 3122 Pie(二分)
- POJ 3122pie(二分)
- POJ 3122 pie 二分
- [poj 3122] Pie 二分
- POJ Pie 3122 (二分)
- POJ 3122 - Pie(二分)
- poj 3122 pie(二分搜索)
- poj 3122 Pie 二分答案
- POJ 3122 Pie【二分答案】
- poj 3122&&hdu1969 Pie(二分)
- poj 3122 Pie (二分查找)
- POJ 3122-Pie(二分+精度)
- 【POJ 3122】 Pie (二分+贪心)
- Java<链表引用置为null是否能删掉一个节点>
- C++中static关键字
- 125. Valid Palindrome
- HDU
- 清晰地理解PHP中的Cookie
- 二分板子 poj 3122 pie
- 抽象类VS接口
- 2017年读数轨迹
- 周记一.不管在哪里工作,你都可以创造不一样的价值
- memset用法详解
- C Primer Plus 6 笔记——可移植类型:stdint.h和inttypes.h
- 银行卡扫一扫识别OCR技术
- HDU 6035(2017多校第一场)。color tree (树形dp)
- C