哎呀呀,要不是老弟问我问题,我都忘了已经暑假了,可以抽空玩玩多校联合的题目。
唔,这个题一看就像一道基本主席树的题,咔咔咔,想都不想就直接敲,敲完了才发现,哎呀,是求距离P的第K近的距离。不方,这种什么第K大呀巴拉巴拉的,直觉就是用二分,然后往二分想了想,可做!
看题目时间给的还挺多,就懒得想各种优化了,直接暴力二分+主席树,过之~,下面是代码
好久没写c++了,感觉还是那么亲切呢。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define N 100001
#define M 1000000
#define mid (l+r>>1)
struct Tr{
int cnt, lc, rc;
}tr[M*30];
int ro[N], tot;
int newTr() {
int d = tot++;
tr[d].cnt = tr[d].lc = tr[d].rc = 0;
return d;
}
int build(int pre, int l, int r, int p) {
int d = newTr();
tr[d].cnt = tr[pre].cnt+1;
if (l != r) {
if (p <= mid) {
tr[d].rc = tr[pre].rc;
tr[d].lc = build(tr[pre].lc, l, mid, p);
} else {
tr[d].lc = tr[pre].lc;
tr[d].rc = build(tr[pre].rc, mid+1, r, p);
}
}
return d;
}
int query(int rt, int lt, int l, int r, int L, int R) {
if (l == L && r == R) {
return tr[rt].cnt-tr[lt].cnt;
}
if (R <= mid) {
return query(tr[rt].lc, tr[lt].lc, l, mid, L, R);
} else if (L > mid) {
return query(tr[rt].rc, tr[lt].rc, mid+1, r, L, R);
} else {
return query(tr[rt].lc, tr[lt].lc, l, mid, L, mid)+query(tr[rt].rc, tr[lt].rc, mid+1, r, mid+1, R);
}
}
int main() {
int n, a, m, i, j, l, r, p, k, x, t;
tr[0].cnt = tr[0].lc = tr[0].rc = 0;
scanf("%d", &t);
while (t--) {
tot = 1;
scanf("%d%d", &n, &m);
ro[0] = 0;
for (i = 1;i <= n;i++) {
scanf("%d", &a);
ro[i] = build(ro[i-1], 1, M-1, a);
}
x = 0;
while (m--) {
scanf("%d%d%d%d", &l, &r, &p, &k);
l ^= x, r ^= x, p ^= x, k ^= x;
int ql = 0, qr = max(p-1, M-1-p), qx = -1;
while (ql < qr) {
int qm = ql+qr>>1;
int cnt = query(ro[r], ro[l-1], 1, M-1, max(1, p-qm), min(M-1, p+qm));
if (cnt >= k) {
qr = qm;
} else if (cnt < k) {
ql = qm+1;
}
}
x = ql;
printf("%d\n", x);
}
}
}