HDU 3265 Posters

Posters

Time Limit: 2000ms

Memory Limit: 32768KB

This problem will be judged on HDU. Original ID: 3265
64-bit integer IO format: %I64d      Java class name: Main

 

Ted has a new house with a huge window. In this big summer, Ted decides to decorate the window with some posters to prevent the glare outside. All things that Ted can find are rectangle posters. 

However, Ted is such a picky guy that in every poster he finds something ugly. So before he pastes a poster on the window, he cuts a rectangular hole on that poster to remove the ugly part. Ted is also a careless guy so that some of the pasted posters may overlap when he pastes them on the window. 

Ted wants to know the total area of the window covered by posters. Now it is your job to figure it out.

To make your job easier, we assume that the window is a rectangle located in a rectangular coordinate system. The window’s bottom-left corner is at position (0, 0) and top-right corner is at position (50000, 50000). The edges of the window, the edges of the posters and the edges of the holes on the posters are all parallel with the coordinate axes. 

 

Input

The input contains several test cases. For each test case, the first line contains a single integer N (0<N<=50000), representing the total number of posters. Each of the following N lines contains 8 integers x1, y1, x2, y2, x3, y3, x4, y4, showing details about one poster. (x1, y1) is the coordinates of the poster’s bottom-left corner, and (x2, y2) is the coordinates of the poster’s top-right corner. (x3, y3) is the coordinates of the hole’s bottom-left corner, while (x4, y4) is the coordinates of the hole’s top-right corner. It is guaranteed that 0<=xi, yi<=50000(i=1…4) and x1<=x3<x4<=x2, y1<=y3<y4<=y2.

The input ends with a line of single zero.

 

Output

For each test case, output a single line with the total area of window covered by posters.

 

Sample Input

2
0 0 10 10 1 1 9 9
2 2 8 8 3 3 7 7
0

Sample Output

56

Source

2009 Asia Ningbo Regional Contest Hosted by NIT

 

解题:线段树扫描线求矩形面积的并，注意溢出，注意矩形分割。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <climits>
#include <vector>
#include <queue>
#include <cstdlib>
#include <string>
#include <set>
#include <stack>
#define LL long long
#define pii pair<int,int>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 100000;
struct node{
    int lt,rt,cnt,len;
};
struct Line{
    int lx,rx,h,delta;
    Line(int x = 0,int y = 0,int z = 0,int d = 0){
        lx = x;
        rx = y;
        h = z;
        delta = d;
    }
    bool operator<(const Line &b) const{
        return h < b.h;
    }
};
node tree[maxn<<2];
Line line[maxn<<2];
int tot;
void build(int lt,int rt,int v){
    tree[v].lt = lt;
    tree[v].rt = rt;
    tree[v].cnt = tree[v].len = 0;
    if(lt + 1 == rt) return;
    int mid = (lt + rt)>>1;
    build(lt,mid,v<<1);
    build(mid,rt,v<<1|1);
}
void pushup(int v){
    if(tree[v].cnt) tree[v].len = tree[v].rt - tree[v].lt;
    else if(tree[v].lt + 1 == tree[v].rt) tree[v].len = 0;
    else tree[v].len = tree[v<<1].len + tree[v<<1|1].len;
}
void update(int lt,int rt,int v,int delta){
    if(tree[v].lt >= lt && tree[v].rt <= rt){
        tree[v].cnt += delta;
        pushup(v);
        return;
    }
    if(lt < tree[v<<1].rt) update(lt,rt,v<<1,delta);
    if(rt > tree[v<<1|1].lt) update(lt,rt,v<<1|1,delta);
    pushup(v);
}
int main() {
    int n,x1,y1,x2,y2,x3,y3,x4,y4;
    while(scanf("%d",&n),n){
        build(0,50010,1);
        for(int i = tot = 0; i < n; ++i){
            scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
            scanf("%d %d %d %d",&x3,&y3,&x4,&y4);
            line[tot++] = Line(x1,x4,y4,1);
            line[tot++] = Line(x1,x4,y2,-1);
            line[tot++] = Line(x4,x2,y3,1);
            line[tot++] = Line(x4,x2,y2,-1);
            line[tot++] = Line(x3,x2,y1,1);
            line[tot++] = Line(x3,x2,y3,-1);
            line[tot++] = Line(x1,x3,y1,1);
            line[tot++] = Line(x1,x3,y4,-1);
        }
        sort(line,line+tot);
        LL sum = 0;
        for(int i = 0; i+1 < tot; ++i){
            update(line[i].lx,line[i].rx,1,line[i].delta);
            sum += (LL)tree[1].len*(line[i+1].h - line[i].h);//这个地方有点坑啊。。注意溢出。。
        }
        cout<<sum<<endl;
    }
    return 0;
}