1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
struct WaveletTree {
using it = vector<ll>::iterator;
WaveletTree *ln = nullptr, *rn = nullptr;
vector<int> b = {0};
ll lo, hi;
WaveletTree(vector<ll> in) : WaveletTree(all(in)) {}
WaveletTree(it from, it to) : // call above one
lo(*min_element(from, to)), hi(*max_element(from, to) + 1) {
ll mid = (lo + hi) / 2;
auto f = [&](ll x) {return x < mid;};
for (it c = from; c != to; c++) {
b.push_back(b.back() + f(*c));
}
if (lo + 1 >= hi) return;
it pivot = stable_partition(from, to, f);
ln = new WaveletTree(from, pivot);
rn = new WaveletTree(pivot, to);
}
// kth element in sort[l, r) all 0-indexed
ll kth(int l, int r, int k) {
if (l >= r || k >= r - l) return -1;
if (lo + 1 >= hi) return lo;
int inLeft = b[r] - b[l];
if (k < inLeft) return ln->kth(b[l], b[r], k);
else return rn->kth(l-b[l], r-b[r], k-inLeft);
}
// count elements in[l, r) smaller than k
int countSmaller(int l, int r, ll k) {
if (l >= r || k <= lo) return 0;
if (hi <= k) return r - l;
return ln->countSmaller(b[l], b[r], k) +
rn->countSmaller(l-b[l], r-b[r], k);
}
~WaveletTree() {delete ln; delete rn;}
};
|
