Submission #229732

#TimeUsernameProblemLanguageResultExecution timeMemory
229732CoderXORanges (eJOI19_xoranges)C++14
55 / 100
1093 ms2176 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pii; #define SZ(x) (int)(x.size()) #define F0(i,n) for(int i=0;i<n;i++) #define F1(i,n) for(int i=1;i<=n;i++) #define CL(a,x) memset(x, a, sizeof(x)); #define PR(x) cerr << #x << "=" << (x) << endl; const int inf = 1000000009; const double pi = atan(1.0)*4.0; const double eps = 1e-8; const int N = 200001; int i, j, k, m, n; int a[N]; int main() { //freopen("x.in", "r", stdin); int q, t; cin >> n >> q; F1(i, n) cin >> a[i]; while (q--) { cin >> t >> i >> j; if (t == 1) { a[i] = j; } else { int len = j - i + 1; int ret = 0; if (len % 2) { for (int L = i; L <= j; L += 2) { ret ^= a[L]; } } cout << ret << endl; } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...