//思路:分别映射到x,y轴,然后分别用一条扫描线对x,y轴扫一遍
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
#define N 10005
struct line2
{
int x1,y1,y2;
int flag;
}q2[N];
struct line1
{
int y1,x1,x2;
int flag;
}q1[N];
struct node
{
int l,r;
int cover;
int len;
}tree1[4*N],tree2[4*N];
int x[N];
int y[N];
bool cmp1(line1 a,line1 b)
{
return a.y1<b.y1;
}
bool cmp2(line2 a,line2 b)
{
return a.x1<b.x1;
}
void buildx(int s,int l,int r)
{
tree1[s].l=l;
tree1[s].r=r;
tree1[s].len=0;
tree1[s].cover=0;
if(l+1==r)
return ;
int mid=(l+r)>>1;
buildx(s<<1,l,mid);
buildx(s<<1|1,mid,r);
}
void buildy(int s,int l,int r)
{
tree2[s].l=l;
tree2[s].r=r;
tree2[s].len=0;
tree2[s].cover=0;
if(l+1==r)
return ;
int mid=(l+r)>>1;
buildy(s<<1,l,mid);
buildy(s<<1|1,mid,r);
}
void updatax(int s,int l,int r,int size)
{
if(l<=tree1[s].l&&tree1[s].r<=r)
{
tree1[s].cover+=size;
}
else
{
int mid=(tree1[s].l+tree1[s].r)>>1;
if(l<mid)
{
updatax(s<<1,l,r,size);
}
if(r>mid)
{
updatax(s<<1|1,l,r,size);
}
}
if(tree1[s].cover>0)//说明次线段已有被覆盖
{
tree1[s].len=x[tree1[s].r]-x[tree1[s].l];
}
else
{
tree1[s].len=tree1[s<<1].len+tree1[s<<1|1].len;
}
}
void updatay(int s,int l,int r,int size)
{
if(l<=tree2[s].l&&tree2[s].r<=r)
{
tree2[s].cover+=size;
}
else
{
int mid=(tree2[s].l+tree2[s].r)>>1;
if(l<mid)
{
updatay(s<<1,l,r,size);
}
if(r>mid)
{
updatay(s<<1|1,l,r,size);
}
}
if(tree2[s].cover>0)
{
tree2[s].len=y[tree2[s].r]-y[tree2[s].l];
}
else
if(tree2[s].l+1==tree2[s].r)
{
tree2[s].len=0;
}
else
{
tree2[s].len=tree2[s<<1].len+tree2[s<<1|1].len;
}
}
int findx(int y,int high)
{
int low=0;
while(low<=high)
{
int mid=(low+high)>>1;
if(x[mid]==y)
return mid;
else
if(x[mid]>y)
{
high=mid-1;
}
else
low=mid+1;
}
return -1;
}
int findy(int x,int high)
{
int low=0;
while(low<=high)
{
int mid=(low+high)>>1;
if(y[mid]==x)
return mid;
else
if(y[mid]>x)
{
high=mid-1;
}
else
low=mid+1;
}
return -1;
}
int main()
{
int n,x1,y1,x2,y2,num,kx,ky,i;
while(scanf("%d",&n)!=EOF)
{
num=0;
while(n--)
{
scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
q1[num].y1=y1;
q1[num].x1=x1;
q1[num].x2=x2;
q1[num].flag=1;
x[num]=x1;
q2[num].x1=x1;
q2[num].y1=y1;
q2[num].y2=y2;
q2[num].flag=1;
y[num]=y1;
num++;
q1[num].y1=y2;
q1[num].x1=x1;
q1[num].x2=x2;
q1[num].flag=-1;
x[num]=x2;
q2[num].x1=x2;
q2[num].y1=y1;
q2[num].y2=y2;
q2[num].flag=-1;
y[num]=y2;
num++;
}
sort(x,x+num);
sort(y,y+num);
sort(q1,q1+num,cmp1);
sort(q2,q2+num,cmp2);
kx=1;
ky=1;
for(i=1;i<num;i++)
if(x[i]!=x[i-1])
x[kx++]=x[i];
for(i=1;i<num;i++)
if(y[i]!=y[i-1])
y[ky++]=y[i];
buildx(1,0,kx-1);
buildy(1,0,ky-1);
int l,r;
int prex=0;
int prey=0;
int ans=0;
for(i=0;i<num-1;i++)
{
l=findx(q1[i].x1,kx-1);
r=findx(q1[i].x2,kx-1);
updatax(1,l,r,q1[i].flag);
ans+=abs(tree1[1].len-prex);//减去原先的长度,得到增加了多少的长度
prex=tree1[1].len;
l=findy(q2[i].y1,ky-1);
r=findy(q2[i].y2,ky-1);
updatay(1,l,r,q2[i].flag);
ans+=abs(tree2[1].len-prey);
prey=tree2[1].len;
}
ans+=q1[num-1].x2-q1[num-1].x1;//特殊处理x轴最后的线段
ans+=q2[num-1].y2-q2[num-1].y1;//特殊处理y轴最后的线段
printf("%d\n",ans);
}
return 0;
}
hdu 1828 Picture
最新推荐文章于 2019-07-09 15:04:20 发布