Codeforces Round #197 (Div. 2) D. Xenia and Bit Operations（容器做法）

D. Xenia and Bit Operations
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
Sample test(s)
Input
2 4
1 6 3 5
1 4
3 4
1 2
1 2
Output
1
3
3

3

题解上有用线段树这种算法，暂时还不太会写，网上又看到了用容器来做，比较简单

写的时候我又是把它理解成有n+1层的二叉树，第一次操作得到倒数第二层，然后直到顶点

#include <cstdio>
#include <vector>
using namespace std;
int n, m;
vector<int> vec[20];
int main()
{
    //freopen("E:\\in.txt","r",stdin);

    cin>>n>>m;

        for (int i = 0; i < 20; i++) vec[i].clear();
        for (int i = 0; i < 1 << n; i++)
        {
            int a;
            scanf("%d", &a);
            vec[0].push_back(a);//给最底层的容器赋值
        }
        for (int i =1; i <=n; i++)
        {
            for (int k = 0; k < vec[i-1].size(); k += 2)
            {
                int now = (i%2?vec[i-1][k]|vec[i-1][k+1]:vec[i-1][k]^vec[i-1][k+1]);//每层往上根据条件来对上层容器赋值
                vec[i].push_back(now);
            }
        }
        for (int i = 0; i < m; i++)
        {
            int p, q;
            scanf("%d%d", &p, &q);
            vec[0][--p] =q;//修改后
            for (int i =1; i <=n; i++)
            {
                if (i%2)
                {if(p%2==0)
                    vec[i][p/2] = vec[i-1][p]|vec[i-1][p+1];//对修改的前面那段重新赋值，同时我讨论了p的奇偶性
                    else
                    vec[i][p/2] = vec[i-1][p-1]|vec[i-1][p];
                }
                else
                {
                    if(p%2==0)
                    vec[i][p/2] = vec[i-1][p]^vec[i-1][p+1];
                    else
                    vec[i][p/2] = vec[i-1][p-1]^vec[i-1][p];
                }
                p/= 2;
            }
            printf("%d\n", vec[n][0]);
        }
    return 0;
}