Submission #490805

#TimeUsernameProblemLanguageResultExecution timeMemory
490805vulpesXORanges (eJOI19_xoranges)C++17
55 / 100
27 ms4928 KiB
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 7; int a[N], t[N][2]; void build(int v, int l, int r) { if (l == r) { t[v][0] = (1 - l % 2) * a[l]; t[v][1] = (l % 2) * a[l]; return; } int m = (l + r) / 2; build(2 * v, l, m); build(2 * v + 1, m + 1, r); t[v][0] = t[2 * v][0] ^ t[2 * v + 1][0]; t[v][1] = t[2 * v][1] ^ t[2 * v + 1][1]; } void upd(int v, int l, int r, int x) { if (x > r || x < l) { return; } if (l == r) { t[v][0] = (1 - l % 2) * a[l]; t[v][1] = (l % 2) * a[l]; return; } int m = (l + r) / 2; upd(2 * v, l, m, x); upd(2 * v + 1, m + 1, r, x); t[v][0] = t[2 * v][0] ^ t[2 * v + 1][0]; t[v][1] = t[2 * v][1] ^ t[2 * v + 1][1]; } int calc(int v, int l, int r, int L, int R) { if (L > r || l > R) { return 0; } if (L <= l && r <= R) { return t[v][L % 2]; } int m = (l + r) / 2; return calc(2 * v, l, m, L, R) ^ calc(2 * v + 1, m + 1, r, L, R); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, q; cin >> n >> q; for (int i = 1; i <= n; i++) { cin >> a[i]; } build(1, 1, n); while (q--) { int x, y, z; cin >> x >> y >> z; if (x == 1) { a[y] = z; upd(1, 1, n, y); continue; } int f = (z - y + 1) % 2; cout << f * calc(1, 1, n, y, z) << endl; } }
#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...