CodeForces/242E.cpp at master · yueyangw/CodeForces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 100009;

int n, m;
ll ans, power[25];
int tree[N * 4][25], tag[N * 4][25], v[N * 4];

void build(int k, int l, int r){
	if(l == r){
		int c = v[l];
		for(int i = 0; i <= 20; i++){
			if((c >> i) & 1) tree[k][i] = 1;
		}
		return;
	}
	int mid = (l + r) / 2;
	build(k * 2, l, mid);
	build(k * 2 + 1, mid + 1, r);
	for(int i = 0; i <= 20; i++){
		tree[k][i] = tree[k * 2][i] + tree[k * 2 + 1][i];
	}
}

void pushdown(int k, int l, int r, int p){
	tree[k][p] = (r - l + 1) - tree[k][p];
	if(l != r){
		tag[k * 2][p] ^= 1;
		tag[k * 2 + 1][p] ^= 1;
		tag[k][p] = 0;
	}
	tag[k][p] = 0;
}

void modify(int k, int l, int r, int x, int y, int p){
	if(tag[k][p]) pushdown(k, l, r, p);
	if(l > y || r < x) return;
	if(l >= x && r <= y){
		pushdown(k, l, r, p);
		return;
	}
	int mid = (l + r) / 2;
	modify(k * 2, l, mid, x, y, p);
	modify(k * 2 + 1, mid + 1, r, x, y, p);
	tree[k][p] = tree[k * 2][p] + tree[k * 2 + 1][p];
}

void query(int k, int l, int r, int x, int y){
	for(int i = 0; i <= 20; i++)
		if(tag[k][i]) pushdown(k, l, r, i);
	if(l >= x && r <= y){
		for(int i = 0; i <= 20; i++)
			ans += tree[k][i] * power[i];
		return;
	}
	int mid = (l + r) / 2;
	if(mid >= x) query(k * 2, l, mid, x, y);
	if(mid < y) query(k * 2 + 1, mid + 1, r, x, y);
}

int main(){
	power[0] = 1;
	for(int i = 1; i <= 21; i++) power[i] = power[i - 1] << 1;
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		scanf("%d", &v[i]);
	}
	build(1, 1, n);
	scanf("%d", &m);
	for(int i = 1; i <= m; i++){
		int op, x, y, w;
		scanf("%d%d%d", &op, &x, &y);
		if(op == 1){
			ans = 0;
			query(1, 1, n, x, y);
			printf("%lld\n", ans);
		}
		else{
			scanf("%d", &w);
			for(int i = 0; i <= 20; i++){
				if((w >> i) & 1) modify(1, 1, n, x, y, i);
			}
		}
	}
	return 0;
}