# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
908534 | speedcode | XORanges (eJOI19_xoranges) | C++17 | 1061 ms | 6748 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,q;
cin >> n >> q;
long long values[n];
for(int i = 0; i < n; i++) cin >> values[i];
int index, l, k, typ;
long long res;
for(int _i = 0; _i < q; _i++){
cin >> typ;
if(typ==1){
int index;
cin >> index;
cin >> values[index-1];
} else {
cin >> l >> k;
res = 0;
if((l-k)%2 == 0){
for(int i = l-1; i < k; i+= 2){
res = res ^ values[i];
}
}
cout << res << '\n';
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |