P5762 [NOI1997] 卫星覆盖

#include <bits/stdc++.h>
#define re register int 
#define il inline
#define ll long long
#define x1 _
#define y1 __
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
using namespace std;
const int inf=1e9;
char buf[1<<23],*p1=buf,*p2=buf,obuf[1<<23],*O=obuf;
il int read(){
	char c=getchar();int z=0,f=1;
	while(c!='-'&&(c>'9'||c<'0')) c=getchar();
	if(c=='-') f=-1,c=getchar();
	while(c>='0'&&c<='9') z=(z<<1)+(z<<3)+c-'0',c=getchar();
	return z*f;
}
int f[2005][2005]; 
struct LINE{
	int x1,y1,x2,y2,mark,z;
}q[250];//x1,y1,x2,y2 维护面坐标，z维护高度 
bool cmp(LINE x,LINE y){
	return x.z<y.z;
}
int n,S,ans;
int main (){
	n=read();
	for(re i=1;i<=n;i++){
		int x=read()+1000,y=read()+1000,z=read()+1000,r=read();
		q[(i<<1)-1]={x-r+1,y-r+1,x+r,y+r,1,z-r};//插入队列 
		q[i<<1]={x-r+1,y-r+1,x+r,y+r,-1,z+r};
	}
	n<<=1;//便于操作 
	sort(q+1,q+1+n,cmp);
	for(re i=1;i<n;i++){//最后一个面不考虑 
		for(re j=q[i].x1;j<=q[i].x2;j++)
			for(re k=q[i].y1;k<=q[i].y2;k++){//无脑暴力修改 
				f[j][k]+=q[i].mark;
				if(q[i].mark==1&&f[j][k]==1) S++;
				if(q[i].mark==-1&&f[j][k]==0) S--;
			}
		ans+=(q[i+1].z-q[i].z)*S;
	}
	cout<<ans;
	return 0;
}