Pie
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9210 Accepted Submission(s): 3333
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
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
题意:把蛋糕分成等大的至少m+1份,求最大分的面积。面积越小块数越多
题解:对分的每块面积进行二分,求可以满足m+1份且很大的值,面积越大,分得块数越小
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define PI acos(-1) //以后PI这么写,不然不精确会 wa
using namespace std;
int n,m;
double a[100010];
int dis(double x)
{
int sum=0;
for(int i=1;i<=n;i++)
{
sum+=(int)(a[i]/x); //对分割出来的面积进行二分
if(sum>=(m+1)) //总面积除以需求面积,得到块数,大于m+1,可以把面积分大一点
return 1;
}
return 0;
}
int main()
{
int t;
double l,r;
scanf("%d",&t);
while(t--)
{
memset(a,0,sizeof(a));
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%lf",&a[i]);
a[i]=a[i]*a[i]*PI; //计算出每个的面积
r=max(r,a[i]); //r最大为最大的那个面积
}
l=0;
while(r-l>0.0000001)
{
double mid=(r+l)/2;
if(dis(mid))
l=mid;
else
r=mid;
}
printf("%.4lf\n",l);
}
return 0;
}