[USACO5.5]矩形周长Picture
横线和竖线分两遍分别求
用扫描线扫一遍,扫到一个地方先加边,再删边,这样每次操作对答案的贡献就是整个线段树覆盖区域长度前后的差值(绝对值),这样可以省去query函数
这样题目就转化成了一个维护线段树,支持区间加,维护区间不为0的数的数量
tree[root].len表示区间覆盖的长度,tree[root].col表示区间被完全覆盖的次数
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN (100010)
#define mid ((l+r)>>1)
#define ls ((root<<1)+1)
#define rs ((root<<1)+2)
#define fr(i,s,t) for (i=s;i<=t;i++)
using namespace std;
int N,n,size,ans;
bool flag;
struct edge{
int pos,l,r,val;
}a[MAXN<<1];
bool cmp(edge a,edge b){
if (a.pos!=b.pos)
return a.pos<b.pos;
return a.val>b.val;
}
struct Node{
int len,col;
}tree[MAXN<<2];
struct rec{
int x1,x2,y1,y2;
void read(){
scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
x1+=10001; x2+=10001; y1+=10001; y2+=10001;
N=max(max(x2,y2),N);
}
void A(){
a[++size]=(edge){x1,y1,y2-1,1};
a[++size]=(edge){x2,y1,y2-1,-1};
}
void B(){
a[++size]=(edge){y1,x1,x2-1,1};
a[++size]=(edge){y2,x1,x2-1,-1};
}
}q[MAXN];
void update(int root,int l,int r){
if (tree[root].col) tree[root].len=r-l+1;
else if (l==r) tree[root].len=0;
else tree[root].len=tree[ls].len+tree[rs].len;
}
void insert(int root,int l,int r,int l1,int r1,int val){
if (l>=l1&&r<=r1){
tree[root].col+=val;
update(root,l,r);
return;
}
if (l1<=mid) insert(ls,l,mid,l1,r1,val);
if (r1>mid) insert(rs,mid+1,r,l1,r1,val);
update(root,l,r);
}
void work(){
int i,pre;
memset(tree,0,sizeof(tree));
fr(i,1,2*n){
pre=tree[0].len;
insert(0,1,N,a[i].l,a[i].r,a[i].val);
ans+=abs(pre-tree[0].len);
}
}
int main(){
int i;
// freopen("picture.in","r",stdin);
// freopen("picture.out","w",stdout);
scanf("%d",&n);
fr(i,1,n)
q[i].read();
fr(i,1,n) q[i].A();
sort(a+1,a+2*n+1,cmp); work();
size=0;
fr(i,1,n) q[i].B();
sort(a+1,a+2*n+1,cmp); work();
cout<<ans;
}