K-th Closest Distance

http://acm.hdu.edu.cn/showproblem.php?pid=6621 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
//#define pii pair<int,int>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e6+9;
const int maxm=1e6;
const int mod=1e9+7;

int a[maxn];
int n,m;

struct node
{
    int ls,rs,sum;
}tree[maxn*30];

int rt[maxn],tot;

void init()
{
    tot=0;
    rt[0]=0;
}

void build(int &now,int l,int r)
{
    now=++tot;
    tree[now].sum=0;
    if(l==r) return ;
    int mid=(l+r)>>1;
    build(tree[now].ls,l,mid);
    build(tree[now].rs,mid+1,r);
}

void update(int &now,int old,int l,int r,int pos,int x)
{
    now=++tot;
    tree[now]=tree[old];
    tree[now].sum+=x;
    if(l==r) return ;
    int mid=(l+r)>>1;
    if(pos<=mid) update(tree[now].ls,tree[old].ls,l,mid,pos,x);
    else update(tree[now].rs,tree[old].rs,mid+1,r,pos,x);
}

int query(int now,int old,int l,int r,int ql,int qr)
{
    if(l>=ql&&r<=qr) return tree[now].sum-tree[old].sum;
    int ans=0;
    int mid=(l+r)>>1;
    if(ql<=mid) ans+=query(tree[now].ls,tree[old].ls,l,mid,ql,qr);
    if(qr>mid) ans+=query(tree[now].rs,tree[old].rs,mid+1,r,ql,qr);
    return ans;
}

int ch(int mid,int L,int R,int p)
{
    int qr=min(maxm,p+mid);
    int ql=max(1,p-mid);
    return query(rt[R],rt[L-1],1,maxm,ql,qr);
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;
    sfi(T);
    while(T--)
    {
        init();

        scanf("%d%d",&n,&m);
        build(rt[0],1,maxm);
        for(int i=1;i<=n;i++)
        {
            sfi(a[i]);
            update(rt[i],rt[i-1],1,maxm,a[i],1);
        }

        int ans=0;
        for(int i=1;i<=m;i++)
        {
            int L,R,p,K;
            scanf("%d%d%d%d",&L,&R,&p,&K);

            L=ans^L;
            R=ans^R;
            p=ans^p;
            K=ans^K;

            int l=0;
            int r=(int)1e6;

            int tmp=0;
            while(l<=r)
            {
                int mid=(l+r)>>1;
                if(ch(mid,L,R,p)<K) l=mid+1;
                else r=mid-1,tmp=mid;
            }
            ans=tmp;
            printf("%d\n",ans);
        }



    }


    return 0;
}