# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
447260 |
2021-07-25T15:26:10 Z |
bigo |
XORanges (eJOI19_xoranges) |
C++14 |
|
1000 ms |
4076 KB |
#include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef unsigned long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<int>vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
while (q--) {
int op;
cin >> op;
if (op == 1) {
int i, j;
cin >> i >> j;
vec[i - 1] = j;
}
else {
int l, r;
cin >> l >> r;
l--; r--;
if ((r - l + 1) % 2 == 0)
cout << 0 << endl;
else {
int ans = 0;
for (int i = l; i <= r; i+=2) {
ans ^= vec[i];
}
cout << ans << endl;
}
}
}
}
# |
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 |
Correct |
2 ms |
204 KB |
Output is correct |
2 |
Correct |
2 ms |
204 KB |
Output is correct |
3 |
Correct |
2 ms |
204 KB |
Output is correct |
4 |
Correct |
2 ms |
204 KB |
Output is correct |
5 |
Correct |
2 ms |
204 KB |
Output is correct |
# |
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 |
6 |
Correct |
2 ms |
204 KB |
Output is correct |
7 |
Correct |
2 ms |
204 KB |
Output is correct |
8 |
Correct |
2 ms |
204 KB |
Output is correct |
9 |
Correct |
2 ms |
204 KB |
Output is correct |
10 |
Correct |
2 ms |
204 KB |
Output is correct |
11 |
Correct |
14 ms |
508 KB |
Output is correct |
12 |
Correct |
12 ms |
440 KB |
Output is correct |
13 |
Correct |
20 ms |
428 KB |
Output is correct |
14 |
Correct |
21 ms |
440 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1089 ms |
4076 KB |
Time limit exceeded |
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 |
6 |
Correct |
2 ms |
204 KB |
Output is correct |
7 |
Correct |
2 ms |
204 KB |
Output is correct |
8 |
Correct |
2 ms |
204 KB |
Output is correct |
9 |
Correct |
2 ms |
204 KB |
Output is correct |
10 |
Correct |
2 ms |
204 KB |
Output is correct |
11 |
Correct |
14 ms |
508 KB |
Output is correct |
12 |
Correct |
12 ms |
440 KB |
Output is correct |
13 |
Correct |
20 ms |
428 KB |
Output is correct |
14 |
Correct |
21 ms |
440 KB |
Output is correct |
15 |
Execution timed out |
1089 ms |
4076 KB |
Time limit exceeded |
16 |
Halted |
0 ms |
0 KB |
- |