[自适应Simpson]Ellipse

Ellipse

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 965    Accepted Submission(s): 332

Problem Description

Math is important!! Many students failed in 2+2’s mathematical test, so let's AC this problem to mourn for our lost youth..
Look this sample picture:



A ellipses in the plane and center in point O. the L,R lines will be vertical through the X-axis. The problem is calculating the blue intersection area. But calculating the intersection area is dull, so I have turn to you, a talent of programmer. Your task is tell me the result of calculations.(defined PI=3.14159265 , The area of an ellipse A=PI*a*b )

 

Input

Input may contain multiple test cases. The first line is a positive integer N, denoting the number of test cases below. One case One line. The line will consist of a pair of integers a and b, denoting the ellipse equation  , A pair of integers l and r, mean the L is (l, 0) and R is (r, 0). (-a <= l <= r <= a).

 

Output

For each case, output one line containing a float, the area of the intersection, accurate to three decimals after the decimal point.

 

Sample Input

  
  

   
   2
2 1 -2 2
2 1 0 2
  
  

 

Sample Output

  
  

   
   6.283
3.142
  
  

 

Author

威士忌

 

Source

HZIEE 2007 Programming Contest

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   1722  1727  1721  1726  1725 

 

鉴于不会求积分，可以用自适应simpson作替代方法。很固定的代码。对于如果(L+R-A)<15eps，则满足条件这点，还需要再看书，再理解。

#include <cmath>
#include <cstdio>

double a,b,l,r;
double F(double x)
{
    return sqrt(b*b*(1-x*x/(a*a)));
}

double simpson(double a,double b)
{
    double c = a + (b-a)/2;
    return (F(a)+4*F(c)+F(b))*(b-a)/6;
}

double asr(double a,double b,double eps,double A)
{
    double c = a+(b-a)/2;
    double L = simpson(a,c) , R = simpson(c,b);
    if (fabs(L+R-A) <= 15*eps) return L+R+(L+R-A)/15.0;
    return asr(a,c,eps/2,L) + asr(c,b,eps/2,R);
}

double asr(double a,double b,double eps)
{
    return asr(a,b,eps,simpson(a,b));
}

double solve()
{
    return asr(l,r,1e-6)*2;
}

int main()
{
    int t;
    scanf("%d",&t);
    while (t--)
    {
        double ans;
        scanf("%lf%lf%lf%lf",&a,&b,&l,&r);
        ans = solve();
        printf("%.3lf\n",ans);
    }
}