POJ_1129 pie 解题报告

原创 2012年03月21日 15:44:27
 
                                                                                                         J - Pie
      Crawling in process... Crawling failed 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

 

这是一道关于生日的时候分饼的问题。要求是每个人分到的饼的体积要相同,并且只能由一块大饼分成小饼,而不能是几块小饼拼凑成一块大的。题目先输入一个数表示一共有多少组数据,然后输入两个整数表示饼的个数和朋友的人数,再接着输入每个饼的半径。我们要求的是每个人可以分到的最大的饼的体积。要注意的是计算人数的时候一定要加上自己当看到这道题目的时候我的第一想法是通过将饼的大小进行排序,在根据人数的多少从大到小的顺序进行分饼,这就要判断每个饼分到人后的体积与下一个饼的体积的比较,还有体积的计算都不好算。后来我到网上找了思路才知道这道题目用二分法做比较简单。先求出每个人能分到的最大的体积,即总体积除以总人数,然后对每个人将要分到的体积进行二分,将每个饼除以这个体积求出这些饼可以分成多少人,若此人数大于总人数就扩大二分法的左边值继续进行二分,反之就减小二分法的右值在进行二分,最后求出分到的最大体积。

#include<iostream>
#include <cmath>
using namespace std;
int A,B;
double V[10000];//用于记录每个饼的体积。
double pi = acos ( -1.0 );//精确求pi的值。
int test(double mid)//二分的测试过程。
{
	int num=0;
	int i;
	for(i=0;i<A;i++)
	{
		num+=V[i]/mid;//求饼可以分成的总人数.
	}
	if(num>B)
		return 1;
	else
		return 0;
}
int main()
{
	int i,N,r;
	double v,R,L,mid;
	scanf("%d",&N);
	while(N--)
	{
		v=0;
		scanf("%d%d",&A,&B);
		for(i=0;i<A;i++)
		{
			scanf("%d",&r);
			V[i]=r*r*pi;
			v+=V[i];
		}
		L=0;
		R=v/(B+1);//计算每个人可分到的最大体积数。
		while((R-L)>1e-6)
		{
			mid=(R+L)/2;
			if(test(mid)==1)
				L=mid;
			else
				R=mid;
		}
		printf("%.4lf\n",mid);
	}
	return 0;
}

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

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

POJ-1129 Pie 解题报告

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

Pie解题报告

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

POJ - 1129 Channel Allocation解题报告(涂色问题+四色定理)

题目大意: 模型化好像就是涂颜色,相连的点不能涂一个颜色。告诉你了哪些点相连。问你至少需要多少种颜色...

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

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

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
  • 375

POJ-3122 Pie 解题报告(二分) 平分派饼

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

poj 1659解题报告

  • 2010年04月07日 00:25
  • 4KB
  • 下载

POJ 225道题目解题报告

  • 2013年02月06日 11:53
  • 196KB
  • 下载

J - Pie解题报告(黄杰)

J - Pie Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Stat...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ_1129 pie 解题报告
举报原因:
原因补充:

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