覆盖的面积 (扫描线模板题)

给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. 

 

Input

输入数据的第一行是一个正整数T(1<=T<=100),代表测试数据的数量.每个测试数据的第一行是一个正整数N(1<=N<=1000),代表矩形的数量,然后是N行数据,每一行包含四个浮点数,代表平面上的一个矩形的左上角坐标和右下角坐标,矩形的上下边和X轴平行,左右边和Y轴平行.坐标的范围从0到100000. 

注意:本题的输入数据较多,推荐使用scanf读入数据. 

Output

对于每组测试数据,请计算出被这些矩形覆盖过至少两次的区域的面积.结果保留两位小数. 

Sample Input

2
5
1 1 4 2
1 3 3 7
2 1.5 5 4.5
3.5 1.25 7.5 4
6 3 10 7
3
0 0 1 1
1 0 2 1
2 0 3 1

Sample Output

7.63
0.00

//#include"bits/stdc++.h"
//#include<unordered_map>
//#include<unordered_set>
#include<iostream>
#include<sstream>
#include<iterator>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<set>
#include<vector>
#include<bitset>
#include<climits>
#include<queue>
#include<iomanip>
#include<cmath>
#include<stack>
#include<map>
#include<ctime>
#include<new>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define MT(a,b) memset(a,b,sizeof(a))
#define lson l, mid, node<<1
#define rson mid + 1, r, node<<1|1
const int INF  =  0x3f3f3f3f;
const int O    =  1e6;
const int mod  =  1e9 + 7;
const int maxn =  1e5 + 5;
const double PI  =  acos(-1.0);
const double E   =  2.718281828459;

struct dd{
    double l, r, h;
    int ok;
    bool friend operator < (dd a, dd b){ return a.h < b.h; }
}line[maxn<<2];

double X[maxn<<2];

double treeSum[maxn<<2];

int treeNum[maxn<<2];

void pushup(int l, int r, int node){
    if(treeNum[node<<1] == treeNum[node<<1|1]) treeNum[node] = treeNum[node<<1];
    else treeNum[node] = -1;
    treeSum[node] = treeSum[node<<1] + treeSum[node<<1|1];
}

void pushdown(int l, int r, int node){
    if(treeNum[node] != -1){
        int mid = (l + r) >> 1;
        treeNum[node<<1|1] = treeNum[node<<1] = treeNum[node];
        if(treeNum[node] > 1) {
            treeSum[node<<1] = X[mid+1] - X[l];
            treeSum[node<<1|1] = X[r+1] - X[mid+1];
        }
        else  treeSum[node<<1] = treeSum[node<<1|1] = 0;
    }
}

void build(int l, int r, int node){
    if(l == r) {
        treeSum[node] = treeNum[node] = 0;
        return ;
    }
    int mid = (l + r) >> 1;
    build(lson); build(rson);
    pushup(l, r, node);
}

void update(int ql, int qr, int ok, int l, int r, int node){
    if(ql <= l && qr >= r && treeNum[node] != -1) {
        treeNum[node] += ok;
        if(treeNum[node] > 1) treeSum[node] = X[r + 1] - X[l];
        else treeSum[node] = 0;
        return ;
    }
    pushdown(l, r, node);
    int mid = (l + r ) >> 1;
    if(ql <= mid) update(ql, qr, ok, l, mid, node<<1);
    if(qr > mid)  update(ql, qr, ok, mid + 1, r, node<< 1|1);
    pushup(l , r, node);
}

int fun(double pos, int m, double x[]){
    int l = 1, r = m, ans = -1;
    while(l <= r){
        int mid = (l + r) >> 1;
        if(X[mid] <= pos ) {ans = mid ; l = mid + 1; }
        else r = mid - 1;
    }
    return ans ;
}

int main(){
    int T; scanf("%d", &T);
    while( T -- ){
        int n;  scanf("%d", &n);
        int cnt = 0;
        for(int i=0; i<n; i++) {
            double x1, x2, y1, y2;
            scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
            X[++cnt] = x1;
            line[cnt] = {x1, x2, y1, 1};
            X[++cnt] = x2;
            line[cnt] = {x1, x2, y2, -1};
        }
        sort(X + 1, X + cnt + 1);
        sort(line + 1, line + cnt + 1);
        int m = 1;
        for(int i=2; i<=cnt; i++) if(X[i] != X[i-1]) X[++m] = X[i];
        build(1, m, 1);
        double ans = 1e-8;
        for(int i=1; i<cnt; i++) {
            int l = fun(line[i].l, m, X);
            int r = fun(line[i].r, m, X) - 1;
            if(l <= r) update(l ,r, line[i].ok, 1, m, 1);
            ans += treeSum[1] * (line[i+1].h - line[i].h);
        }
        printf("%.2f\n", ans);
    }
    return 0;
}