HDU5120：Intersection（圆环相交）

Intersection

Time Limit: 4000/4000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 3071    Accepted Submission(s): 1154

Problem Description

Matt is a big fan of logo design. Recently he falls in love with logo made up by rings. The following figures are some famous examples you may know.


A ring is a 2-D figure bounded by two circles sharing the common center. The radius for these circles are denoted by r and R (r < R). For more details, refer to the gray part in the illustration below.


Matt just designed a new logo consisting of two rings with the same size in the 2-D plane. For his interests, Matt would like to know the area of the intersection of these two rings.

 

Input

The first line contains only one integer T (T ≤ 10 ⁵), which indicates the number of test cases. For each test case, the first line contains two integers r, R (0 ≤ r < R ≤ 10).

Each of the following two lines contains two integers x _i, y _i (0 ≤ x _i, y _i ≤ 20) indicating the coordinates of the center of each ring.

 

Output

For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1) and y is the area of intersection rounded to 6 decimal places.

 

Sample Input

  
  

   
   2
2 3
0 0
0 0
2 3
0 0
5 0
  
  

 

Sample Output

  
  

   
   Case #1: 15.707963
Case #2: 2.250778
  
  

 

Source

2014ACM/ICPC亚洲区北京站-重现赛（感谢北师和上交）

题意：给两个大小半径均一样的圆环，求相交面积。

思路：ans = 大大+小小-2*大小，（大大指大圆和大圆相交的面积）。

# include <iostream>
# include <cstdio>
# include <cmath>
# define eps 1e-8
# define PI acos(-1.0)
using namespace std;

double distance(double x0, double y0, double x1, double y1)
{
    return sqrt((x0-x1)*(x0-x1)+(y0-y1)*(y0-y1));
}

double area(double dis, double r1, double r2){
    double d=dis;
    if(r1+r2<d+eps) return 0;
    if(d<fabs(r1-r2)+eps){
        double r=min(r1,r2);
        return PI*r*r;
    }
    double x=(d*d+r1*r1-r2*r2)/(2*d);
    double t1=acos(x/r1);
    double t2=acos((d-x)/r2);
    return r1*r1*t1+r2*r2*t2-d*r1*sin(t1);
}

int main()
{
    int t, cas=1;
    double r, R, x0, y0, x1, y1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lf%lf%lf%lf%lf%lf",&r,&R,&x0,&y0,&x1,&y1);
        double dis = distance(x0, y0, x1, y1);
        double ans = area(dis, R, R)+area(dis, r, r)-2*area(dis, r, R);
        printf("Case #%d: %.6f\n",cas++, ans);
    }
    return 0;
}