HDU 3265/POJ 3832 Posters（扫描线+线段树）（2009 Asia Ningbo Regional）

Description

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.

题目大意：墙上有n张长方形的纸，每张纸都被挖掉了一个长方形（有可能贴着原长方形的边界），给这n个长方形的坐标及被挖掉的长方形的坐标，问这些纸一共覆盖了多少面积。

思路：把每个被挖掉一块的长方形分成4块或以下的真·长方形（怎么分随便你能AC就行），然后就是普通的扫描线+线段树的问题了。至于离散化，点数和数据范围一样大就省了。至于初始化线段树我想应该是不用的，如果代码是对的理论上来讲每做完一组数据，线段树都是空的才对。

代码（HDU 484MS/POJ 532MS）：

 #include <cstdio>
 #include <algorithm>
 #include <cstring>
 #include <iostream>
 using namespace std;
 typedef long long LL;

 const int MAXN = ;

 struct Line {
     int y, x_st, x_ed, flag;
     Line() {}
     Line(int y, int x_st, int x_ed, int flag):
         y(y), x_st(x_st), x_ed(x_ed), flag(flag) {}
     bool operator < (const Line &rhs) const {
         return y > rhs.y;
     }
 };

 Line a[MAXN * ];
 int tree[MAXN * ], sum[MAXN * ];
 LL ans;

 void update(int x, int l, int r, int tl, int tr, int t) {
     int lc = x << , rc = lc ^ ;
     if(tl <= l && r <= tr) {
         tree[x] += t;
         if(tree[x] > ) sum[x] = r - l;
         else if(r - l == ) sum[x] = ;
         else sum[x] = sum[lc] + sum[rc];
     }
     else {
         int mid = (l + r) >> ;
         if(tl < mid) update(lc, l, mid, tl, tr, t);
         if(tr > mid) update(rc, mid, r, tl, tr, t);
         if(tree[x] == ) sum[x] = sum[lc] + sum[rc];
         else sum[x] = r - l;
     }
 }

 void solve(int n) {
     sort(a, a + n);
     ans = ;
     for(int i = ; i < n; ++i) {
         if(i > ) ans += (a[i - ].y - a[i].y) * LL(sum[]);
         update(, , , a[i].x_st, a[i].x_ed, a[i].flag);
     }
 }

 int main() {
     int n, x[], y[];
     while(scanf("%d", &n) != EOF) {
         if(n == ) break;
         int cnt = ;
         for(int i = ; i <= n; ++i) {
             for(int j = ; j <= ; ++j) scanf("%d%d", &x[j], &y[j]);
             if(x[] != x[]) {
                 a[cnt++] = Line(y[], x[], x[], );
                 a[cnt++] = Line(y[], x[], x[], -);
             }
             if(x[] != x[]) {
                 a[cnt++] = Line(y[], x[], x[], );
                 a[cnt++] = Line(y[], x[], x[], -);
             }
             if(y[] != y[]) {
                 a[cnt++] = Line(y[], x[], x[], );
                 a[cnt++] = Line(y[], x[], x[], -);
             }
             if(y[] != y[]) {
                 a[cnt++] = Line(y[], x[], x[], );
                 a[cnt++] = Line(y[], x[], x[], -);
             }
         }
         solve(cnt);
         cout<<ans<<endl;
     }
 }