Xenia and Bit Operations(线段树单点更新)
2013-08-29 01:13
369 查看
Xenia and Bit Operations
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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 fora.
Namely, it takes several iterations to calculate value v. At the first iteration, Xenia writes a new sequencea1 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 integersa1, 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.
AC Code:
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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 fora.
Namely, it takes several iterations to calculate value v. At the first iteration, Xenia writes a new sequencea1 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 integersa1, 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.
AC Code:
#include <iostream> #include <vector> #include <cstring> #include <cstdio> #include <cmath> #define ls rt<<1 #define rs rt<<1|1 using namespace std; struct Node { int x; int res; }a[140000<<2]; int p[18] = {0, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072}; int height; void build_tree(int lef, int rig, int rt) { if(rig == lef){ scanf("%d", &a[rt].x); a[rt].res = a[rt].x; return ; } int mid = (lef + rig) >> 1; build_tree(lef, mid, ls); build_tree(mid + 1, rig, rs); if((height - (int)log2(rt)) & 1) a[rt].res = a[rs].res ^ a[ls].res; else a[rt].res = a[rs].res | a[ls].res; } void update_tree(int lef, int rig, int rt, int id, int v) { if(lef == rig){ a[rt].x = a[rt].res = v; return ; } int mid = (lef + rig) >> 1; if(id > mid) update_tree(mid + 1, rig, rs, id, v); else update_tree(lef, mid, ls, id, v); if((height - (int)log2(rt)) & 1) a[rt].res = a[rs].res ^ a[ls].res; else a[rt].res = a[rs].res | a[ls].res; } int main() { int n, m; while(scanf("%d %d", &n, &m) != EOF){ height = ceil(log2(p + 1)); build_tree(1, p , 1); int b, c; while(m--){ scanf("%d %d", &b, &c); update_tree(1, p , 1, b, c); printf("%d\n", a[1].res); } } return 0; }
相关文章推荐
- CodeForces 339D D. Xenia and Bit Operations(线段树的单点更新)
- Xenia and Bit Operations 【线段树】
- Codeforces Round #197 (Div. 2) D. Xenia and Bit Operations(线段树)
- CF 339D - Xenia and Bit Operations(线段树)
- 文章标题 coderforces 339D : Xenia and Bit Operations (线段树+点修改)
- Codeforces Round #197 (Div. 2) D. Xenia and Bit Operations - 线段树
- codeforces 339 D.Xenia and Bit Operations(线段树)
- Codeforces Round #197 (Div. 2) -- D. Xenia and Bit Operations(线段树)
- codeforces 339 D.Xenia and Bit Operations(线段树)
- 线段树 Codeforces Round #197 (Div. 2) D. Xenia and Bit Operations
- codeforces 315 B.Sereja and Array(线段树区间更新+单点更新+单点询问)
- Codeforces Round #197 (Div. 2) D. Xenia and Bit Operations
- HDU - 1823 Luck and Love(二维线段树、单点更新区间最值)
- 线段树(单点更新and成段更新)
- Codeforces Round #197 (Div. 2) D. Xenia and Bit Operations
- A - 敌兵布阵 (线段树,单点更新||BIT 动态求和)
- HDU1823 Luck and Love(二维线段树单点更新+区间查询+模板)
- Luck and Love(二维线段树单点更新+区间查询+模板)
- 单点更新 “区间和”最值查询 线段树解法 和 BIT解法 杭电hdu1166
- HDU1823 Luck and Love (二维线段树 + 单点更新 + 区间查询)