xor
This commit is contained in:
@@ -10,7 +10,7 @@ vector<ll> construct(vector<ll> &input) {
|
||||
output[input.size() + i] = input[i];
|
||||
}
|
||||
for (int i = input.size() - 1; i > 0; i--) {
|
||||
output[i] = output[2*i] + output[2*i + 1];
|
||||
output[i] = (output[2*i] ^ output[2*i + 1]);
|
||||
}
|
||||
return output;
|
||||
}
|
||||
@@ -20,7 +20,7 @@ void update(int k, ll x, int n, vector<ll> &tree) {
|
||||
tree[k] = x;
|
||||
k /= 2;
|
||||
for (; k >= 1; k /= 2) {
|
||||
tree[k] = tree[2*k + 1] + tree[2*k];
|
||||
tree[k] = (tree[2*k + 1] ^ tree[2*k]);
|
||||
}
|
||||
}
|
||||
|
||||
@@ -30,11 +30,11 @@ ll query(int a, int b, int n, vector<ll> &tree) {
|
||||
ll s = 0;
|
||||
while (a <= b) {
|
||||
if (a % 2 == 1) {
|
||||
s += tree[a];
|
||||
s ^= tree[a];
|
||||
a++;
|
||||
}
|
||||
if (b % 2 == 0) {
|
||||
s += tree[b];
|
||||
s ^= tree[b];
|
||||
b--;
|
||||
}
|
||||
a /= 2; b /= 2;
|
||||
|
||||
Reference in New Issue
Block a user