半平面交

#include <cstdio>
#include <cmath>
#include <algorithm>

using namespace std;

const double eps = 1e-8;

int Sign(double x) {
    if (fabs(x) < eps)return 0;
    return x < 0 ? -1 : 1;
}

struct Point {
    double x, y;
} ans[505];

Point operator+(const Point &u, const Point &v) { return {u.x + v.x, u.y + v.y}; }

Point operator-(const Point &u, const Point &v) { return {u.x - v.x, u.y - v.y}; }

double operator*(const Point &u, const Point &v) { return u.x * v.x + u.y * v.y; }

Point operator*(const double &u, const Point &v) { return {u * v.x, u * v.y}; }

double operator^(const Point &u, const Point &v) { return u.x * v.y - v.x * u.y; }

struct Line {
    Point o, e;
    double r;

    bool On_Right(Point p) { return Sign((e - o) ^ (p - o)) < 0; }
} a[505], st[505];

Line Structure(Point u, Point v) {
    Point d = v - u;
    return {u, v, atan2(d.y, d.x)};
}

Point Intersection(Line u, Line v) {
    Point v1 = u.e - u.o, v2 = v.e - v.o, u1 = v.o - u.o;
    return v.o + ((u1 ^ v1) / (v1 ^ v2)) * v2;
}

int n = 0;

bool cmp(Line u, Line v) {
    return Sign(u.r - v.r) == 0 ? Sign((u.e - u.o) ^ (v.e - u.o)) > 0 : Sign(u.r - v.r) < 0;
}

signed main() {
//    freopen("in", "r", stdin), freopen("out1", "w", stdout);
    int Text;
    scanf("%d", &Text);
    for (int Case = 1; Case <= Text; Case++) {
        int m;
        scanf("%d", &m);
        Point o = {0, 0};
        scanf("%lf %lf", &o.x, &o.y);
        Point l = o;
        for (int i = 2; i <= m; i++) {
            Point p = {0, 0};
            scanf("%lf %lf", &p.x, &p.y);
            a[++n] = Structure(l, p);
            l = p;
        }
        a[++n] = Structure(l, o);
    }
    sort(a + 1, a + 1 + n, cmp);
    int m = 0;
    for (int i = 1; i <= n; i++) {
        if (Sign(a[i].r - a[i - 1].r) != 0)m++;
        a[m] = a[i];
    }
    n = m;
    int l = 1, r = 0;
    for (int i = 1; i <= n; i++) {
        while (l < r && a[i].On_Right(Intersection(st[r], st[r - 1])))r--;
        while (l < r && a[i].On_Right(Intersection(st[l], st[l + 1])))l++;
        st[++r] = a[i];
    }
    while (l < r && st[l].On_Right(Intersection(st[r], st[r - 1])))r--;
    while (l < r && st[r].On_Right(Intersection(st[l], st[l + 1])))l++;
    n = 0;
    for (int i = l; i < r; i++)ans[++n] = Intersection(st[i], st[i + 1]);
    ans[++n] = Intersection(st[r], st[l]);
    double Ans = 0;
    for (int i = 2; i < n; i++)Ans += fabs((ans[i] - ans[1]) ^ (ans[i + 1] - ans[1])) / 2;
    printf("%.3lf\n", Ans);
    return 0;
}