bzoj2850 巧克力王国（K-D tree）

这…kdtree反正能过？？？感觉K-D tree就像在空间中分块暴力一般x 好神呀x

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 50010
inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,D,rt=0;
ll A,B,C,ans=0;
struct point{
    int d[2],w;
    int& operator[](int x){return d[x];}
    friend bool operator<(point a,point b){return a[D]<b[D];}
}P[N];
struct node{
    point x;int lc,rc,mn[2],mx[2];ll sum;
}tree[N];
inline void update(int p){
    int l=tree[p].lc,r=tree[p].rc;
    tree[p].sum+=tree[l].sum+tree[r].sum;
    for(int i=0;i<2;++i){
        if(l){
            tree[p].mn[i]=min(tree[p].mn[i],tree[l].mn[i]);
            tree[p].mx[i]=max(tree[p].mx[i],tree[l].mx[i]);
        }if(r){
            tree[p].mn[i]=min(tree[p].mn[i],tree[r].mn[i]);
            tree[p].mx[i]=max(tree[p].mx[i],tree[r].mx[i]);
        }
    }
}
inline void build(int &p,int l,int r,int op){
    int mid=l+r>>1;p=mid;D=op;
    nth_element(P+l,P+mid,P+r+1);tree[p].x=P[mid];tree[p].sum=P[mid].w;
    for(int i=0;i<2;++i) tree[p].mn[i]=tree[p].mx[i]=tree[p].x[i];
    if(l<mid) build(tree[p].lc,l,mid-1,op^1);
    if(r>mid) build(tree[p].rc,mid+1,r,op^1);
    update(p);
}
inline bool jud(int x,int y){return A*x+B*y<C;}
inline int calc(int p){
    if(!p) return 0;int res=0;
    if(jud(tree[p].mn[0],tree[p].mn[1])) res++;
    if(jud(tree[p].mn[0],tree[p].mx[1])) res++;
    if(jud(tree[p].mx[0],tree[p].mn[1])) res++;
    if(jud(tree[p].mx[0],tree[p].mx[1])) res++;
    return res;
}
inline ll ask(int p){
    if(jud(tree[p].x[0],tree[p].x[1])) ans+=tree[p].x.w;
    int dl=calc(tree[p].lc),dr=calc(tree[p].rc);
    if(dl==4) ans+=tree[tree[p].lc].sum;
    else if(dl) ask(tree[p].lc);
    if(dr==4) ans+=tree[tree[p].rc].sum;
    else if(dr) ask(tree[p].rc);
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    for(int i=1;i<=n;++i) P[i][0]=read(),P[i][1]=read(),P[i].w=read();
    build(rt,1,n,0);
    while(m--){
        A=read();B=read();C=read();ans=0;ask(rt);
        printf("%lld\n",ans);
    }return 0;
}