# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1048894 | Nickpapadak | XORanges (eJOI19_xoranges) | C++14 | 1066 ms | 3932 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;
const unsigned int MAXN = 2e+5 + 10;
int pf[MAXN], a[MAXN];
int N, Q;
int main(){
scanf("%d%d",&N,&Q);
for(int i = 1; i<=N;++i){
scanf("%d",&a[i]);
pf[i] = pf[i-1] ^ a[i];
}
while(Q--){
int a,b, type;
scanf("%d%d%d", &type, &a, &b);
if(type == 2){
int ans = 0;
for(int i = 1; i <= b; ++i){
for(int j = a; j+i-1 <= b;++j){
ans ^= (pf[j+i-1] ^ pf[j-1]);
}
}
printf("%d\n", ans);
}
}
return 0;
}
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... |