2020CCPC河南省赛二进制与、平方和

看见线段树题，先看是不是区间修改，然后看看能否转化为单点修改，用懒标记实在太难调，可以转化的题我现在遇到的就是可以在线段树存差分数组实现区间加法的单点修改，这道题是本身区间可能就不用去修改。

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MOD = 998244353;
const int N = 3e5 + 10;
struct Node {
	int l, r, sum;
	int mh[25];
}tr[N*4];
int a[N];
int n, m;
void pushup(int u)
{
	tr[u].sum = ((LL)tr[u << 1].sum + tr[u << 1 | 1].sum) % MOD;
	for (int i = 0; i < 25; i++)
	{
		tr[u].mh[i] = tr[u << 1].mh[i] + tr[u << 1 | 1].mh[i];
	}
}
void build(int u, int l, int r)
{
	if(l == r)
	{
		tr[u].sum = (LL)a[l] * a[l]%MOD;
		int x = a[l];
		tr[u].l = l, tr[u].r = r;
		for (int i = 0; i < 25; i++)
		{
			tr[u].mh[i] = (x >> i & 1);
		}
	}
	else
	{
		int mid = (l + r) >> 1;
		tr[u].l = l, tr[u].r = r;
		build(u << 1, l, mid); build(u << 1 | 1, mid + 1, r);
		pushup(u);
	}
}
int query(int u, int l, int r)
{
	if (tr[u].l >= l&&tr[u].r <= r) return tr[u].sum;
	int mid = tr[u].l + tr[u].r >> 1;
	int res = 0;
	if (l<=mid)res = query(u << 1, l, r);
	if (r>mid)res = ((LL)res + query(u << 1 | 1, l, r)) % MOD;
	return res;
}
void modify(int u, int l, int r, int x)
{
	if (tr[u].l == tr[u].r)
	{
		int sum = 0;
		for (int i = 0; i < 25; i++)
		{
			if (tr[u].mh[i] && x >> i & 1)
				sum |= 1 << i;
			else
				tr[u].mh[i] = 0;
		}
		tr[u].sum = (LL)sum*sum%MOD;
		return;
	}
	 if (tr[u].l >= l && tr[u].r <= r)
	{
		bool flag = true;
		for (int i = 0; i < 25; i++)
		{
			if (tr[u].mh[i] && (x >> i & 1) == 0) {
				flag = false;
				break;
			}
		}
		if (flag) return;
	}
	int mid = tr[u].l + tr[u].r >> 1;
	  if (l<=mid)modify(u << 1, l,r, x); 
	  if (r > mid) modify(u << 1 | 1, l, r, x);
	pushup(u);
}
 int main()
{
	 scanf("%d", &n);
	 for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	 build(1, 1, n);
	 scanf("%d", &m);

	 while (m--)
	 {
		 int p,l, r, x;
		 scanf("%d%d%d", &p, &l, &r);
		 if (p == 1)
		 {
			 scanf("%d", &x);
			 modify(1, l, r, x);
		 }
		 else
		 {
			 printf("%d\n", query(1, l, r));
		 }
	 }
	return 0;
}