Xenia and Bit Operations
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 for a.Namely, it takes several iterations to calculate value v. At the first iteration, Xenia writes a new sequence a1 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.
For more information on the bit operations, you can follow this link: http://en.wikipedia.org/wiki/Bitwise_operation
The first line contains two integers n and m (1 ≤ n ≤ 17, 1 ≤ m ≤ 105). The next line contains 2n integers a1, 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.
import sys
input = sys.stdin.readline
nextInts = lambda : list(map(int, input().split()))
nextInt = lambda : int(input())
Mod = 10 ** 9 + 7

def solution():
    (n, m) = nextInts()
    nums = nextInts()
    tree = nums + nums
    depth = len(nums) // 2
    is_or = True
    for i in range(len(nums))[::-1]:
        if i < depth:
            depth >>= 1
            is_or = not is_or
        if is_or:
            tree[i] = tree[2 * i] | tree[2 * i + 1]
        else:
            tree[i] = tree[2 * i] ^ tree[2 * i + 1]

    def update(i, val):
        i += len(nums)
        tree[i] = val
        is_or = True
        i >>= 1
        while i:
            if is_or:
                tree[i] = tree[2 * i] | tree[2 * i + 1]
            else:
                tree[i] = tree[2 * i] ^ tree[2 * i + 1]
            i >>= 1
            is_or = not is_or
    for _ in range(m):
        (i, val) = nextInts()
        update(i - 1, val)
        print(tree[1])

def main():
    t = 1
    for _ in range(t):
        solution()
main()
import sys
input = sys.stdin.readline
output = sys.stdout.write

def segment_tree(values):
    for i in range(2 ** n):
        tree[2 ** n + i] = values[i]
    for j in range(0, n):
        if j % 2 != 0:
            for i in range(2 ** n // 2 ** j - 1, 2 ** n // 2 ** (j + 1) - 1, -1):
                tree[i] = tree[i + i] ^ tree[i + i + 1]
        else:
            for i in range(2 ** n // 2 ** j - 1, 2 ** n // 2 ** (j + 1) - 1, -1):
                tree[i] = tree[i + i] | tree[i + i + 1]

def update_tree_node(p, value):
    i = p + 2 ** n
    tree[i] = value
    flag = True
    while i > 1:
        if flag:
            tree[i // 2] = tree[i] | tree[i ^ 1]
            i //= 2
            flag = False
        else:
            tree[i // 2] = tree[i] ^ tree[i ^ 1]
            i //= 2
            flag = True
(n, m) = list(map(int, input().split()))
values = list(map(int, input().split()))
tree = [0 for i in range(2 * 2 ** n)]
segment_tree(values)
for i in range(m):
    (p, b) = list(map(int, input().split()))
    update_tree_node(p - 1, b)
    output(str(tree[1]) + '\n')
import sys
input = sys.stdin.readline

def segment_tree(values):
    for i in range(2 ** n):
        tree[2 ** n + i] = values[i]
    for j in range(0, n):
        if j % 2 != 0:
            for i in range(2 ** n // 2 ** j - 1, 2 ** n // 2 ** (j + 1) - 1, -1):
                tree[i] = tree[i + i] ^ tree[i + i + 1]
        else:
            for i in range(2 ** n // 2 ** j - 1, 2 ** n // 2 ** (j + 1) - 1, -1):
                tree[i] = tree[i + i] | tree[i + i + 1]

def update_tree_node(p, value):
    i = p + 2 ** n
    tree[i] = value
    flag = True
    while i > 1:
        if flag:
            tree[i // 2] = tree[i] | tree[i ^ 1]
            i //= 2
            flag = False
        else:
            tree[i // 2] = tree[i] ^ tree[i ^ 1]
            i //= 2
            flag = True
(n, m) = list(map(int, input().split()))
values = list(map(int, input().split()))
tree = [0 for i in range(2 * 2 ** n)]
segment_tree(values)
for i in range(m):
    (p, b) = list(map(int, input().split()))
    update_tree_node(p - 1, b)
    sys.stdout.write(str(tree[1]) + '\n')