#include <iostream>
#include <vector>
#define int long long
using namespace std;
int v[1000001], s[5][1000001];
int32_t main() {
int n, q;
cin>>n>>q;
for(int i=1; i<=n; i++){
cin>>v[i];
s[i%2][i] = v[i];
}
if(n <= 5000){
for(int i=0; i<q; i++){
int t;
cin>>t;
if(t == 1){
int x, y;
cin>>x>>y;
v[x] = y;
}
else{
int x, y;
cin>>x>>y;
if(abs(x-y)%2 == 1){
cout<<0<<'\n';
}
else{
int sum=0;
for(;x<=y;x+=2)
sum^=v[x];
cout<<sum<<'\n';
}
}
}
}
else{
for(int i=2; i<=n; i++){
s[i%2][i] ^= s[i%2][i-2];
}
for(int h=0; h<q; h++){
int t, x, y;
cin>>t>>x>>y;
if(abs(x-y)%2 == 1){
cout<<0<<'\n';
continue;
}
int ans = s[y%2][y]^s[x%2][x-1]<<'\n';
cout<<ans<<'\n';
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
312 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
340 KB |
Output is correct |
2 |
Correct |
2 ms |
340 KB |
Output is correct |
3 |
Correct |
2 ms |
340 KB |
Output is correct |
4 |
Correct |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
312 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
2 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Correct |
2 ms |
340 KB |
Output is correct |
9 |
Correct |
2 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
10 ms |
468 KB |
Output is correct |
12 |
Correct |
13 ms |
564 KB |
Output is correct |
13 |
Correct |
14 ms |
560 KB |
Output is correct |
14 |
Correct |
14 ms |
468 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
459 ms |
7660 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
312 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
2 ms |
340 KB |
Output is correct |
7 |
Correct |
2 ms |
340 KB |
Output is correct |
8 |
Correct |
2 ms |
340 KB |
Output is correct |
9 |
Correct |
2 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
10 ms |
468 KB |
Output is correct |
12 |
Correct |
13 ms |
564 KB |
Output is correct |
13 |
Correct |
14 ms |
560 KB |
Output is correct |
14 |
Correct |
14 ms |
468 KB |
Output is correct |
15 |
Incorrect |
459 ms |
7660 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |