CodeForces 339D
2016-07-08 15:22
363 查看
#include <iostream> #include <cstdio> #include <cstring> #include <string> #include <algorithm> using namespace std; typedef long long LL; const int maxn = 20; int a[1<<maxn]; int n, m, u, v; void Build() { int p = 1 << n, res = 0; while(p) { p >>= 1; for(int i = p; i < 2*p; ++i) { if(res&1) a[i] = a[i<<1] ^ a[(i<<1)+1]; else a[i] = a[i<<1] | a[(i<<1)+1]; } res++; } } void Update(int p) { int res = 0; while(p) { p >>= 1; if(res&1) a[p] = a[p<<1] ^ a[(p<<1)+1]; else a[p] = a[p<<1] | a[(p<<1)+1]; res++; } } int main() { scanf("%d%d", &n, &m); int len = 1 << n, p = len; for(int i = 0; i < len; ++i) scanf("%d", &a[len+i]); Build(); while(m--) { int u, v; scanf("%d%d", &u, &v); a[p+u-1] = v; Update(p+u-1); printf("%d\n", a[1]); } return 0; }
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- codeforces 618C. Constellation
- Codeforces Round #349 (Div. 2) - C
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces Round332 部分题解
- CodeForces 603A_Alternative Thinking (DP)
- CodeForces 602B_Approximating a Constant Range_DP
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)
- Codeforces #264(div 2)D.Gargari and Permutations
- Codeforces Round #236 (Div. 2)------A,B
- codeforces 257 div2 B