POJ1255-覆盖的面积（线段树+扫描线）

Problem Description 

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

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

Output

7.63
0.00

Code ：

#include<bits/stdc++.h>
#include<iostream>
#include<queue>
#include<cstring>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<map>
#include<stack>
#include<vector>
#define rep(i,e) for(int i=0;i<(e);++i)
#define rep1(i,e) for(int i=1;i<=(e);++i)
#define repx(i,x,e) for(int i=(x);i<=(e);++i)
#define pii pair<int,int>
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define mset(var,val) memset(var,val,sizeof(var))
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define IOS ios::sync_with_stdio(false);cin.tie(0)

using namespace std;

#ifdef LOCAL
template<typename T>
void dbg(T t){
    cout<<t<<" "<<endl;
}
template<typename T, typename... Args>
void dbg(T t, Args... args){
    cout<<t<<" ";dbg(args...);
}


#else
#define dbg(...)
#endif // local
typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int mod = 1e9+7;
const int N = 500+10;
typedef long long ll;
#define K 137
const int maxn = 1e3+10;
const int maxm =4e5+10;

struct Node{
    double len[3];
    double v;
}st[maxn*4];

struct Edge{
    double l,r;
    double x;
    double dis;
    double isIn;
    Edge(){}
    Edge(double l,double r,double dis,double x,double isIn):
        l(l),r(r),dis(dis),x(x),isIn(isIn){}
}edge[maxn*2];

double ls[maxn*2];

bool cmp(Edge a,Edge b)
{
    if(a.x != b.x)
        return a.x < b.x;
    else return a.isIn < b.isIn;
}

void build(int rt,int l,int r)
{
    st[rt].len[1] = st[rt].len[2] = st[rt].v = 0;
    if(l == r)
        return;
    int m = (l+r) >> 1;
    build(rt<<1,l,m);
    build(rt<<1|1,m+1,r);
}

void pushup1(int rt,int l,int r)
{
    if(st[rt].v > 0)    //右端点+1-左端点，这样在计算叶子结点才不会都是0
        st[rt].len[1] = ls[r+1] - ls[l];
    else if(l == r) //该结点是叶子结点，没有左右孩子，又不被全覆盖，肯定为0
        st[rt].len[1] = 0;
    else
        st[rt].len[1] = st[rt<<1].len[1] + st[rt<<1|1].len[1];
}

void pushup2(int rt,int l,int r)
{
    if(st[rt].v > 1)
        st[rt].len[2] = ls[r+1] - ls[l];
    else if(l == r)
        st[rt].len[2] = 0;
    else if(st[rt].v == 1)
        st[rt].len[2] = st[rt<<1].len[1] + st[rt<<1|1].len[1];
    else st[rt].len[2] = st[rt<<1].len[2] + st[rt<<1|1].len[2];

}

void update(int rt,int l,int r,int ql,int qr,int v)
{
    if(ql <= l && r <= qr)
    {
        st[rt].v += v;
        pushup1(rt,l,r);
        pushup2(rt,l,r);
    }
    else
    {
        int m = (l+r) >> 1;
        if(ql <= m)
            update(rt<<1,l,m,ql,qr,v);
        if(qr > m)
            update(rt<<1|1,m+1,r,ql,qr,v);
        pushup1(rt,l,r);
        pushup2(rt,l,r);
    }
}

void work()
{
    int t,n;
    int ec,pc;
    double x1,x2,y1,y2;
    scanf("%d",&t);
    while(~scanf("%d",&n))
    {
        ec = pc = 0;
        for(int i = 0; i < n; i++)
        {
            scanf("%lf%lf%lf%lf",&x1,&y1,&x2,&y2);
            edge[ec++] = {y1,y2,y2-y1,x1,1};
            edge[ec++] = {y1,y2,y2-y1,x2,-1};
            ls[pc++] = y1;
            ls[pc++] = y2;
        }
        sort(ls,ls+pc);
        sort(edge,edge+ec,cmp);
        int ans = unique(ls,ls+pc) - ls;
        ans--;
        build(1,0,ans);
        double res = 0;
        int l = lower_bound(ls,ls+ans,edge[0].l)-ls;
        int r = lower_bound(ls,ls+ans,edge[0].r)-ls-1;
        update(1,0,ans,l,r,edge[0].isIn);
        for(int i = 1; i < ec; i++)
        {
            res += (st[1].len[2] * (edge[i].x - edge[i-1].x));
            l = lower_bound(ls,ls+ans,edge[i].l)-ls;
            r = lower_bound(ls,ls+ans,edge[i].r)-ls-1;
            update(1,0,ans,l,r,edge[i].isIn);
        }
        printf("%.2lf\n",res);
    }
}

int main()
{
#ifdef LOCAL
    freopen("in.txt","r",stdin);
#endif
    work();
    return 0;
}