Submission #447260

#TimeUsernameProblemLanguageResultExecution timeMemory
447260bigoXORanges (eJOI19_xoranges)C++14
55 / 100
1089 ms4076 KiB
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef unsigned long long ll;
int main() {
	int n, q;
	cin >> n >> q;
	vector<int>vec(n);
	for (int i = 0; i < n; i++) {
		cin >> vec[i];
	}
	while (q--) {
		int op;
		cin >> op;
		if (op == 1) {
			int i, j;
			cin >> i >> j;
			vec[i - 1] = j;
		}
		else {
			int l, r;
			cin >> l >> r;
			l--; r--;
			if ((r - l + 1) % 2 == 0)
				cout << 0 << endl;
			else {
				int ans = 0;
				for (int i = l; i <= r; i+=2) {
					ans ^= vec[i];
				}
				cout << ans << endl;
			}
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...