HDU 5480 树状数组

#include<bits/stdc++.h>
#define maxn 100100
using namespace std;
int row[maxn],col[maxn],K,n,m,Q,x1,x2,yy1,y2;
bool vis[maxn][3];
inline int lowbit(int x){ return (x&-x);}
inline void update(int x){
    while(x<=n){
        row[x]++;
        x+=lowbit(x);
    }
}
inline void Update(int y){
    while(y<=m){
        col[y]++;
        y+=lowbit(y);
    }
}
inline int getsum(int x){
    int res=0;
    while(x>0){
        res+=row[x];
        x-=lowbit(x);
    }
    return res;
}
inline int Getsum(int y){
    int res=0;
    while(y>0){
        res+=col[y];
        y-=lowbit(y);
    }
    return res;
}
int main(){
    int T;
    cin>>T;
    while(T--){
        memset(row,0,sizeof(row));
        memset(col,0,sizeof(col));
        memset(vis,false,sizeof(vis)); 
        cin>>n>>m>>K>>Q;
        for(int i=1;i<=K;i++){
            scanf("%d%d",&x1,&yy1);
            if(!vis[x1][1]){ 
                update(x1);
                vis[x1][1]=true;
            }
            if(!vis[yy1][2]){
                vis[yy1][2]=true;
                Update(yy1);
            }
        }
        for(int i=1;i<=Q;i++){
            scanf("%d%d%d%d",&x1,&yy1,&x2,&y2);
            if((getsum(x2)-getsum(x1-1)==x2-x1+1)||(Getsum(y2)-Getsum(yy1-1)==y2-yy1+1)) printf("Yes\n");
            else printf("No\n");
        }
    }
    return 0;
}