POJ-1129 Pie 解题报告
来源:互联网 发布:志鸿优化网 编辑:程序博客网 时间:2024/05/20 07:34
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
3
3 3
4 3 3
1 24
5
10 5
1 4 2 3 4 5 6 5 4 2
Sample Output
25.1327
3.1416
50.2655
题目链接:http://poj.org/problem?id=3122
解法类型:二分法
解题思路:v与人数的关系为单调函数,即用二分法快速查找。但要注意此题的精度问题,好像很坑。话说,样例都没有过,都AC了。。= =!
算法实现:
//STATUS:C++_AC_32MS_172K#include<stdio.h>#include<math.h>#define PI 3.14159265358; //注意精度const int MAXN=10010;int pie[MAXN];int main(){//freopen("in.txt","r",stdin);int t,n,f,i,tot;double mid,high,low,v;scanf("%d",&t);while(t--){low=0,high=-1;scanf("%d%d",&n,&f);f++; //注意人数,包括自己for(i=0;i<n;i++){scanf("%d",&pie[i]);if(pie[i]>high)high=pie[i];}for(high++,mid=(low+high)/2;high-low>1e-6;mid=(low+high)/2){ //这里1e-6改成1e-5样例没有过,AC了~for(i=0,tot=0;i<n;i++){tot+=(int)floor((pie[i]*pie[i])/(mid*mid));}tot<f?high=mid:low=mid; //二分v=mid*mid*PI;}printf("%.4lf\n",v);}return 0;}
- POJ-1129 Pie 解题报告
- POJ 3122 Pie解题报告
- POJ 3122 Pie 解题报告(二分)
- POJ_1129 pie 解题报告
- Pie解题报告
- POJ-3122 Pie 解题报告(二分) 平分派饼
- 【Jason's_ACM_解题报告】Pie
- J - Pie解题报告(黄杰)
- POJ3311 Hie with the Pie解题报告
- 【ACM菜逼解题报告】Pie
- acm解题报告 HDU 1969 Pie
- POJ-1129 Channel Allocation 解题报告
- POJ-1129 Channel Allocation 解题报告
- poj解题报告——1129
- poj数百篇解题报告
- poj 1141解题报告
- poj 1001解题报告
- poj 1011 解题报告
- 你拥有的能力远比你想象的要大的多
- iPhone开发学习笔记一 : iPhone开发常见名词解释
- 关于字符集
- Refactoring: 'return' gives me a bug
- android桌面默认的5个应用图标的加载和存储
- POJ-1129 Pie 解题报告
- Git 用法及问题解决
- 工作
- adb 配置环境变量 与命令解释
- 理想中的个人资料库管理软件的功能
- 可怕的明文密码
- 浅论关于创意的分享与保密
- AGG反锯齿绘图库的学习笔记(一)
- oracle基础之存储结构