hdu 5120(几何+容斥)

题意：给出两个相同的环的小半径r和大半径R，然后给出两个环的圆心坐标，问两个环的重叠面积。
题解：按圆心距与半径的关系分四种情况，容斥+求两圆重叠面积模板。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
const double eps = 1e-10;
const double PI = acos(-1);

int dcmp(double x) {
    if (fabs(x) < eps)
        return 0;
    return x > 0 ? 1 : -1;
}
struct Point {
    double x, y;
    Point(double a = 0, double b = 0): x(a), y(b) {}
};
typedef Point Vector;
typedef vector<Point> Polygon;

Vector operator + (const Vector& a, const Vector& b) { return Vector(a.x + b.x, a.y + b.y); }
Vector operator - (const Vector& a, const Vector& b) { return Vector(a.x - b.x, a.y - b.y); }
Vector operator * (const Vector& a, double b) { return Vector(a.x * b, a.y * b); }
Vector operator / (const Vector& a, double b) { return Vector(a.x / b, a.y / b); }
bool operator == (const Vector& a, const Vector& b) { return !dcmp(a.x - b.x) && !dcmp(a.y - b.y); }
bool operator < (const Vector& a, const Vector& b) { return a.x < b.x || (a.x == b.x && a.y < b.y); }
double Dot(const Vector& a, const Vector& b) { return a.x * b.x + a.y * b.y; }
double Length(const Vector& a) { return sqrt(Dot(a, a)); }
double Cross(const Vector& a, const Vector& b) { return a.x * b.y - a.y * b.x; }
double Angle(const Vector& a, const Vector& b) { return acos(Dot(a, b) / Length(a) / Length(b)); }
double angle(Vector v) { return atan2(v.y, v.x); }
double Sqr(double x) { return x * x; }

struct Circle {
    Point c;
    double r;
    Circle() {}
    Circle(Point a, double b = 0): c(a), r(b) {}
    Point point(double a) {
        return Point(c.x + cos(a) * r, c.y + sin(a) * r);
    }
};

double solve(Circle c1, Circle c2) {
    double d = Length(c1.c - c2.c);
    if (dcmp(d) == 0)
        return PI * Sqr(c2.r);
    if (dcmp(fabs(c1.r - c2.r) - d) >= 0)
        return PI * Sqr(c2.r);
    double rad1 = 2.0 * acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2.0 * c1.r * d));
    double rad2 = 2.0 * acos((c2.r * c2.r + d * d - c1.r * c1.r) / (2.0 * c2.r * d));
    double ang1 = rad1 * 180.0 / PI;
    double ang2 = rad2 * 180.0 / PI;
    double TriS1 = 0.5 * Sqr(c1.r) * sin(rad1);
    double TriS2 = 0.5 * Sqr(c2.r) * sin(rad2);
    double S = TriS1 + TriS2;
    double sh1 = ang1 * PI * Sqr(c1.r) / 360.0;
    double sh2 = ang2 * PI * Sqr(c2.r) / 360.0;
    double res = sh1 + sh2 - S;
    return res;
}

int main() {
    int t, cas = 1;
    scanf("%d", &t);
    while (t--) {
        Circle c1, c2;
        double x1, y1, x2, y2, r, R;
        scanf("%lf%lf", &r, &R);
        scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
        c1.c.x = x1, c1.c.y = y1;
        c2.c.x = x2, c2.c.y = y2;
        printf("Case #%d: ", cas++);
        double d = Length(c1.c - c2.c);
        if (dcmp(d - R - R) >= 0) {
            printf("0.000000\n");
            continue;
        }
        else if (dcmp(d - R - R) < 0 && dcmp(d - R - r) >= 0) {
            c1.r = R, c2.r = R;
            printf("%.6lf\n", solve(c1, c2));
        }
        else if (dcmp(d - R - r) < 0 && dcmp(d - r - r) >= 0) {
            c1.r = R, c2.r = R;
            double temp1 = solve(c1, c2);
            c1.r = R, c2.r = r;
            double temp2 = solve(c1, c2);
            printf("%.6lf\n", temp1 - 2.0 * temp2);
        }
        else if (dcmp(d - r - r) < 0) {
            c1.r = R, c2.r = R;
            double temp1 = solve(c1, c2);
            c1.r = R, c2.r = r; 
            double temp2 = solve(c1, c2);
            c1.r = r, c2.r = r;
            double temp3 = solve(c1, c2);
            printf("%.6lf\n", temp1 - 2.0 * temp2 + temp3);
        }
    }
    return 0;
}