Submission #466144

# Submission time Handle Problem Language Result Execution time Memory
466144 2021-08-18T06:29:31 Z Stickfish XORanges (eJOI19_xoranges) C++17
0 / 100
1000 ms 2128 KB
#include <iostream>
using namespace std;

const int MAXN = 2e5 + 123;
int a[MAXN];

signed main(){
	int n, q;
	cin >> n >> q;
	for(int i = 0; i < n; ++i){
		cin >> a[i];
	}
	while(q--){
		int t;
		cin >> t;
		if(t == 1){
			int i, x;
			cin >> i >> x;
			--i;
			a[i] = x;
		} else {
			int l, r;
			cin >> l >> r;
			--l;
			if((r - l) % 2){
				cout << 0 << '\n';
				continue;
			}
			int ans = 0;
			for(int i = l; i < r; i += 2){
				ans ^= a[i];
			}
			cout << ans << '\n';
		}
	}
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 2128 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -