[SCOI2016]美味
不会写可持久化trie,只能主席树强上。
这种异或的题一般都是从高位往低位贪心,这题也不例外,考虑怎样快速维护这个贪心的过程:还是尽量使当前位与查询的\(b\)值不同,想到用主席树查询长度为\(1 << i\)的一段值域(\(i\)表示当前位),有个\(+x\)的处理,其实只要把我们查询区间的左右端点\(-x\)就行了。
细节略显麻烦。
//written by newbiechd
#include <cstdio>
#include <cctype>
#define R register
#define I inline
#define B 1000000
using namespace std;
const int N = 200003, M = 5000003, S = 100000;
char buf[B], *p1, *p2;
I char gc() { return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, B, stdin), p1 == p2) ? EOF : *p1++; }
I int rd() {
R int f = 0;
R char c = gc();
while (c < 48 || c > 57)
c = gc();
while (c > 47 && c < 58)
f = f * 10 + (c ^ 48), c = gc();
return f;
}
int rt[N], T;
struct segtree {
int p, q, s;
}e[M];
I int min(int x, int y) { return x < y ? x : y; }
I int max(int x, int y) { return x > y ? x : y; }
int insert(int k, int l, int r, int x) {
R int t = ++T;
e[t].p = e[k].p, e[t].q = e[k].q, e[t].s = e[k].s + 1;
if (l == r)
return t;
R int m = (l + r) >> 1;
if (x <= m)
e[t].p = insert(e[k].p, l, m, x);
else
e[t].q = insert(e[k].q, m + 1, r, x);
return t;
}
int query(int k, int t, int l, int r, int x, int y) {
if (x <= l && r <= y)
return e[t].s - e[k].s;
R int m = (l + r) >> 1, o = 0;
if (x <= m)
o += query(e[k].p, e[t].p, l, m, x, y);
if (m < y)
o += query(e[k].q, e[t].q, m + 1, r, x, y);
return o;
}
int main() {
int n = rd(), m = rd(), i, x, y, l, r, o, ans;
for (i = 1; i <= n; ++i)
x = rd(), rt[i] = insert(rt[i - 1], 0, S, x);
while (m--) {
x = rd(), y = rd(), l = rd() - 1, r = rd(), o = 0, ans = 0;
for (i = 17; ~i; --i)
if ((x >> i) & 1)
if (o + (1 << i) - 1 > y && query(rt[l], rt[r], 0, S, min(max(o - y, 0), S), min(o + (1 << i) - 1 - y, S)))
ans += 1 << i;
else
o += 1 << i;
else
if (o + (1 << (i + 1)) - 1 > y && query(rt[l], rt[r], 0, S, min(max(o + (1 << i) - y, 0), S), min(o + (1 << (i + 1)) - 1 - y, S)))
ans += 1 << i, o += 1 << i;
printf("%d\n", ans);
}
return 0;
}