# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
445564 | 2021-07-18T17:09:28 Z | aris12345678 | XORanges (eJOI19_xoranges) | C++14 | 1000 ms | 3220 KB |
#include <bits/stdc++.h> using namespace std; const int mxN = 2*1e5+5; int a[mxN]; int main() { int n, q; scanf("%d %d", &n, &q); for(int i = 0; i < n; i++) scanf("%d", &a[i]); while(q--) { int type, l, r; scanf("%d %d %d", &type, &l, &r); if(type == 1) a[l-1] = r; else { int ans = 0; for(int i = l-1; i < r; i++) { int res = 0; for(int j = i; j < r; j++) { res ^= a[j]; ans ^= res; } } printf("%d\n", ans); } } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | 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 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 308 KB | Output is correct |
2 | Correct | 10 ms | 204 KB | Output is correct |
3 | Correct | 10 ms | 312 KB | Output is correct |
4 | Correct | 33 ms | 204 KB | Output is correct |
5 | Correct | 32 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | 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 |
6 | Correct | 8 ms | 308 KB | Output is correct |
7 | Correct | 10 ms | 204 KB | Output is correct |
8 | Correct | 10 ms | 312 KB | Output is correct |
9 | Correct | 33 ms | 204 KB | Output is correct |
10 | Correct | 32 ms | 204 KB | Output is correct |
11 | Execution timed out | 1080 ms | 440 KB | Time limit exceeded |
12 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1085 ms | 3220 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | 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 |
6 | Correct | 8 ms | 308 KB | Output is correct |
7 | Correct | 10 ms | 204 KB | Output is correct |
8 | Correct | 10 ms | 312 KB | Output is correct |
9 | Correct | 33 ms | 204 KB | Output is correct |
10 | Correct | 32 ms | 204 KB | Output is correct |
11 | Execution timed out | 1080 ms | 440 KB | Time limit exceeded |
12 | Halted | 0 ms | 0 KB | - |