Xenia and Bit Operations（线段树单点修改）

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.

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

题意： 告诉你2^n个结点，然后先两两进行或运算然后又进行异或运算，输出最后得到的值。可以记录线段树的高度，奇数高度进行或运算，偶数高度进行异或运算。详细看代码。

#include<list>
#include<string.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<map>
#include<deque>
#include<stack>
#include<queue>
#include<set>
#include<iomanip>
#include<cstdlib>
#include<stdexcept>
#include<fstream>
#include<iterator>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e3 + 10;
const int inf = 0x3f3f3f3f;
const int Base = 131;
const ll INF = 1ll << 62;
//const double PI = acos(-1);
const double eps = 1e-7;
const int mod = 1e9 + 9;
#define PI acos(-1)
#define mem(a,b) memset(a,b,sizeof(a))
#define speed {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); }
#define wait while(1){}
#define debug cout<<"********"<<endl;

// freopen("C:/Users/ASUS/Desktop/Struct/in.txt", "r", stdin); //输入重定向，输入数据将从in.txt文件中读取 
// freopen("C:/Users/ASUS/Desktop/Struct/out.txt", "w", stdout); //输出重定向，输出数据将保存out.txt文件中 
// fclose(stdin);//关闭重定向输入
// fclose(stdout);//关闭重定向输出 

const int MAX = 1<<17|1;//最多17位
int a[MAX];
int height[MAX];
struct Node{
	int l,r,value;
}node[MAX<<2];

void pushUp(int rt){
	height[rt]=height[rt<<1]+1;//父亲结点的深度是儿子结点加一
	if(height[rt]&1)node[rt].value=node[rt<<1].value|node[rt<<1|1].value;//奇数或运算
	else node[rt].value=node[rt<<1].value^node[rt<<1|1].value;
}

void buildTree(int rt,int l,int r){
	node[rt].l=l;
	node[rt].r=r;
	if(l==r){
		height[rt]=0;//叶子结点高度为0
		node[rt].value=a[l];
		return;
	}
	int mid = (l+r)>>1;
	buildTree(rt<<1,l,mid);
	buildTree(rt<<1|1,mid+1,r);
	pushUp(rt);
}

void upDate(int rt,int index,int value){//单点修改
	if(node[rt].l==index && node[rt].r==index){
		node[rt].value=value;
		return;
	}
	int mid=(node[rt].l+node[rt].r)>>1;
	if(index<=mid)upDate(rt<<1,index,value);
	else upDate(rt<<1|1,index,value);
	pushUp(rt);
}

int main(){
	int n,m;
	scanf("%d %d",&n,&m);
	int t=1<<n;
	for(int i=1;i<=t;i++){
		scanf("%d",&a[i]);
	}
	buildTree(1,1,t);
	while(m--){
		int x,y;
		scanf("%d %d",&x,&y);
		upDate(1,x,y);
		printf("%d\n",node[1].value);//线段树向上推，node[1].value即为最终结果
	}
	system("pause");
	return 0;
}