zoukankan      html  css  js  c++  java
  • 【POJ 3122】Pie

    Pie
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 13258   Accepted: 4564   Special Judge

    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

    Source

     
    看到图片题目的图片好想吃。。
    这题其实不难,二分答案+检查。
    需要注意的是存储pie的个数的变量最好用long long,然后判断是否大于f+1,答案的精度控制在1e-5即可。
    pi=acos(-1)。
     
    #include <cstdio>
    #include <cstring>
    #include <cmath>
    
    using namespace std;
    
    const int MAXN = 10005;
    const double pi = acos(-1.0);
    
    int n, f, r[MAXN];
    
    bool check(double maxv)
    {
        long long howc = 0;
        for (int i = 0; i < n; ++i)
            howc += (long long) floor((double) r[i] * r[i] * pi / maxv);
        return howc >= f + 1;
    }
    
    void binarysearch(double L, double R)
    {
        if (R - L < 1e-5)
        {
            printf("%.4lf
    ", L);
            return;
        }
        double mid = (L + R) / 2.0;
        if (check(mid)) binarysearch(mid, R);
        else binarysearch(L, mid);
    }
    
    int main()
    {
        int Test;
        scanf("%d", &Test);
        while (Test--)
        {
            scanf("%d%d", &n, &f);
            double maxr = 0;
            for (int i = 0; i < n; ++i) scanf("%d", &r[i]), maxr += r[i] * r[i];
            binarysearch(0, maxr * pi);
        }
        return 0;
    }
  • 相关阅读:
    I2S波形解析
    F407整点原子I2C波形解码
    WAVE格式文件说明
    ADC结构体初始化成员
    这次,我是真的想吐槽MDK
    I2S源程序(正点原子F407探索者)
    强制类型转换
    嵌套结构体的初始化
    lua 元方法 __index
    lua pairs 与 ipairs
  • 原文地址:https://www.cnblogs.com/albert7xie/p/4905502.html
Copyright © 2011-2022 走看看