#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin >> n >> q;
int a[n + 1], b[n + 1][n + 1] {};
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
for(int k = i; k <= i + j - 1; k++) {
b[i][j] = (b[i][j] ^ a[k]);
}
}
}
if(n <= 100) {
while(q--) {
int t, l, r;
cin >> t >> l >> r;
if(t == 1) {
a[l] = r;
} else {
int S = a[l];
for(int i = l + 1; i <= r; i++) {
S = (S ^ a[i]);
}
for(int i = 2; i <= r - l + 1; i++) {
for(int j = l; j <= r - i + 1; j++) {
int A = 0;
for(int k = j; k <= j + i - 1; k++) {
A = (A ^ a[k]);
}
S = (S ^ A);
}
}
cout << S << '\n';
}
}
} else if(n <= 500) {
while(q--) {
int t, l, r;
cin >> t >> l >> r;
int S = 0;
for(int i = 1; i <= r - l + 1; i++) {
for(int j = l; j <= r - i + 1; j++) {
S = (S ^ b[j][i]);
}
}
cout << S << '\n';
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
4 ms |
488 KB |
Output is correct |
5 |
Correct |
4 ms |
492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
49 ms |
1412 KB |
Output is correct |
2 |
Correct |
48 ms |
1412 KB |
Output is correct |
3 |
Correct |
50 ms |
1372 KB |
Output is correct |
4 |
Correct |
78 ms |
1368 KB |
Output is correct |
5 |
Runtime error |
41 ms |
2384 KB |
Execution killed with signal 11 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
4 ms |
488 KB |
Output is correct |
5 |
Correct |
4 ms |
492 KB |
Output is correct |
6 |
Correct |
49 ms |
1412 KB |
Output is correct |
7 |
Correct |
48 ms |
1412 KB |
Output is correct |
8 |
Correct |
50 ms |
1372 KB |
Output is correct |
9 |
Correct |
78 ms |
1368 KB |
Output is correct |
10 |
Runtime error |
41 ms |
2384 KB |
Execution killed with signal 11 |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
36 ms |
65536 KB |
Execution killed with signal 9 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
4 ms |
488 KB |
Output is correct |
5 |
Correct |
4 ms |
492 KB |
Output is correct |
6 |
Correct |
49 ms |
1412 KB |
Output is correct |
7 |
Correct |
48 ms |
1412 KB |
Output is correct |
8 |
Correct |
50 ms |
1372 KB |
Output is correct |
9 |
Correct |
78 ms |
1368 KB |
Output is correct |
10 |
Runtime error |
41 ms |
2384 KB |
Execution killed with signal 11 |
11 |
Halted |
0 ms |
0 KB |
- |