# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1048894 | 2024-08-08T10:30:40 Z | Nickpapadak | XORanges (eJOI19_xoranges) | C++14 | 1000 ms | 3932 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 348 KB | Output is correct |
2 | Correct | 6 ms | 348 KB | Output is correct |
3 | Correct | 7 ms | 348 KB | Output is correct |
4 | Correct | 27 ms | 460 KB | Output is correct |
5 | Correct | 27 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1066 ms | 3932 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |