异或橙子38求条

#include <bits/stdc++.h>
using namespace std;
int tji[114514], tou[114514], n, a[114514];
int lowbit (int x)
{
	return x & -x;
}
void cmppji (int x, int y)
{
	for (int i = x; i <= n; i += lowbit (i)) tji[i] ^= y;
}
int cmpppji (int x, int y)
{
	int ans = 0;
	for (int i = x - 1; i >= 1; i -= lowbit (i)) ans ^= tji[i];
	for (int i = y; i >= 1; i -= lowbit (i)) ans ^= tji[i];
	return ans;
}
void cmppou (int x, int y)
{
	for (int i = x; i <= n; i += lowbit (i)) tou[i] ^= y;
}
int cmpppou (int x, int y)
{
	int ans = 0;
	for (int i = x - 1; i >= 1; i -= lowbit (i)) ans ^= tou[i];
	for (int i = y; i >= 1; i -= lowbit (i)) ans ^= tou[i];
	return ans;
}
int main()
{
	int q;
	cin >> n >> q;
	for (int i = 1; i<= n; i ++)
	{
		cin >> a[i];
		int x = a[i];
		if (i & 1) cmppji (i, x);
		else cmppou (i, x);
	}
	for (int i = 1; i<= q; i ++){
		int x, y, z;
		cin >> x >> y >> z;
		if (x == 1)
		{
			if (y & 1)cmppji (z, a[y] ^ z);
			else cmppou (z, a[y] ^ z);
			a[y] = z;
		}
		else{
			if ((y + z) & 1) cout << "0\n";
			else
			{
				if (y & 1) cout << cmpppji(y, z);
				else cout << cmpppou (y, z);
				cout << endl;
			}
		}
	}
	return 0;
}