HDU1969:Pie(二分)

15 篇文章 1 订阅
9 篇文章 0 订阅
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
网上代码:
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;

const double pi = acos(-1.0);
double a[10005];
int n,m;

int check(double mid)
{
    int i;
    int sum = 0;
    for(i = 0; i<n; i++)
    {
        sum+=int(a[i]/mid);
        if(sum>=m)
            return 1;
    }
    return 0;
}

int cmp(double a,double b)
{
    return a>b;
}

int main()
{
    int t,i,j;
    double l,r,mid;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        m++;
        for(i = 0; i<n; i++)
        {
            scanf("%lf",&a[i]);
            a[i] = a[i]*a[i]*pi;
        }
        sort(a,a+n,cmp);
        l = 0;
        r = a[0];
        if(m<n)
            n = m;
        while(r-l>1e-5)
        {
            mid = (r+l)/2;
            if(check(mid))
                l = mid;
            else
                r = mid;
        }
        printf("%.4lf\n",l);
    }

    return 0;
}


#include <stdio.h>  
#include <math.h>  
#define size 10001  
#define eps 1e-7  
#define PI acos(-1.0)  
  
int N,K;  
double len[size];  
  
bool GetPiece(double x)  
{  
    int i,count = 0;  
    for (i=0;i<N;i++)  
    {  
        count+=len[i]/x;  
        if(count>=K+1)  
            return 1;  
    }  
    return 0;  
}  
  
int main()  
{  
    int test,i;  
    double sum;  
    double l,r,m;  
    /*freopen("d://2.txt","r",stdin);*/  
    scanf("%d",&test);  
    while (test--)  
    {  
        scanf("%d%d",&N,&K);  
        sum = 0;  
        for(i=0;i<N;i++)  
        {  
            scanf("%lf",&len[i]);  
            len[i] = len[i]*len[i]*PI;  
            sum+=len[i];  
        }  
        r = (double)sum/(K+1);/*蛋糕最大体积*/  
        l = 0;  
        while (r-l>=eps)  
        {  
            m = (double)(r+l)/2;  
            if(GetPiece(m))  
                l = m;  
            else  
                r = m;  
        }  
        printf("%.4lf/n",m);  
    }  
    return 0;  
自己代码:
#include<stdio.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;
const double PI = acos(-1.0);
int a[1005],n,m;//n蛋糕的数量,m人数
int main()
{
    int i,test;
    scanf("%d",&test);
    double sum_V=0,r,s,Max;
    while(test--)
    {
        sum_V=0;
        scanf("%d%d",&n,&m);
        for(i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            a[i]=a[i]*a[i]*PI;//存各个蛋糕的面积
            sum_V+=a[i];
        }
        sort(a,a+n);
        Max=sum_V/(m+1);//每个人最多能分到的蛋糕面积
        double Count=0,mid,k=0;
        while(Max-k>1e-5)
        {
            int flag=0;
            mid=(Max+k)/2;
            for (i=0;i<n;i++)
            {
                Count+=a[i]/mid;
                if(Count>=m+1)
                 {
                     flag=1;
                     k=mid;
                 }
            }
            if(!flag)
                Max=mid;
        }
    printf("%.4lf\n",k);
    }
    return 0;

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值