Time Limit: 1000MS | Memory Limit: 65536K | |||
Total Submissions: 10595 | Accepted: 3733 | 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.
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
题目:共有n个饼,现在有f+1个人来参加party,现在将饼分成f+1块同样大小的饼(只能是一块,不能多块)。问分的那块饼的最大的体积是多少?(高都为1,半径题目给出,饼为规则的圆柱形);
二分,这里面貌似有种贪心的思想,先平均分,然后再看有没有不够分的,如果不够分,然后再取中间数,最后到达精度为止,这题卡精度比较厉害,poj上交题注意要用%.4f,hdu上则不用。
代码:
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#define N 10010
#define pi acos(-1)
using namespace std;
int a[N];
double v[N];
int main()
{
int t,n,f,i;
while(~scanf("%d",&t))
{
while(t--)
{
scanf("%d%d",&n,&f);
f++;
double sum=0;
for(i=0; i<n; i++)
{
scanf("%d",&a[i]);
v[i]=a[i]*a[i];
sum+=v[i];
}
double mid=0,low=0,height=sum/f;
while(height-low>1e-6)
{
mid=(height+low)/2;
int cnt=0;
for(i=0; i<n; i++)
cnt+=int(v[i]/mid);
if(cnt>=f)
low=mid;
else
height=mid;
}
printf("%.4f\n",mid*pi);
}
}
return 0;
}