线段树位运算区间更新(牛客东信杯j题)

思路：其实就是区间更新的时候，不是加减数了，而是用或运算，具体看代码

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
typedef long long LL;
const int maxn = 2e5 + 10;
/*
用二进制表示每个节点的值
不算进位~
*/
int val[maxn * 4][22];
int lazy[maxn * 4];
int n, m;
LL ans;
void pushup(int root)
{
	for (int i = 0; i < 22; i++) 
	{
		val[root][i] = val[root << 1][i] + val[root << 1 | 1][i];
	}
}
void pushdown(int root, int len)
{
	if (lazy[root])
	{
		lazy[root << 1 | 1] |= lazy[root];
		lazy[root << 1] |= lazy[root];
		for (int i = 0; i < 22; i++) 
		{
			if ((lazy[root] >> i) & 1)
			{
				val[root << 1][i] = len - (len >> 1);
				val[root << 1 | 1][i] = len>>1;
			}
		}
		lazy[root] = 0;
	}
}
void build(int root, int l, int r)
{
	if (l == r)
	{
		int t;
		scanf("%d", &t);
		for (int i = 0; i < 22; i++)
		{
			val[root][i] = (t >> i) & 1;
		}
		return;
	}
	int mid = (l + r) >> 1;
	build(root << 1, l, mid);
	build(root << 1 | 1, mid + 1, r);

	pushup(root);
}
void update(int root, int L, int R, int l, int r, int V)
{
	if (L <= l && r <= R)
	{
		lazy[root] |= V;
		for (int i = 0; i < 22; i++) 
		{
			if ((V >> i) & 1) 
				val[root][i] = r - l + 1;
		}
		return;
	}
	pushdown(root, r - l + 1);
	int mid = (l + r) >> 1;
	if (L <= mid)
	{
		update(root << 1, L, R, l, mid, V);
	}
	if (R > mid)
	{
		update(root << 1 | 1, L, R, mid + 1, r, V);
	}
	pushup(root);
}
void query(int root, int L, int R, int l, int r)
{
	if (L <= l && r <= R)
	{
		for (int i = 0; i < 22; i++)
		{
			ans += ((LL)val[root][i] << i);//这步要注意，不能用int，会超数据范围 
		}
		return;
	}
	pushdown(root, r - l + 1);
	int mid = (l + r) >> 1;
	if (L <= mid)
	{
		query(root << 1, L, R, l, mid);
	}
	if (R > mid)
	{
		query(root << 1 | 1, L, R, mid + 1, r);
	}
	pushup(root);
}
int main()
{
	while (scanf("%d%d", &n, &m) != EOF)
	{
		memset(val, 0, sizeof(val));
		memset(lazy, 0, sizeof(lazy));
		build(1, 1, n);
		for (int i = 1; i <= m; i++)
		{
			char op[10];
			scanf(" %s", op);
			if (op[0] == 'S')
			{
				int a, b;
				ans = 0;
				scanf("%d%d", &a, &b);
				query(1, a, b, 1, n);
				printf("%lld\n", ans);
			}
			else
			{
				int a, b, c;
				scanf("%d%d%d", &a, &b, &c);
				update(1, a, b, 1, n, c);
			}
		}
	}


	return 0;
}