cf339d Xenia and Bit Operations

Xenia the beginner programmer has a sequence a, consisting of 2ⁿ non-negative integers: a₁, a₂, ..., a_2ⁿ. 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 sequencea₁ or a₂, a₃ or a₄, ..., a_2ⁿ - 1 or a_2ⁿ, consisting of 2^n - 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 a_p = b. After each query, you need to print the new value v for the new sequence a.

The first line contains two integers n and m(1 ≤ n ≤ 17, 1 ≤ m ≤ 10⁵). The next line contains 2ⁿ integers a₁, a₂, ..., a_2ⁿ(0 ≤ a_i < 2³⁰). Each of the next m lines contains queries. The i-th line contains integers p_i, b_i(1 ≤ p_i ≤ 2ⁿ, 0 ≤ b_i < 2³⁰) — the i-th query.

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

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

很基础的线段树

#include<iostream>
#include<stdio.h>
using namespace std;
const int maxx = 1<<18;
int num[maxx];
int ans[maxx<<2];
void build(int l,int r,int rt,int op)
{
    if(l==r)
    {
        ans[rt]=num[l];
        return;
    }
    int mid=(l+r)>>1;
    build(l,mid,rt<<1,1-op);
    build(mid+1,r,rt<<1|1,1-op);
    if(op==1) ans[rt]=ans[rt<<1]|ans[rt<<1|1];
    else ans[rt]=ans[rt<<1]^ans[rt<<1|1];
}
void update(int l,int r,int rt,int index,int value,int op)
{
    if(l==r&&l==index)
    {
        ans[rt]=value;
        return;
    }
    int mid=(l+r)>>1;
    if(mid<index)
    {
        update(mid+1,r,(rt<<1|1),index,value,1-op);
    }
    else
    {
        update(l,mid,rt<<1,index,value,1-op);
    }
    if(op==1) ans[rt]=ans[rt<<1]|ans[rt<<1|1];
    else ans[rt]=ans[rt<<1]^ans[rt<<1|1];
}
int main()
{
    //cout<<maxx+1<<endl;
    int n,m;
    scanf("%d%d",&n,&m);
    int sum=1<<n;
    for(int i=1;i<=sum;i++)
        scanf("%d",&num[i]);
    build(1,sum,1,n%2);
    for(int i=0;i<m;i++)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        update(1,sum,1,a,b,n%2);
        printf("%d\n",ans[1]);
    }
    return 0;
}

View Code