bzoj2626 JZPFAR（求K远点）

类似bzoj3053，求第K远点。打打板子，找找手感。
学习了一下priority_queue如果想自定义小根堆，要重载大于号。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
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,rt,D;
struct point{
    int d[2],id;
    int& operator[](int x){return d[x];}
    friend bool operator<(point a,point b){return a[D]<b[D];}
}P[N],T;
inline ll sqr(int x){return (ll)x*x;}
inline ll dis(point a,point b){return sqr(a[0]-b[0])+sqr(a[1]-b[1]);}
struct node{
    point x;int mx[2],mn[2],lc,rc;
}tr[N];
struct Data{
    ll dis;int id;
    Data(){};
    Data(ll x,int y){dis=x;id=y;}
    friend bool operator>(Data a,Data b){return a.dis==b.dis?a.id<b.id:a.dis>b.dis;}
};
priority_queue<Data,vector<Data>,greater<Data> >q;
inline void pushup(int p){
    int l=tr[p].lc,r=tr[p].rc;
    for(int i=0;i<2;++i)
        tr[p].mx[i]=max(tr[p].mx[i],max(tr[l].mx[i],tr[r].mx[i])),
        tr[p].mn[i]=min(tr[p].mn[i],min(tr[l].mn[i],tr[r].mn[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);tr[p].x=P[mid];
    for(int i=0;i<2;++i) tr[p].mx[i]=tr[p].mn[i]=tr[p].x[i];
    if(l<mid) build(tr[p].lc,l,mid-1,op^1);
    if(r>mid) build(tr[p].rc,mid+1,r,op^1);
    pushup(p);
}
inline ll calc(int p){
    if(!p) return 0;ll res=0;
    for(int i=0;i<2;++i) res+=max(sqr(tr[p].mx[i]-T[i]),sqr(tr[p].mn[i]-T[i]));
    return res;
}
inline void ask(int p){
    if(!p) return;
    ll tmp=dis(tr[p].x,T);
    if(tmp>q.top().dis||tmp==q.top().dis&&tr[p].x.id<q.top().id)
        q.pop(),q.push(Data(tmp,tr[p].x.id));
    ll dl=calc(tr[p].lc),dr=calc(tr[p].rc);
    if(dl>dr){
        if(dl>=q.top().dis) ask(tr[p].lc);
        if(dr>=q.top().dis) ask(tr[p].rc);
    }else{
        if(dr>=q.top().dis) ask(tr[p].rc);
        if(dl>=q.top().dis) ask(tr[p].lc);
    }
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();for(int i=0;i<2;++i) tr[0].mn[i]=inf,tr[0].mx[i]=-inf;
    for(int i=1;i<=n;++i) P[i][0]=read(),P[i][1]=read(),P[i].id=i;
    build(rt,1,n,0);m=read();
    while(m--){
        T[0]=read();T[1]=read();int k=read();
        for(int i=1;i<=k;++i) q.push(Data(0,inf));
        ask(rt);printf("%d\n",q.top().id);
        for(int i=1;i<=k;++i) q.pop();
    }return 0;
}