J - Pie解题报告(黄杰)

转载 2012年03月21日 13:36:47

J - Pie
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

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

题目大意:有多组数据,每组数据有n个蛋糕和f个朋友,接下来n个数表示每个pie的半径,求每个人能分到的最大蛋糕体积,不能几块蛋糕拼成一块。
题目链接:http://poj.org/problem?id=3122
方法:二分法
思路:这个题就是用比较简单的二分法,二分法需要注意的有两点,一是以何值为二分的对象(一般都是要求的量),二是判断的条件(这往往是问题的关键)。在此题中,二分的对象很显然是每个人可以分到的pie体积,接着判断每块蛋糕可已分成几块这样大小的pie,记录和,最后判断和与人数的大小,进行高低点的移动,从而达到条件退出循环。这里有两点要注意,一是人数包括了自己,二是圆周率PI要尽可能精确,最好是用我代码中的直接公式表示,最精确。。(由于是写给那些不太明白的同学,略显啰嗦,因为看代码不如看思路,大神就无视吧。。顺便求指点)
算法实现:

#include<stdio.h>
#include<math.h>
#define MAX 10001
#define PI acos(-1.0);//精确度提高。
int main()
{
	int num,n,f,r,i,sum;
	double low,high,mid,v[MAX];
	scanf("%d",&num);
	while(num--)
	{
		scanf("%d%d",&n,&f);
		low=0;
		high=0;
		for(i=0;i<n;i++)
		{
			scanf("%d",&r);
			v[i]=r*r*PI;
			high+=v[i];
		}
		f+=1;//包括自己.
		high/=f;
		while(high-low>=1e-7)
		{
			sum=0;
			mid=(low+high)/2.0;
			for(i=0;i<n;i++)
				sum+=(int)(v[i]/mid);//记录可以分成多少块。
			if(sum>=f)
				low=mid;
			else
				high=mid;
		}
		printf("%.4f\n",mid);
	}
	return 0;  
}




相关文章推荐

I - Expanding Rods解题报告(黄杰)

I - Expanding Rods Time Limit:1000MS     Memory Limit:30000KB     64bit IO Format:%I64d & %I64u ...

G - Monthly Expense解题报告(黄杰)

G - Monthly Expense Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u ...

A - SnowflakeSnowSnowflakes解题报告(黄杰)

A - SnowflakeSnowSnowflakes Time Limit:4000MS     Memory Limit:65536KB     64bit IO Format:%I64d & ...

F - Babelfish解题报告(黄杰)

F - Babelfish Time Limit:3000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submi...

D - Eqs解题报告(黄杰)

D - Eqs Time Limit:5000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Stat...

POJ3311 Hie with the Pie ACM解题报告(Floyd+状压dp)

题意是有N个城市(1~N)和一个PIZZA店(0),要求一条回路,从0出发,又回到0,而且距离最短   也就是TSP(旅行商)问题,首先不难想到用FLOYD先求出任意2点的距离dis[i][j]  ...

Pie解题报告

My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N ...

POJ-1129 Pie 解题报告

Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I h...

二分查找——D:Pie 解题报告

Pie Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no...

POJ 3122 Pie解题报告

Description My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I hav...
  • HJ_Air
  • HJ_Air
  • 2012年03月16日 13:38
  • 369
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:J - Pie解题报告(黄杰)
举报原因:
原因补充:

(最多只允许输入30个字)