专题二1003

*题意 公平地分披萨pie，有n个pie，找来f个朋友，加上自己那么总人数共f+1人

*解题思路 这是一个二分法的题目，不断进行二分演算就可以了，还要注意的就是精度的问题。

*AC源码

# include<iostream>

# include<iomanip>

using namespace std;

const double pi=3.14159265359;

const double esp=1e-6;

int main(void)

{

int test;

cin>>test;

while(test--)

{

int n,f;

cin>>n>>f;

double* v=new double[n+1];

f++;

double maxsize=0.0;

for(int i=1;i<=n;i++)

{

cin>>v[i];

v[i]*=v[i];

if(maxsize<v[i])

maxsize=v[i];

}

double low=0.0;

double high=maxsize;

double mid;

while(high-low>esp)

{

mid=(low+high)/2;

int count_f=0;

for(int i=1;i<=n;i++)

count_f+=(int)(v[i]/mid);

if(count_f < f)

high=mid;

else

low=mid;

}

cout<<fixed<<setprecision(4)<<mid*pi<<endl;

delete v;

}

return 0;

}

Pie

Time Limit : 5000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 224 Accepted Submission(s) : 59

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.<br><br>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. <br><br>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.<br>

Input

One line with a positive integer: the number of test cases. Then for each test case:<br>---One line with two integers N and F with 1 <= N, F <= 10 000: the number of pies and the number of friends.<br>---One line with N integers ri with 1 <= ri <= 10 000: the
radii of the pies.<br>

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<br>3 3<br>4 3 3<br>1 24<br>5<br>10 5<br>1 4 2 3 4 5 6 5 4 2<br>

Sample Output

25.1327<br>3.1416<br>50.2655<br>

Source

NWERC2006

Statistic | Submit | Back