HDU 1255 覆盖的面积

矩形面积交。跟面积并差不多，只不过要记录两种信息，就是覆盖的次数，每次求出覆盖超过两次的线段的长度，乘以高，累加即可。pushup里面需要注意一下，当覆盖次数超过1和等于0时都正常处理，但当覆盖次数等于1时，是指当前区间的覆盖次数，考虑到他的子区间可能也会有覆盖过，所以所有之前覆盖过的子区间，现在都是又多被覆盖了1次。即sum[rt][1] = sum[rt << 1][0] + sum[rt << 1][1] + sum[rt << 1 | 1][0] + sum[rt << 1 | 1][1];

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<string>
#include<queue>
#include<cmath>
#include<map>
///LOOP
#define REP(i, n) for(int i = 0; i < n; i++)
#define FF(i, a, b) for(int i = a; i < b; i++)
#define FFF(i, a, b) for(int i = a; i <= b; i++)
#define FD(i, a, b) for(int i = a - 1; i >= b; i--)
#define FDD(i, a, b) for(int i = a; i >= b; i--)
///INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RFI(n) scanf("%lf", &n)
#define RFII(n, m) scanf("%lf%lf", &n, &m)
#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)
#define RS(s) scanf("%s", s)
///OUTPUT
#define PN printf("\n")
#define PI(n) printf("%d\n", n)
#define PIS(n) printf("%d ", n)
#define PS(s) printf("%s\n", s)
#define PSS(s) printf("%s ", s)
#define PC(n) printf("Case %d: ", n)
///OTHER
#define PB(x) push_back(x)
#define CLR(a, b) memset(a, b, sizeof(a))
#define CPY(a, b) memcpy(a, b, sizeof(b))
#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1

using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int MOD = 1e9+7;
const int INFI = 1e9 * 2;
const LL LINFI = 1e17;
const double eps = 1e-6;
const double pi = acos(-1.0);
const int N = 2222;
const int M = N << 2;
const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};

struct node
{
    int k;
    double x1, x2, y;
    node(){};
    node(double a, double b, double c, int d){x1 = a, x2 = b, y = c, k = d;};
    bool operator < (const node p) const
    {
        return y < p.y;
    }
}seg[M];

int cnt[M], L, R;
double sum[M][2], X[M];

void pushup(int l, int r, int rt)
{
    if(cnt[rt] > 1)
    {
        sum[rt][0] = 0;
        sum[rt][1] = X[r + 1] - X[l];
    }
    else if(cnt[rt] == 1)
    {
        sum[rt][1] = sum[rt << 1][0] + sum[rt << 1][1] + sum[rt << 1 | 1][0] + sum[rt << 1 | 1][1];
        sum[rt][0] = X[r + 1] - X[l] - sum[rt][1];
    }
    else if(l == r)sum[rt][0] = sum[rt][1] = 0;
    else REP(i, 2)sum[rt][i] = sum[rt << 1][i] + sum[rt << 1 | 1][i];
}

void update(int c, int l, int r, int rt)
{
    if(L <= l && r <= R)
    {
        cnt[rt] += c;
        pushup(l, r, rt);
        return;
    }
    int m = (l + r) >> 1;
    if(L <= m)update(c, lson);
    if(R > m) update(c, rson);
    pushup(l, r, rt);
}

int main()
{
    //freopen("input.txt", "r", stdin);

    int t, n, m, k;
    double a, b, c, d, ans;
    RI(t);
    while(t--)
    {
        RI(n);
        CLR(cnt, 0);
        CLR(sum, 0);
        m = k = ans = 0;
        REP(i, n)
        {
            RFIV(a, b, c, d);
            X[m++] = a;
            X[m++] = c;
            seg[k++] = node(a, c, b, 1);
            seg[k++] = node(a, c, d, -1);
        }
        sort(X, X + m);
        sort(seg, seg + k);
        m = unique(X, X + m) - X;
        REP(i, k - 1)
        {
            L = lower_bound(X, X + m, seg[i].x1) - X;
            R = lower_bound(X, X + m, seg[i].x2) - X - 1;
            update(seg[i].k, 0, m - 1, 1);
            ans += sum[1][1] * (seg[i + 1].y - seg[i].y);
        }
        printf("%.2lf\n", ans);
    }
    return 0;
}