Pie
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
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
Source
题目类型：二分法
算法分析：直接二分每个人(包括主人在内)可以拿到的派的体积，然后对于每一个体积判断能够满足多少人的需求
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 |
#include <iostream> #include <fstream> #include <algorithm> #include <iomanip> #include <cstring> #include <cstdio> #include <cmath> #include <map> #include <string> #include <vector> #include <stack> #include <queue> #include <set> #include <list> #include <ctime> using namespace std; const double EPS = 1e-6; const double PI = 3.14159265359; const int maxn = 10000 + 66; int r[maxn]; int n, f; bool Calc (double val) { int i, cnt = 0; for (i = 0; i < n; i++) { double sum = PI * r[i] * r[i]; while (sum > val + EPS) { if (cnt == f + 1) return true; sum -= val; cnt++; } if (cnt == f + 1) return true; } return false; } int main() { // ifstream cin ("aaa.txt"); int t; cin >> t; while (t--) { cin >> n >> f; int i; double temp = 0; for (i = 0; i < n; i++) { cin >> r[i]; temp += PI * r[i] * r[i]; } double low = 0, high = temp, mid; while (low + EPS <= high) { mid = low + (high - low) / 2; if (Calc (mid)) low = mid; else high = mid; } cout << fixed << setprecision (4) << low << endl; } return 0; } |
- « 上一篇：poj3090
- poj3126：下一篇 »