HDOJ 1969 Pie (二分)

Pie

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 6681    Accepted Submission(s): 2531

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
  
  

注 - 此题为：  HDOJ 1969 Pie  (二分)

题意：    要办生日Party，有 N个馅饼，有 F个朋友，接下来是 n 个馅饼的 半径。然后,分馅饼，注意自己也要（总人数为 F+ 1）大家都要一样大，形状没什么要求， 但都要是一整块的那种，也就是说不能从两个饼中各割一小块来凑一块       （饼的厚度是1，所以面积和体积相等）， 题目要求我们分到的饼尽可能的大！二分法,可以直接二分每一个人得到的最大体积  ,  然后看在 当前的体积 能不能得到  F+1 那么多块蛋糕。 要注意精度问题。

已AC代码：

#include<cstdio>
#include<cmath>
#define PI acos(-1.0)   // PI 的值 
int N,F;
double s[11000];

int judge(double x)
{
	int num=0,i;
	for(i=0;i<N;++i)
	{
		num+=(int)(s[i]/x); // 可分数量 
	}
	return num>=F+1;
}
int main()
{
	int T,i;
	scanf("%d",&T);
	while(T--)
	{
		double r;
		scanf("%d%d",&N,&F);
		for(i=0;i<N;++i)
		{
			scanf("%lf",&r);  // 半径 
			s[i]=PI*r*r;  // 面积 
		}
		double mid,left=0,right=31500000000.0; // 要足够大 
		while(right-left>1e-7) // 二分 
		{
			mid=(left+right)/2;
			if(judge(mid))
				left=mid;
			else
				right=mid;
		}
		printf("%.4lf\n",left);
	}
	return 0;
}