题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1969

Pie

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4513 Accepted Submission(s):
1819

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.

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

4 3 3

1 24

10 5

1 4 2 3 4 5 6 5 4 2

Sample Output

25.1327

3.1416

50.2655

题目大意：生日聚会上，来到的所有朋友都会领取一块饼，但是要求的是所有人都要拿到大小相同的饼！题目要求输出的是：每个人尽量拿到的最大的饼的体积是多大。这里的饼的形状是高为1的圆柱形。V=底面积*高

特别注意：1、题目里要给你自己留一块。

　　　　　2、每个人得到的饼不可以是两块饼拼接在一起的。

　　　　　3、这里的PI要用acos(-1.0)，具体原因还不知道为什么，可能精度要求比较高，因为这里wa几次。0.0

详见代码。

 #include <iostream>

 #include <cstdio>

 #include <cmath>

 using namespace std;

 #define PI acos(-1.0)

 int main ()

 {

     int t;

     while (~scanf("%d",&t))

     {

         while (t--)

         {

             int n,f,r;

             double V[],v=,vmax;

             scanf("%d%d",&n,&f);

             f=f+;

             for (int i=; i<n; i++)

             {

                 scanf("%d",&r);

                 V[i]=r*r*PI;

                 v+=V[i];

                 //cout<<v<<endl;

             }

             vmax=v/f;

             double left,right,mid;

             left=;

             right=vmax;

             int ans;

             while ((right-left)>1e-)

             {

                 int flag=,k=;

                 ans=;

                 mid=(left+right)/;

                 for (int i=;i<n;i++)

                 {

                    // ans+=(int)(V[i]/mid);

                     //if (ans>=f)

                         //flag=1;

                     double vv=V[i];

                     while(vv>=mid)

                     {

                         vv-=mid;

                         k++;

                         //cout<<vv<<" "<<k<<endl;

                         if(k==f)

                         {

                             flag=;

                             break;

                         }

                     }

                     if(flag==) break;

                 }

                 if(flag==)

                     left=mid;

                 else

                     right=mid;

             }

             printf("%.4lf\n",mid);

         }

     }

     return ;

 }

另外一种

 #include <iostream>

 #include <cstdio>

 #include <cmath>

 using namespace std;

 #define PI acos(-1.0)

 int main ()

 {

     int t;

     while (~scanf("%d",&t))

     {

         while (t--)

         {

             int n,f,r;

             double V[],v=,vmax;

             scanf("%d%d",&n,&f);

             f=f+;

             for (int i=; i<n; i++)

             {

                 scanf("%d",&r);

                 V[i]=r*r*PI;

                 v+=V[i];

                 //cout<<v<<endl;

             }

             vmax=v/f;

             double left,right,mid;

             left=;

             right=vmax;

             int ans;

             while ((right-left)>1e-)

             {

                 int flag=,k=;

                 ans=;

                 mid=(left+right)/;

                 for (int i=;i<n;i++)

                 {

                     ans+=(int)(V[i]/mid);

                     if (ans>=f)

                         flag=;

                     if(flag==) break;

                 }

                 if(flag==)

                     left=mid;

                 else

                     right=mid;

             }

             printf("%.4lf\n",mid);

         }

     }

     return ;

 }

巴特西

hdu 1969 Pie（二分查找）

Pie

最新文章

热门文章