HDU Pie
来源:互联网 发布:druid怎么拦截sql注入 编辑:程序博客网 时间:2024/06/17 00:21
Pie
Time Limit : 5000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 105 Accepted Submission(s) : 53
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
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
#include<iostream>#include<algorithm>#include<string.h>#include<cstdio>#include<cmath>int n, f;double pi =acos(-1),kj=0.000001;using namespace std;int main(){ int T; scanf_s("%d", &T); while (T--) { scanf_s("%d%d", &n, &f); double a[10002]; for (int i = 0; i < n; i++) { int r; scanf_s("%d", &r); a[i] = pi*r*r; } sort(a, a + n); double l = 0, t = a[n - 1]; while (t - l > kj) { double p = (t + l) / 2; int sum = 0; for (int i = n-1;i>=0; i--) { sum = sum + (int)(a[i] / p); if (sum >= f+1) break; //不要忘了给自己来一块 } if (sum >= f+1) l = p; else t = p; } printf("%.4lf\n", l); } return 0;}
阅读全文
0 0
- hdu Pie
- HDU Pie
- HDU 1969 Pie
- hdu pie(二分+贪心)
- hdu 1969 Pie
- HDU 1969 - Pie
- hdu 1969 pie
- HDU 1969 Pie
- hdu 3392 Pie
- HDU-1969pie
- hdu 1969 Pie
- HDU-3392 Pie DP
- HDU 1969 Pie
- HDU 1176 Pie
- HDU 1969 Pie
- YT15-HDU-分pie
- hdu 1969 Pie
- HDU 1969 Pie
- Spring框架
- idea项目启动时,显示Warning:Java1.5已过时,将在未来所有发行版本中删除
- day23—JavaSE 总结和 OracleSQL 中的 select 语句
- Mybatis关联查询之一对多和多对一XML配置详解
- 给大家推荐一些好用的国内外免费图床(可外链的免费相册)
- HDU Pie
- TeraData知识痛点-权限问题
- idea 中 maven-compiler-plugin 笔记
- Valid Parentheses
- 正则表达式
- springMVC源码分析--容器初始化(一)ContextLoaderListener
- 汽车转向的机理——滑移角、转向力、转向过度、转向不足、轮胎选择
- github以网页的方式查看.html文件
- 专访车慧总裁刘琦:大数据时代的汽车营销才刚刚开始