Codeforces 846D Monitor 二分 and 二维树状数组

问图上什么时候存在一个边长大于等于k的正方形

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#define ll long long
using namespace std;
const int maxn =505;
int rd() {int t;scanf("%d",&t);return t;}
#define en '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define pb push_back
int n,m,k,q;
struct node{
    int x,y,t;
}p[maxn*maxn];
int c[maxn][maxn];
bool cmp(node a,node b){
return a.t<b.t;
}
#define lowbit(x) (x&(-x))
void add(int x,int y){
    if(x==0 or y==0)return ;
    for(int i=x;i<=n;i+=lowbit(i)){
        for(int j=y;j<=m;j+=lowbit(j)){
            c[i][j]+=1;
        }
    }
}
int ask(int x,int y){
    int res=0;
    for(int i=x;i>0;i-=lowbit(i)){
        for(int j=y;j>0;j-=lowbit(j)){
            res+=c[i][j];
        }
    }return res;
}
bool ok(int x){
    mem(c,0);
    for(int i=1;i<=q;i++){
        if(p[i].t>x)break;
        add(p[i].x,p[i].y);
    }
    for(int i=1+k-1;i<=n;i++){
        for(int j=1+k-1;j<=m;j++){
            int tem=ask(i,j)-ask(i-k,j)-ask(i,j-k)+ask(i-k,j-k);
            //cout<<i<<' '<<j<<' '<<tem<<en;
            if(tem==k*k){
                return 1;
            }
        }
    }
    return 0;
}
signed main() {
    #ifdef swt
    freopen("input2.txt","r",stdin);
    #endif // local
    #define int register int
    cin>>n>>m>>k>>q;
    int mx=0;
    for(int i=1;i<=q;i++){
        p[i].x=rd(),p[i].y=rd(),p[i].t=rd();
        mx=max(mx,p[i].t);
        add(p[i].x,p[i].y);
    }
    sort(p+1,p+1+q,cmp);
    int l=0,r=mx;
    while(l<r){
        int mid=(l+r)>>1;
        if(ok(mid)){
            r=mid;
        }else l=mid+1;
    }
    if(ok(l)){
        cout<<l<<en;
    }else{
        cout<<-1<<en;
    }
        return 0;
}