题意
带删除的询问与当前矩阵相交矩阵个数
题解
增加一个就是加一,删去一个就是减一。
矩阵相交有多种办法,但是要用到数据结构中就需要一种不需要
m
a
x
max
max或者事先排序的方法。
我们可以通过计算不相交的个数,即在上下左右之外的。
然而这样算出来是不够的,左上左下右上右下会重复计算,所以树状数组计算上下左右。
CDQ计算四个角。
最后拿已有的减去即可。
思路比较简单,但是代码很恶心。
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
int ans[maxn],n,q=0,cnt=0,now;
int sum[maxn];
struct node{
int a,b,c,d,t,x,y;
int val,id,op;
}Q[maxn],A[maxn];
int C[400050];
const int limit=400005;
int lowbit(int x){return (x&(-x));}
void change(int x,int d){for(int i=x;i<=limit;i+=lowbit(i)){C[i]+=d;}}
int query(int x){if(x==0)return 0;int ret=0;for(int i=x;i;i-=lowbit(i)){ret+=C[i];}return ret;}
bool cmp1(node lhs,node rhs){return lhs.x<rhs.x;}
bool cmp2(node lhs,node rhs){return lhs.x>rhs.x;}
int check(int x,int y,int op){
if(op)return x>y;
else return x<y;
}
void CDQ(int l,int r,int z,int v){
if(l>=r)return ;
int mid=(l+r)>>1;
CDQ(l,mid,z,v);CDQ(mid+1,r,z,v);
if(z)sort(Q+l,Q+mid+1,cmp2),sort(Q+mid+1,Q+r+1,cmp2);
else sort(Q+l,Q+mid+1,cmp1),sort(Q+mid+1,Q+r+1,cmp1);
int num=l-1,i,j;
// cout<<l<<" "<<mid<<" "<<r<<endl;
// for(int i=l;i<=mid;i++)cout<<Q[i].t<<" "<<Q[i].x<<" "<<Q[i].y<<"**";cout<<endl;
// for(int i=mid+1;i<=r;i++)cout<<Q[i].t<<" "<<Q[i].x<<" "<<Q[i].y<<"**";cout<<endl;
for(i=l,j=mid+1;i<=mid&&j<=r;){
if(check(Q[i].x,Q[j].x,z)){
if(!Q[i].op)change(Q[i].y,Q[i].val);//,cout<<Q[i].y<<"c"<<" ";
i++;
}
else{
if(Q[j].op){
if(v)ans[Q[j].id]-=query(limit)-query(Q[j].y);//,cout<<Q[j].id<<"Q"<<"("<<query(limit)-query(Q[j].y)<<") "<<" "<<ans[Q[j].id]<<"->";
else ans[Q[j].id]-=query(Q[j].y-1);
}
j++;
}
}
// cout<<endl;
while(i<=mid){
if(!Q[i].op)change(Q[i].y,Q[i].val);//,cout<<Q[i].y<<"c"<<" ";
i++;
}
while(j<=r){
if(Q[j].op){
if(v)ans[Q[j].id]-=query(limit)-query(Q[j].y);//,cout<<Q[j].id<<"Q"<<"("<<query(Q[j].y-1)<<") ";
else ans[Q[j].id]-=query(Q[j].y-1);
}
j++;
}
for(int k=l;k<=mid;k++)if(!Q[k].op)change(Q[k].y,-Q[k].val);
}
int main(){
cin>>n;
FOR(i,1,n){
char ch[2];scanf("%s",ch);
if(ch[0]=='I'){
++q;++now;
scanf("%d%d%d%d",&A[q].a,&A[q].b,&A[q].c,&A[q].d);
A[q].val=1,A[q].id=-1,A[q].op=0,A[q].t=i;
Q[i]=A[q];
}
else if(ch[0]=='D'){
--now;
int x;scanf("%d",&x);
Q[i]=A[x];Q[i].val=-1,Q[i].t=i;
}
else{
sum[++cnt]=now;
scanf("%d%d%d%d",&Q[i].a,&Q[i].b,&Q[i].c,&Q[i].d);
Q[i].val=0,Q[i].id=cnt,Q[i].op=1,Q[i].t=i;
}
}
vector<int>G;
FOR(i,1,n){
G.push_back(Q[i].a),G.push_back(Q[i].b);
G.push_back(Q[i].c),G.push_back(Q[i].d);
}
sort(G.begin(),G.end());
G.erase(unique(G.begin(),G.end()),G.end());
FOR(i,1,n){
Q[i].a=lower_bound(G.begin(),G.end(),Q[i].a)-G.begin()+1;
Q[i].b=lower_bound(G.begin(),G.end(),Q[i].b)-G.begin()+1;
Q[i].c=lower_bound(G.begin(),G.end(),Q[i].c)-G.begin()+1;
Q[i].d=lower_bound(G.begin(),G.end(),Q[i].d)-G.begin()+1;
}
//在左边的
FOR(i,1,n){if(Q[i].op)ans[Q[i].id]+=query(Q[i].b-1);else change(Q[i].d,Q[i].val);}
FOR(i,1,n){if(!Q[i].op)change(Q[i].d,-Q[i].val);}
//在下边的
FOR(i,1,n){if(Q[i].op)ans[Q[i].id]+=query(Q[i].a-1);else change(Q[i].c,Q[i].val);}
FOR(i,1,n){if(!Q[i].op)change(Q[i].c,-Q[i].val);}
//在右边的
FOR(i,1,n){if(Q[i].op)ans[Q[i].id]+=query(limit)-query(Q[i].d);else change(Q[i].b,Q[i].val);}
FOR(i,1,n){if(!Q[i].op)change(Q[i].b,-Q[i].val);}
//在上边的
FOR(i,1,n){if(Q[i].op)ans[Q[i].id]+=query(limit)-query(Q[i].c);else change(Q[i].a,Q[i].val);}
FOR(i,1,n){if(!Q[i].op)change(Q[i].a,-Q[i].val);}
//left up(x:<.y:>)
sort(Q+1,Q+1+n,[](node lhs,node rhs)->int{return lhs.t<rhs.t;});
FOR(i,1,n){
if(Q[i].op)Q[i].x=Q[i].b,Q[i].y=Q[i].c;
else Q[i].x=Q[i].d,Q[i].y=Q[i].a;
}
CDQ(1,n,0,1);
//left down(x:<.y:<)
sort(Q+1,Q+1+n,[](node lhs,node rhs)->int{return lhs.t<rhs.t;});
FOR(i,1,n){
if(Q[i].op)Q[i].x=Q[i].b,Q[i].y=Q[i].a;
else Q[i].x=Q[i].d,Q[i].y=Q[i].c;
}
CDQ(1,n,0,0);
//right up(x:>.y:>)
sort(Q+1,Q+1+n,[](node lhs,node rhs)->int{return lhs.t<rhs.t;});
FOR(i,1,n){
if(Q[i].op)Q[i].x=Q[i].d,Q[i].y=Q[i].c;
else Q[i].x=Q[i].b,Q[i].y=Q[i].a;
}
CDQ(1,n,1,1);
//right down(x:>.y:<)
sort(Q+1,Q+1+n,[](node lhs,node rhs)->int{return lhs.t<rhs.t;});
FOR(i,1,n){
if(Q[i].op)Q[i].x=Q[i].d,Q[i].y=Q[i].a;
else Q[i].x=Q[i].b,Q[i].y=Q[i].c;
}
CDQ(1,n,1,0);
FOR(i,1,cnt)printf("%d\n",sum[i]-ans[i]);
}