Submission #838135

#TimeUsernameProblemLanguageResultExecution timeMemory
838135BlockOGXORanges (eJOI19_xoranges)C++14
0 / 100
1056 ms1616 KiB
#include <iostream> using namespace std; int main() { int n, q; cin >> n >> q; unsigned int o[n]; for (int i = 0; i < n; i++) cin >> o[i]; for (int it = 0; it < q; it++) { int code; cin >> code; if (code == 1) { int i; cin >> i >> o[--i]; } else { int l, u; cin >> l >> u; if (!((u - l + 1) & 1)) continue; unsigned int res = 0; for (int i = l - 1; i < u; i += 2) res ^= o[i]; cout << res << 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...