思路很简单,主要是向上更新比较麻烦。
ACcode:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef __int64 LL;
const int nsize=111111;
struct Line
{
int lx,rx,y,f;
Line() {}
Line(int a,int b,int c,int d):lx(a),rx(b),y(c),f(d) {}
bool operator < (const Line &cmp) const{
return y<cmp.y;
}
} line[nsize<<1];
int cov[nsize<<3][4],len[nsize<<3][8],X[nsize<<1];
void build(int rt,int l,int r)
{
len[rt][0]=X[r+1]-X[l];
for (int i=1; i<=7; i++) len[rt][i]=0;
cov[rt][1]=cov[rt][2]=cov[rt][3]=0;
if (l==r) return ;
int m=(l+r)>>1;
build(rt<<1,l,m);
build(rt<<1|1,m+1,r);
}
void PushUp(int rt,int l,int r)
{
int i,k=0,t1=rt<<1,t2=t1|1;
for (i=0; i<=7; i++) len[rt][i]=0;
for (i=1; i<=3; i++) if (cov[rt][i]) k=k|(1<<(i-1));
if (l==r) len[rt][k]=X[r+1]-X[l];
else
for (i=0; i<=7; i++)
len[rt][k|i]+=len[t1][i]+len[t2][i];
}
void update(int rt,int l,int r,int L,int R,int v)
{
if (L<=l&&r<=R)
{
if (v>0) cov[rt][v]++;
else cov[rt][-v]--;
PushUp(rt,l,r);
return ;
}
int m=(l+r)>>1;
if (L<=m) update(rt<<1,l,m,L,R,v);
if (R>m) update(rt<<1|1,m+1,r,L,R,v);
PushUp(rt,l,r);
}
int Fin(int key,int k)
{
int l=0,r=k;
while (l<=r)
{
int m=(l+r)>>1;
if (X[m]==key) return m;
else if (X[m]<key) l=m+1;
else r=m-1;
}
return -1;
}
int judge(char c)
{
if (c=='R') return 1;
if (c=='G') return 2;
if (c=='B') return 3;
}
int main()
{
LL ans[10];
char str[5];
int T,cas=0;
int n,m,i,j,k,L,R,top;
int x1,x2,y1,y2,v;
scanf("%d",&T);
while (T--)
{
scanf("%d",&n);
memset(ans,0,sizeof(ans));
for (top=m=i=0; i<n; i++)
{
scanf("%s%d%d%d%d",str,&x1,&y1,&x2,&y2);
v=judge(str[0]);
X[top++]=x1; X[top++]=x2;
line[m++]=Line(x1,x2,y1,v);
line[m++]=Line(x1,x2,y2,-v);
}
sort(X,X+top);
top=unique(X,X+top)-X-1;
build(1,0,top-1);
sort(line,line+m);
for (i=0; i<m-1; i++)
{
L=Fin(line[i].lx,top);
R=Fin(line[i].rx,top)-1;
if (L<=R) update(1,0,top-1,L,R,line[i].f);
for (j=1; j<=7; j++)
ans[j]+=1LL*len[1][j]*(line[i+1].y-line[i].y);
}
swap(ans[3],ans[4]);
printf("Case %d:\n",++cas);
for (i=1; i<=7; i++)
printf("%I64d\n",ans[i]);
}
return 0;
}