Xenia the beginner programmer has a sequence a, consisting of 2n non-negative integers: a1, a2, ..., a2n. Xenia is currently studying bit operations. To better understand how they work, Xenia decided to calculate some value v fora.
Namely, it takes several iterations to calculate value v. At the first iteration, Xenia writes a new sequencea1 or a2, a3 or a4, ..., a2n - 1 or a2n, consisting of 2n - 1 elements. In other words, she writes down the bit-wise OR of adjacent elements of sequence a. At the second iteration, Xenia writes the bitwise exclusive OR of adjacent elements of the sequence obtained after the first iteration. At the third iteration Xenia writes the bitwise OR of the adjacent elements of the sequence obtained after the second iteration. And so on; the operations of bitwise exclusive OR and bitwise OR alternate. In the end, she obtains a sequence consisting of one element, and that element is v.
Let's consider an example. Suppose that sequence a = (1, 2, 3, 4). Then let's write down all the transformations(1, 2, 3, 4) → (1 or 2 = 3, 3 or 4 = 7) → (3 xor 7 = 4). The result is v = 4.
You are given Xenia's initial sequence. But to calculate value v for a given sequence would be too easy, so you are given additional m queries. Each query is a pair of integers p, b. Query p, b means that you need to perform the assignment ap = b. After each query, you need to print the new value v for the new sequence a.
The first line contains two integers n and m (1 ≤ n ≤ 17, 1 ≤ m ≤ 105). The next line contains 2n integersa1, a2, ..., a2n (0 ≤ ai < 230). Each of the next m lines contains queries. The i-th line contains integers pi, bi (1 ≤ pi ≤ 2n, 0 ≤ bi < 230) — the i-th query.
Print m integers — the i-th integer denotes value v for sequence a after the i-th query.
1 #include <iostream> 2 #include <vector> 3 #include <cstring> 4 #include <cstdio> 5 #include <cmath> 6 #define ls rt<<1 7 #define rs rt<<1|1 8 using namespace std; 9 10 struct Node 11 { 12 int x; 13 int res; 14 }a[140000<<2]; 15 int p[18] = {0, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16 16384, 32768, 65536, 131072}; 17 int height; 18 19 void build_tree(int lef, int rig, int rt) 20 { 21 if(rig == lef){ 22 scanf("%d", &a[rt].x); 23 a[rt].res = a[rt].x; 24 return ; 25 } 26 int mid = (lef + rig) >> 1; 27 build_tree(lef, mid, ls); 28 build_tree(mid + 1, rig, rs); 29 if((height - (int)log2(rt)) & 1) a[rt].res = a[rs].res ^ a[ls].res; 30 else a[rt].res = a[rs].res | a[ls].res; 31 } 32 33 void update_tree(int lef, int rig, int rt, int id, int v) 34 { 35 if(lef == rig){ 36 a[rt].x = a[rt].res = v; 37 return ; 38 } 39 int mid = (lef + rig) >> 1; 40 if(id > mid) update_tree(mid + 1, rig, rs, id, v); 41 else update_tree(lef, mid, ls, id, v); 42 if((height - (int)log2(rt)) & 1) a[rt].res = a[rs].res ^ a[ls].res; 43 else a[rt].res = a[rs].res | a[ls].res; 44 } 45 46 int main() 47 { 48 int n, m; 49 while(scanf("%d %d", &n, &m) != EOF){ 50 height = ceil(log2(p[n] + 1)); 51 build_tree(1, p[n], 1); 52 int b, c; 53 while(m--){ 54 scanf("%d %d", &b, &c); 55 update_tree(1, p[n], 1, b, c); 56 printf("%d ", a[1].res); 57 } 58 } 59 return 0; 60 }