2006 ACM Northwestern European Programming Contest C题(二分求最大)

原创 2013年12月08日 22:59:46

My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a numberN 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 ≤ 10000: the number of pies and the number of friends.
  • One line with N integers ri with 1 ≤ri ≤ 10000: the radii of the pies.

Output

For each test case, output one line with the largest possible volumeV 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
The 2006 ACM Northwestern European Programming Contest 


题意:有F+1个人来分圆形的派,每人只能分一整块,不能几块拼起来,且面积相同,求每人最多分到多大的派(不必是圆形,但是要一整块)
思路:问题其实就是是否让每人分到一块面积为x的派,我们可以尝试着去试这个x,直到x太大,不能分给F+1个人为止,所以二分法又派上用场了,二分法真正思想其实很博大精深,不是说你会用二分法查找有序列里的一个数你就会二分法了,其实还在门外,好了这道题对于这里的半径为r的派,只能切出PI*r*r* / x个派,把所有的圆切一遍,再判断是否够分就可以了。

#include <iostream>
#include <cmath>
using namespace std;

#define MAX(a, b) ((a) > (b) ? (a) : (b)) 

const int maxn = 10010;
const double PI = acos(-1.0);
double s[maxn];
int n, f, r;

int ok(double x)
{
	int sum = 0;
	for (int i = 0; i < n; i++) sum += floor(s[i] / x);
	return sum >= f + 1;
}

int main()
{
	int T;
	cin>>T;
	while (T--)
	{
		cin>>n>>f;
		double max = -1;//找最大圆的面积
		for (int i = 0; i < n; i++)
		{
			cin>>r;
			s[i] = PI * r * r;
			max = MAX(max, s[i]);
		}

		//二分找最大
		double L = 0, R = max;
		while (R - L > 1e-5)
		{
			double M = (L + R) / 2;
			if (ok(M)) L = M;
			else R = M;
		}
		printf("%.5lf\n", L);
	}
	return 0;
}





2016-2017 ACM-ICPC Southwestern European Regional Programming Contest (SWERC 2016)

链接:http://codeforces.com/gym/101174 A.Within Arm's Reach (占坑) B.Bribing Eve 题解: 这道题看网上有dalao通过旋转卡壳...
  • sinat_32872703
  • sinat_32872703
  • 2017年04月03日 14:03
  • 573

ACM Southwestern European Regional Programming Contest (SWERC) 2017 J 智商题(模m同余)

点击打开链接 //模3同余即为同种颜色 //((a%c)+(b%c))%c==(a+b)%c #include #include #include using namespace std; typ...
  • m0_37428263
  • m0_37428263
  • 2018年01月28日 09:50
  • 20

2015-2016 ACM-ICPC Southwestern Europe Regional Contest (SWERC 15) A题Promotions

题目大意:给你一个DAG关于1到(E-1)个数字,然后有一个[A,B]的区间,让你给其中一些人升职,但是升职的前提是需要给他的上级升职,也就是说1->2意味着当你要给2升职的之前,先让他的上级1升职,...
  • qq_34826781
  • qq_34826781
  • 2017年03月30日 21:37
  • 723

2016-2017 ACM-ICPC Northeastern European Regional Contest (NEERC 16) Gym - 101190H bitset,逻辑表达式模拟

题目链接:http://codeforces.com/gym/101190/attachments 题意:给了一堆逻辑表达式,判断是否对于所有的整数(-2^15 - 2^15-1)范围类的数,都满足...
  • just_sort
  • just_sort
  • 2017年03月26日 21:17
  • 664

Southeastern European Regional Programming Contest 2010 D Problemsetting

又一次在比赛中碰到网络流,又一次没有搞出来,剁手啊!!! 刚开始队友跟我说这题像是网络流,但我想了想,觉得最大流不能保证每个比赛节点都能满流,所以。。。。。 赛后队友想到了二进制枚举选取的比赛,然后根...
  • diary_yang
  • diary_yang
  • 2013年07月22日 19:50
  • 829

2015-2016 ACM-ICPC Southwestern Europe Regional Contest (SWERC 15)训练总结【7/10】

A.反向建图,处理出各种极限情况即可,我是萌萌哒A题题解 B. C.正难则反,反向考虑转化问题贪心即可,我是萌萌哒C题题解 D.全场题,水题,暴力即可。 E.Dp,我是萌萌哒E题题解 F. G. H....
  • mengxiang000000
  • mengxiang000000
  • 2017年08月16日 19:15
  • 300

ACM ICPC 2017 Warmup Contest 4(ACM Northeastern European Regional Contest,Northern Subregion 2015)

手工折方形 矩阵切割 水题 比大小 开彩票 预处理最大值 暴力枚举 变换表达式 寻找贪心策略 模拟...
  • Owen_Q
  • Owen_Q
  • 2017年10月07日 21:00
  • 144

2015-2016 ACM-ICPC Southwestern Europe Regional Contest (SWERC 15) C - Canvas Painting(优先队列)

题目链接https://vjudge.net/problem/553795/origin题目大意给你n块已知染色所需墨水数的白色帆布,开始染色前可以改变帆布 排列顺序,问你把所有帆布染成不同颜色所...
  • qq_36378681
  • qq_36378681
  • 2017年05月05日 19:39
  • 344

Codeforces Gym 2015 ACM Amman Collegiate Programming Contest

比赛链接: http://codeforces.com/gym/100712 题目链接: http://codeforces.com/gym/100712/attachments/download/3...
  • quailty
  • quailty
  • 2015年07月20日 08:47
  • 1816

杭电ACM2006奇数的乘积

#include using namespace std; int main() { int n,t,x=1; while(cin>>n) { x=1; wh...
  • wangyang1354
  • wangyang1354
  • 2013年03月17日 20:27
  • 2383
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:2006 ACM Northwestern European Programming Contest C题(二分求最大)
举报原因:
原因补充:

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