hdu3265(线段树求矩形面积并)

题目链接：hdu3265

/*hdu 3265 扫描线求面积并
题意：一个矩形的海报中间被挖出一块矩形的空白，将许多个这样的海报贴在
窗户上，问最后窗户被覆盖的面积
思路：将一张海报可分为四个部分，然后用扫描线求矩形面积并即可
需注意的是答案会超int
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define lson l, mid, rt<<1
#define rson mid+1, r, rt<<1|1
#define LL __int64
const int N = 50010;
int x[N<<2];
struct node
{
    int l,r,cov;//表示区间被覆盖次数，
    int len;//代表该区间内被覆盖的线段的长度总和，即求面积时的宽
}s[N<<2];
struct seg
{
    int l, r, h;
    int s;//-1表示上边，1表示下边
    seg(){}
    seg(int a, int b, int c, int d):l(a), r(b), h(c), s(d){}
    bool operator < (const seg &cmp)const{
        if(h == cmp.h) return l < cmp.l;
        return h < cmp.h;//最小值在前
    }
}ss[N];
void pushup(int l, int r, int rt)
{
    if(s[rt].cov >= 1) s[rt].len = x[r+1] - x[l];//表示该区间整个线段长度可以作为底边
    else if(l == r) s[rt].len = 0;//cov[rt]为0，叶子结点被覆盖长度为0
    else s[rt].len = s[rt<<1].len + s[rt<<1|1].len;
}
void build(int l, int r, int rt)
{
    s[rt].l = l;  s[rt].r = r;
    s[rt].cov = 0;
    s[rt].len = 0;
    if(l == r) return;
    int mid = (l+r) >> 1;
    build(lson);
    build(rson);
    pushup(l, r, rt);
}
void update(int l, int r, int c, int rt)
{
    if(l <= s[rt].l && s[rt].r <= r){
        s[rt].cov += c;
        pushup(s[rt].l, s[rt].r, rt);
        return;
    }
    int mid = (s[rt].l+s[rt].r) >> 1;
    if(l <= mid) update(l, r, c, rt<<1);
    if(mid < r) update(l, r, c, rt<<1|1);
    pushup(s[rt].l, s[rt].r, rt);
}
int main()
{
    int n,p = 1;
    while(scanf("%d",&n), n)
    {
        int m = 0, tot = 0;
        while(n--){
            int x1, y1, x2, y2, x3, y3, x4, y4;
            scanf("%d%d%d%d%d%d%d%d",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
            x[tot++] = x1;  x[tot++] = x2;
            x[tot++] = x3;  x[tot++] = x4;
            ss[m++] = seg(x1, x2, y1, 1);  ss[m++] = seg(x1, x2, y3, -1);
            ss[m++] = seg(x1, x2, y4, 1);  ss[m++] = seg(x1, x2, y2, -1);
            ss[m++] = seg(x1, x3, y3, 1);  ss[m++] = seg(x1, x3, y4, -1);
            ss[m++] = seg(x4, x2, y3, 1);  ss[m++] = seg(x4, x2, y4, -1);
        }
        sort(x, x + tot);
        sort(ss, ss + m);
        int k = 1;
        for(int i = 1; i < tot; i ++)//去掉重复的点
            if(x[i] != x[i-1]) x[k++] = x[i];
        build(0, k, 1);
        LL ans = 0;
        for(int i = 0; i < m - 1; i ++){
            int l = lower_bound(x, x+k, ss[i].l) - x;
            int r = lower_bound(x, x+k, ss[i].r) - x - 1;
            if(l <= r) update(l, r, ss[i].s, 1);
            ans += (LL)s[1].len*(ss[i+1].h - ss[i].h);
        }
        printf("%I64d\n",ans);
    }
    return 0;
}