This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long
using namespace std;
ll o[200001];
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
ll n,m;
cin >> n >> m;
for (int i=0;i<n;i++) {
cin >> o[i];
}
int x,y,k;
ll sum=0;
for (int i=0;i<m;i++) {
cin >> x >> y >> k;
y--;
if (x == 1) {
o[y] = k;
} else {
if (k-y < 3 && k-y >= 2) {
sum = o[y+1];
for (int i=y+2;i<k-1;i++) {
sum^=o[i];
}
} else if (k-y < 2) {
sum = o[y];
for (int i=y+1;i<k;i++) {
sum^=o[i];
}
} else {
sum = o[y]^o[y+1]^o[k-2]^o[k-1];
}
cout << sum <<'\n';
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |