【HDU】3642 Get The Treasury

#include<cstdio>
#include<cstring>
#include<algorithm>
typedef __int64 LL;
using namespace std;
#define MAXN 1010
struct Point
{
    int x,y,z;
    void Input()
    {
        scanf("%d%d%d",&x,&y,&z);
    }
};
struct Rectangle
{
    Point a,b;
};
struct Seg
{
    int left,right,high,flag;
    friend bool operator<(Seg a,Seg b)
    {
        if(a.high==b.high)
            return a.flag<b.flag;
        return a.high<b.high;
    }
};
struct node
{
    int cover,one,two,more;
};
node tree[MAXN<<3];
Rectangle r[MAXN];
Seg s[MAXN<<1];
int X[MAXN<<1];
int Z[MAXN<<1];
inline void PushUp(int L,int R,int rt)
{
    if(tree[rt].cover>2)
        tree[rt].more=tree[rt].two=tree[rt].one=X[R+1]-X[L];
    else if(tree[rt].cover==2)
    {
        tree[rt].one=tree[rt].two=X[R+1]-X[L];
        if(L==R)
            tree[rt].more=0;
        else
            tree[rt].more=tree[rt<<1].one+tree[rt<<1|1].one;
    }
    else if(tree[rt].cover==1)
    {
        tree[rt].one=X[R+1]-X[L];
        if(L==R)
            tree[rt].two=tree[rt].more=0;
        else
        {
            tree[rt].two=tree[rt<<1].one+tree[rt<<1|1].one;
            tree[rt].more=tree[rt<<1].two+tree[rt<<1|1].two;
        }
    }
    else
    {
        if(L==R)
            tree[rt].more=tree[rt].two=tree[rt].one=0;
        else
        {
            tree[rt].more=tree[rt<<1].more+tree[rt<<1|1].more;
            tree[rt].one=tree[rt<<1].one+tree[rt<<1|1].one;
            tree[rt].two=tree[rt<<1].two+tree[rt<<1|1].two;
        }
    }
}
void Update(int x,int y,int flag,int L,int R,int rt)
{
    if(x<=L&&R<=y)
    {
        tree[rt].cover+=flag;
        PushUp(L,R,rt);
    }
    else
    {
        int mid=(L+R)>>1;
        if(x<=mid)
            Update(x,y,flag,L,mid,rt<<1);
        if(y>mid)
            Update(x,y,flag,mid+1,R,rt<<1|1);
        PushUp(L,R,rt);
    }
}
int main()
{
    LL ans,temp;
    int t,n,i,j,nx,nz,cnt,x,y,ca=1;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(nx=nz=i=0;i<n;i++)
        {
            r[i].a.Input();
            r[i].b.Input();
            X[nx++]=r[i].a.x;
            X[nx++]=r[i].b.x;
            Z[nz++]=r[i].a.z;
            Z[nz++]=r[i].b.z;
        }
        sort(X,X+nx);
        sort(Z,Z+nz);
        nx=unique(X,X+nx)-X;
        nz=unique(Z,Z+nz)-Z;
        ans=0;
        memset(tree,0,sizeof(tree));
        for(i=1;i<nz;i++)
        {
            for(cnt=j=0;j<n;j++)
            {
                if(r[j].a.z<=Z[i-1]&&Z[i]<=r[j].b.z)
                {
                    s[cnt].left=r[j].a.x;
                    s[cnt].right=r[j].b.x;
                    s[cnt].high=r[j].a.y;
                    s[cnt++].flag=1;
                    s[cnt].left=r[j].a.x;
                    s[cnt].right=r[j].b.x;
                    s[cnt].high=r[j].b.y;
                    s[cnt++].flag=-1;
                }
            }
            sort(s,s+cnt);
            for(temp=j=0;j<cnt;j++)
            {
                x=lower_bound(X,X+nx,s[j].left)-X;
                y=lower_bound(X,X+nx,s[j].right)-X;
                Update(x,y-1,s[j].flag,0,nx-2,1);
                if(j+1<cnt)
                    temp+=(LL)(s[j+1].high-s[j].high)*tree[1].more;
            }
            ans+=temp*(Z[i]-Z[i-1]);
        }
        printf("Case %d: %I64d\n",ca++,ans);
    }
    return 0;
}