http://codeforces.com/contest/339/problem/D Xenia and Bit Operations

先建完全二叉树得到每一层的值，每一次更新，就dfs到叶节点处再往回更新即可，注意n的取值，对于每一层是or或xor有影响。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <list>
#include <stack>
#include <cstring>
#include <queue>
using namespace std;
#define MAX 150005
#define ll long long
#define INF 0x3f3f3f3f
#define mod 1000000007
int a[MAX], t[MAX << 2], x, y;
void buildTree(int l,int r,int o,bool f) {
    if (l == r) {
        t[o] = a[l];
        return;
    }
    int mid = (l + r) >> 1;
    int ro = (o << 1) | 1, lo = (o << 1);
    buildTree(l, mid, lo,f^1);
    buildTree(mid + 1, r, ro,f^1);
    if (!f) t[o] = t[lo] | t[ro];
    else t[o] = t[lo] ^ t[ro];
}
void updateTree(int l,int r,int o,int f) {
    if (l == r) {
        t[o] = y;
        return;
    }
    int mid = (l + r) >> 1;
    int ro = (o << 1) | 1, lo = (o << 1);
    if(x - 1 <= mid) updateTree(l, mid, lo, f ^ 1);
    else updateTree(mid + 1, r, ro, f ^ 1);
    if (!f) t[o] = t[lo] | t[ro];
    else t[o] = t[lo] ^ t[ro];
}
int main()
{
//  freopen("a.txt", "r", stdin);
//  freopen("b.txt", "w", stdout);
    int n, m;
    cin >> n >> m;
    int p = 1 << n;
    for (int i = 0; i < p; ++i) {
        scanf("%d", &a[i]);
    }
    bool f = true;
    if (n & 1) f = false;
    buildTree(0, p - 1, 1, f);
    for (int i = 1; i <= m; ++i) {
        scanf("%d%d", &x, &y);
        updateTree(0, p - 1, 1, f);
        printf("%d\n", t[1]);
    }
    return 0;
}