HDU 3265 Posters

矩形面积并。给出一些矩形，这些矩形有的被挖了一个矩形，求最后的面积。

可以把每个矩形框拆为四个矩形（也许不够四个，需要判断一下，我一开始没判断，就MLE了），怎么拆都行，就算有重叠也不在乎。中间会超int，其他就是模板了。

#pragma comment(linker, "/STACK:1024000000,1024000000")#include<algorithm>#include<iostream>#include<cstring>#include<cstdio>#include<vector>#include<string>#include<queue>#include<cmath>#include<map>///LOOP#define REP(i, n) for(int i = 0; i < n; i++)#define FF(i, a, b) for(int i = a; i < b; i++)#define FFF(i, a, b) for(int i = a; i <= b; i++)#define FD(i, a, b) for(int i = a - 1; i >= b; i--)#define FDD(i, a, b) for(int i = a; i >= b; i--)///INPUT#define RI(n) scanf("%d", &n)#define RII(n, m) scanf("%d%d", &n, &m)#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)#define RFI(n) scanf("%lf", &n)#define RFII(n, m) scanf("%lf%lf", &n, &m)#define RFIII(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)#define RFIV(n, m, k, p) scanf("%lf%lf%lf%lf", &n, &m, &k, &p)#define RS(s) scanf("%s", s)///OUTPUT#define PN printf("\n")#define PI(n) printf("%d\n", n)#define PIS(n) printf("%d ", n)#define PS(s) printf("%s\n", s)#define PSS(s) printf("%s ", s)#define PC(n) printf("Case %d: ", n)///OTHER#define PB(x) push_back(x)#define CLR(a, b) memset(a, b, sizeof(a))#define CPY(a, b) memcpy(a, b, sizeof(b))#define display(A, n, m) {REP(i, n){REP(j, m)PIS(A[i][j]);PN;}}#define lson l, m, rt << 1#define rson m + 1, r, rt << 1 | 1using namespace std;typedef long long LL;typedef pair<int, int> P;const int MOD = 1e9+7;const int INFI = 1e9 * 2;const LL LINFI = 1e17;const double eps = 1e-6;const double pi = acos(-1.0);const int N = 55555;const int M = N << 2;const int move[8][2] = {0, 1, 0, -1, 1, 0, -1, 0, 1, 1, 1, -1, -1, 1, -1, -1};struct node{    LL x1, x2, y;    int k;    node(){};    node(LL a, LL b, LL c, int d){x1 = a, x2 = b, y = c, k = d;};    bool operator < (const node a) const    {        return y < a.y;    }}seg[N << 3];int cnt[M];LL sum[M], X[N << 3];void pushup(int l, int r, int rt){    if(cnt[rt])sum[rt] = X[r + 1] - X[l];    else if(l == r)sum[rt] = 0;    else sum[rt] = sum[rt << 1] + sum[rt << 1 | 1];}void update(int L, int R, int c, int l, int r, int rt){    if(L <= l && r <= R)    {        cnt[rt] += c;        pushup(l, r, rt);        return;    }    int m = (l + r) >> 1;    if(L <= m)update(L, R, c, lson);    if(R > m)update(L, R, c, rson);    pushup(l, r, rt);}int bin(LL x, int n){    int l = 0, r = n - 1, m;    while(l <= r)    {        m = (l + r) >> 1;        if(X[m] == x)return m;        else if(X[m] > x)r = m - 1;        else l = m + 1;    }}int main(){    //freopen("input.txt", "r", stdin);    int n, m, k, l, r;    LL ans, x[4], y[4];    while(RI(n), n)    {        CLR(sum, 0);        CLR(cnt, 0);        m = k = ans = 0;        REP(i, n)        {            REP(j, 4)scanf("%I64d%I64d", &x[j], &y[j]);            X[m++] = x[0];            if(x[0] != x[2])            {                X[m++] = x[2];                seg[k++] = node(x[0], x[2], y[0], 1);                seg[k++] = node(x[0], x[2], y[1], -1);            }            X[m++] = x[1];            if(x[1] != x[3])            {                X[m++] = x[3];                seg[k++] = node(x[3], x[1], y[0], 1);                seg[k++] = node(x[3], x[1], y[1], -1);            }            seg[k++] = node(x[0], x[1], y[0], 1);            seg[k++] = node(x[0], x[1], y[2], -1);            seg[k++] = node(x[0], x[1], y[3], 1);            seg[k++] = node(x[0], x[1], y[1], -1);        }        sort(X, X + m);        sort(seg, seg + k);        m = unique(X, X + m) - X;        REP(i, k - 1)        {            l = bin(seg[i].x1, m);            r = bin(seg[i].x2, m) - 1;            update(l, r, seg[i].k, 0, m - 1, 1);            ans += sum[1] * (seg[i + 1].y - seg[i].y);        }        printf("%I64d\n", ans);    }    return 0;}