Sicily 1441. Pie
来源:互联网 发布:电信网络能申请外网吗 编辑:程序博客网 时间:2024/05/29 17:13
1441. Pie
Constraints
Time Limit: 1 secs, Memory Limit: 32 MB , 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.
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
// Problem#: 1441// Submission#: 3311152// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/// All Copyright reserved by Informatic Lab of Sun Yat-sen University#include <iostream>#include <vector>#include <algorithm>#include <stdio.h>#include <math.h>#include <string.h>#include <string>#include <queue>using namespace std;const double ERR = 0.001;const int MAX_N = 10005;const double PI = 3.14159265358979323846;int N, F;double v[MAX_N];int r[MAX_N];bool possible(double now) { int counter = 0; for (int i = 0; i < N; i++) { int j; for (j = 1; j * now <= v[i]; j++); counter += j - 1; if (counter >= F) return true; } return false;}int main() { //std::cout.sync_with_stdio(false); int caseNum; scanf("%d", &caseNum); while (caseNum--) { scanf("%d%d", &N, &F); double maxPie = -1; for (int i = 0; i < N; i++) { scanf("%d", &r[i]); v[i] = PI * r[i] * r[i]; maxPie = max(maxPie, v[i]); } F++; sort(v, v + N); double low = 0, high = maxPie; while (high - low >= ERR) { double mid = (high + low) / 2; if (possible(mid)) low = mid; else high = mid; } printf("%.4lf\n", low); } return 0;}
- Sicily 1441. Pie
- sicily 1441 pie[S]
- sicily 1441 pie
- Sicily 1404. Hie with the Pie
- Pie
- Pie
- pie
- Pie
- Pie
- PIE
- Pie
- Pie
- Pie
- Pie
- Pie
- Pie
- pie
- Pie
- 代码片段1
- 我们为何要定制网站?推广
- 数据持久化初级
- 求ax^2+bx+c=0的方程的解
- 解读CPU寄存器
- Sicily 1441. Pie
- linux查看磁盘使用情况
- [译]【Storm入门指南】第五章 Bolts
- Sicily 1373. Cows Of The Round Ta
- Sicily 1428. B Baby Climber(心宝去爬山)
- Sicily 1366. Ferry Loading IV
- jdbc+tomcat+mysql插入utf-8中文乱码解决方案
- Performance Insights to Intel® Hyper-Threading Technology
- 数组的行列变换