# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445616 | 2021-07-19T04:49:08 Z | aris12345678 | XORanges (eJOI19_xoranges) | C++14 | 147 ms | 3036 KB |
#include <bits/stdc++.h> using namespace std; const int mxN = 2*1e5+5; int a[mxN], pref[mxN]; int main() { int n, q; scanf("%d %d", &n, &q); for(int i = 0; i < n; i++) { scanf("%d", &a[i]); if(i == 0 || i == 1) pref[i+1] = a[i]; else pref[i+1] = a[i]^pref[i-1]; } while(q--) { int type, l, r; scanf("%d %d %d", &type, &l, &r); if(type == 1) { for(int i = 0; i < n; i++) { if(i == 0 || i == 1) pref[i+1] = a[i]; else pref[i+1] = a[i]^pref[i-1]; } } else { if(l%2 != r%2) printf("0\n"); else printf("%d\n", pref[r]^pref[l]^a[l-1]); } } return 0; }
Compilation message
# | 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 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
# | 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 | Correct | 116 ms | 3008 KB | Output is correct |
2 | Correct | 147 ms | 3036 KB | Output is correct |
3 | Correct | 109 ms | 2928 KB | Output is correct |
4 | Correct | 106 ms | 2952 KB | Output is correct |
5 | Correct | 102 ms | 2924 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |