HDU1969:Pie(二分 + 贪心)
来源:互联网 发布:mac app store 速度慢 编辑:程序博客网 时间:2024/06/11 21:08
Pie
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10919 Accepted Submission(s): 3894
Problem 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.
---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
Source
NWERC2006
题意:N种蛋糕,每个半径给出,要分给F+1个人,要求每个人分的体积一样(形状可以不一样),而且每人只能分得一种蛋糕(不能多种蛋糕拼在一起),求每人最大可以分到的体积。思路:初始下界为0,上界为最大的蛋糕体积,二分求出结果。
# include <stdio.h># include <math.h># include <algorithm># define pi acos(-1.0)using namespace std;double a[10001];int n, f;bool cmp(double a, double b) {return a>b;}bool fun(double s){ int cnt = 0, tmp; for(int i=0; i<n; ++i) { tmp = (int)(a[i]/s); if(tmp == 0 || cnt >= f) break; cnt += tmp; } return cnt<f?false:true;}int main(){ int t; double l, r, mid; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&f); ++f; for(int i=0; i<n; ++i) { scanf("%lf",&a[i]); a[i] = pi*a[i]*a[i]; } sort(a, a+n, cmp); l = 0; r = a[0]; mid = (l+r)/2; while(r-l>1e-5) { if(fun(mid)) l = mid; else r = mid; mid = (l+r)/2; } printf("%.4f\n",mid); } return 0;}
0 0
- HDU1969:Pie(二分 + 贪心)
- hdu1969 Pie (二分)
- hdu1969 Pie 二分
- hdu1969(pie二分)
- HDU1969---Pie 二分
- HDU1969:Pie(二分)
- 二分查找 hdu1969 pie
- hdu1969 Pie 二分
- HDU1969 PIE 二分查找
- hdu1969 Pie(二分答案)
- HDU1969 Pie(二分搜索)
- hdu1969 pie【二分】
- HDU1969:Pie(二分)
- Hdu1969-Pie-【二分】
- poj 3122&&hdu1969 Pie(二分)
- 【hdu1969】Pie——二分
- 【HDU1969】Pie(二分法)
- POJ3122 Pie(二分+贪心)
- Spring源码如何导入到eclipse
- mysql-5.7.17-winx64的安装问题
- C#中语句的使用
- 响应式轮播插件(无焦点&可链式操作)
- PePatchByLoader
- HDU1969:Pie(二分 + 贪心)
- bringing up interface eth0: error no suitable device found
- 洛谷P1434 滑雪
- gulp源码解析(一)—— Stream详解
- Spring Data JPA例子[基于Spring Boot、Mysql]
- C++ 封装RapidJson把一个类Json序列化和反序列化
- java中有关 == 字符串的比较
- 利用phpmyadmin来做MySQL主从复制,so easy!
- 第四十三讲项目1.1-由键盘到文件