-
Notifications
You must be signed in to change notification settings - Fork 1
/
dual_disjoint_sparse_table.hpp
58 lines (58 loc) · 1.35 KB
/
dual_disjoint_sparse_table.hpp
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#pragma once
/**
* @brief 双対 Disjoint Sparse Table
*/
template <typename T>
struct dual_disjoint_sparse_table{
vector<T> A;
vector<vector<T>> D;
function<T(T, T)> f;
T E;
dual_disjoint_sparse_table(){
}
dual_disjoint_sparse_table(int N, function<T(T, T)> f, T E): A(N, E), f(f), E(E){
if (N > 1){
int LOG = 32 - __builtin_clz(N - 1);
D = vector<vector<T>>(LOG, vector<T>(N, E));
}
}
dual_disjoint_sparse_table(vector<T> &A, function<T(T, T)> f, T E): A(A), f(f), E(E){
int N = A.size();
if (N > 1){
int LOG = 32 - __builtin_clz(N - 1);
D = vector<vector<T>>(LOG, vector<T>(N, E));
}
}
void apply(int L, int R, T x){
if (L == R){
return;
} else if (R - L == 1){
A[L] = f(A[L], x);
} else {
R--;
int b = 31 - __builtin_clz(R ^ L);
D[b][L] = f(D[b][L], x);
D[b][R] = f(D[b][R], x);
}
}
vector<T> get(){
int LOG = D.size();
int N = A.size();
for (int i = 0; i < LOG; i++){
int d = 1 << i;
for (int j = 0; j + d < N; j += d * 2){
T L = E;
for (int k = j; k < j + d; k++){
L = f(L, D[i][k]);
A[k] = f(A[k], L);
}
T R = E;
for (int k = min(j + d * 2, N) - 1; k >= j + d; k--){
R = f(R, D[i][k]);
A[k] = f(A[k], R);
}
}
}
return A;
}
};