Submission #929229

#TimeUsernameProblemLanguageResultExecution timeMemory
929229bambaaXORanges (eJOI19_xoranges)C++14
0 / 100
435 ms7868 KiB
#include <bits/stdc++.h> #include <iostream> #include <set> #include <cmath> #include <iterator> #include <vector> #define ff first #define ss second #define mp make_pair #define ll long long using namespace std; int main() { int n, q; cin >> n >> q; int a[n]; for (int i = 0; i < n; i++){ cin >> a[i]; } for (int lol = 0; lol < q; lol++){ int x, y, z; cin >> x >> y >> z; if (x == 1) {a[y - 1] = z;} else { if (z == y) cout << a[y - 1] << endl; if (z - y == 1) cout << "0" << endl; if (z - y == 2) cout << (a[y - 1] ^ a[z - 1]) << endl; if (z - y >= 3) cout << (((a[y - 1] ^ a[y]) ^ a[z - 2]) ^ a[z - 1]) << 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...