hdu 1969 Pie(二分查找)

题目链接: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 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

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

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

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

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

详见代码。

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cmath>
 4
 5 using namespace std;
 6
 7 #define PI acos(-1.0)
 8
 9 int main ()
10 {
11     int t;
12     while (~scanf("%d",&t))
13     {
14         while (t--)
15         {
16             int n,f,r;
17             double V[10005],v=0,vmax;
18             scanf("%d%d",&n,&f);
19             f=f+1;
20             for (int i=0; i<n; i++)
21             {
22                 scanf("%d",&r);
23                 V[i]=r*r*PI;
24                 v+=V[i];
25                 //cout<<v<<endl;
26             }
27             vmax=v/f;
28             double left,right,mid;
29             left=0;
30             right=vmax;
31             int ans;
32             while ((right-left)>1e-6)
33             {
34                 int flag=0,k=0;
35                 ans=0;
36                 mid=(left+right)/2;
37                 for (int i=0;i<n;i++)
38                 {
39                    // ans+=(int)(V[i]/mid);
40                     //if (ans>=f)
41                         //flag=1;
42                     double vv=V[i];
43                     while(vv>=mid)
44                     {
45                         vv-=mid;
46                         k++;
47                         //cout<<vv<<" "<<k<<endl;
48                         if(k==f)
49                         {
50                             flag=1;
51                             break;
52                         }
53                     }
54                     if(flag==1) break;
55                 }
56                 if(flag==1)
57                     left=mid;
58                 else
59                     right=mid;
60             }
61             printf("%.4lf\n",mid);
62         }
63     }
64     return 0;
65 }

另外一种

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cmath>
 4
 5 using namespace std;
 6
 7 #define PI acos(-1.0)
 8
 9 int main ()
10 {
11     int t;
12     while (~scanf("%d",&t))
13     {
14         while (t--)
15         {
16             int n,f,r;
17             double V[10005],v=0,vmax;
18             scanf("%d%d",&n,&f);
19             f=f+1;
20             for (int i=0; i<n; i++)
21             {
22                 scanf("%d",&r);
23                 V[i]=r*r*PI;
24                 v+=V[i];
25                 //cout<<v<<endl;
26             }
27             vmax=v/f;
28             double left,right,mid;
29             left=0;
30             right=vmax;
31             int ans;
32             while ((right-left)>1e-6)
33             {
34                 int flag=0,k=0;
35                 ans=0;
36                 mid=(left+right)/2;
37                 for (int i=0;i<n;i++)
38                 {
39                     ans+=(int)(V[i]/mid);
40                     if (ans>=f)
41                         flag=1;
42                     if(flag==1) break;
43                 }
44                 if(flag==1)
45                     left=mid;
46                 else
47                     right=mid;
48             }
49             printf("%.4lf\n",mid);
50         }
51     }
52     return 0;
53 }
时间: 2024-10-30 03:45:11

hdu 1969 Pie(二分查找)的相关文章

HDU 1969 Pie (二分查找)

题目链接:click here~~ 题目大意:n块馅饼分给m+1个人,每一个人的馅饼必须是整块的.馅饼能够被切开.但不能组合,也不一定要所有分完,问你每一个人最大能分到多大体积的馅饼面积. [解题思路]:二分,对于每一个V值,我们枚举相应情况下人数P的多少,发现是单调递减的,因此二分查找区间,初始值left=0,right=inf;然后judge函数推断当前mid值是否能使得p>=m,因此累计ans=num[i]/mid,写的时候二分用的是while推断,怎么调试答案就是差了那么一点点.后来索性

HDU 1969 Pie 二分

1.题意:一项分圆饼的任务,一堆圆饼共有N个,半径不同,厚度一样,要分给F+1个人.要求每个人分的一样多,圆饼允许切但是不允许拼接,也就是每个人拿到的最多是一个完整饼,或者一个被切掉一部分的饼,要求你算出每人能分到的饼的体积最大值.输入数据依次给出,测试数据组数T,每组数据中,给出N,F,以及N个圆饼的半径.输出最大体积的数值,精确到小数点后四位. 2.分析:一看是这种输出就知道用二分写会很高效,这里对"能分出的最大体积值"进行二分.首先,这个值有界,最大值为总体积除以总人数的值,即Σ

【hoj】2651 pie 二分查找

二分查找是一个很基本的算法,针对的是有序的数列,通过中间值的大小来判断接下来查找的是左半段还是右半段,直到中间值的大小等于要找到的数时或者中间值满足一定的条件就返回,所以当有些问题要求在一定范围内找到一个满足一些约束的值时就可以用二分查找,时间复杂度O(log n); 题目:http://acm.hit.edu.cn/hoj/problem/view?id=2651 因为题目有精度要求,对于浮点数小数点部分会有一定误差,所以可以选择将这些有小数部分的数值扩大e6倍,因为题目要求精确到e-3,之后

hdu 1969 Pie(贪心+二分查找)(简单)

Pie Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5628    Accepted Submission(s): 2184 Problem Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I

HDU 1969 (二分)

题目链接: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): 4547    Accepted Submission(s): 1837 Problem Description My birthday is coming up and tra

hdu 1969 Pie

Pie Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6752    Accepted Submission(s): 2564 Problem Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I h

HDU 1969 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

HDU 1969 Pie(二分搜索)

题目链接 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.

HDU 5878---预处理+二分查找

给一个数n,让你求一个大于等于n的最小的满足题意中2^a*3^b*5^c*7^d的数字. 思路: #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<string> #include<vector> #include <ctime> #include<queue> #include<set&g