杭电acm2289二分法

Cup

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 10859 Accepted Submission(s): 3355

Problem Description

The WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height?

The radius of the cup’s top and bottom circle is known, the cup’s height is also known.

Input

The input consists of several test cases. The first line of input contains an integer T, indicating the num of test cases.
Each test case is on a single line, and it consists of four floating point numbers: r, R, H, V, representing the bottom radius, the top radius, the height and the volume of the hot water.

Technical Specification

1. T ≤ 20.
2. 1 ≤ r, R, H ≤ 100; 0 ≤ V ≤ 1000,000,000.
3. r ≤ R.
4. r, R, H, V are separated by ONE whitespace.
5. There is NO empty line between two neighboring cases.

Output

For each test case, output the height of hot water on a single line. Please round it to six fractional digits.

Sample Input

1
100 100 100 3141562

Sample Output

99.999024

题目大意：有一个圆台型的杯子，已知杯子上底面，下地面的半径，杯子的高和水的体积，求这些水装到这个被子里面的高？

分析：显然二分法，但是要注意所给圆台上，下地面的半径不要弄反了，（这道题所给的测试数据上，下地面半径相同，很容易忽略杯子是圆台型的）。要用相似求出水装进去上底面的半径，u=h/H*(R-r)+r 。这道题特别类似杭电2199的二分法：
[https://blog.csdn.net/weixin_42917994/article/details/81662223]

#include<iostream>
#include<cstdio>
#include<cmath>
#define PI acos(-1.0) //acos是反三角
using namespace std;
double r,R,H,V;
double F(double h)
{
    double u=h/H*(R-r)+r;//R上面半径，r下面半径 
    return (1.0/3)*PI*h*(u*u+u*r+r*r)-V;//(1/3)的值为0，(1.0/3)的值才有效
}
int main()
{
   int T;
   cin>>T;
   while(T--)
   {
     cin>>r>>R>>H>>V; 
     double low,high,mid;
     low=0;
     high=H;
     while(high-low>1e-9)
     {
        mid=(low+high)/2;
        if(F(mid)>0)
          high=mid;
        else
          low=mid;
     }
     printf("%.6f\n",mid);
   }
}