Codeforces-339D-Xenia and Bit Operations（线段树）

题目：

Description：

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 mqueries. 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.

Input

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.

Output

Print m integers — the i-th integer denotes value v for sequence a after the i-th query.

Examples

input

2 4
1 6 3 5
1 4
3 4
1 2
1 2

output

1
3
3
3

Note

For more information on the bit operations, you can follow this link: http://en.wikipedia.org/wiki/Bitwise_operation

题意：修改序列中p位置的值为x，查询整个序列先或，再异或转换之后的最终答案

题意分析：

难办的地方就是先是保存或的答案，再保存异或的答案，这时候需要一个判断，在子树某个时候为或，某个时候为异或，可以自己先画个线段树看那个节点的长度，找规律，当长度为2的i次方，i为奇数时是或，偶数时是异或，然后根据数据，最大到2的17次方，具体操作可以自己画图查找规律

代码：

#include<bits/stdc++.h>
#define LL long long
#define N 150000
using namespace std;
LL n,m,u,v;
LL a[N];
struct ljh
{
	LL l,r,lazy,x;
}e[4*N];
inline void make(LL node)
{
	LL k=e[node].r-e[node].l+1;
	for(LL i=0;i<=17;i++)
		if(k==pow(2,i))
		{
			k=i;
			break;
		}
	// cout<<e[node].l<<" "<<e[node].r<<endl;
	if(k%2==1)
	{
		// cout<<"~1\n";
		e[node].x=(e[node<<1].x|e[node<<1|1].x);
	}
	else
	{
		// cout<<"~2\n";
		e[node].x=(e[node<<1].x^e[node<<1|1].x);
	}
}
void Build(LL node,LL left,LL right)
{
	e[node].lazy=0;
	e[node].l=left;
	e[node].r=right;
	if(left==right)
	{
		e[node].x=a[left];
	}
	else
	{
		int m=(left+right)>>1;
		Build(node<<1,left,m);
		Build(node<<1|1,m+1,right);
		make(node);
	}
}
void Update(LL node,LL u,LL z)
{
	if(u==e[node].l&&u==e[node].r)
	{
		e[node].x=z;
		return;
	}
	int m=(e[node].l+e[node].r)>>1;
	if(u<=m)Update(node<<1,u,z);
	if(u>m)Update(node<<1|1,u,z);
	make(node);
}
int main()
{
	scanf("%lld%lld",&n,&m);
	n=pow(2,n);
	for(LL i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
	}
	Build(1,1,n);
	/*for(int i=1;i<=2*n-1;i++)
	{
		cout<<e[i].l<<" "<<e[i].r<<" "<<e[i].x<<endl;
	}*/
	while(m--)
	{
		scanf("%lld%lld",&u,&v);
		Update(1,u,v);
		printf("%lld\n",e[1].x);
	}
	return 0;
}
/*
3 10
1 6 3 5 4 7 8 2
*/