제출 #1235333

#제출 시각아이디문제언어결과실행 시간메모리
1235333GoBananas69XORanges (eJOI19_xoranges)C++20
55 / 100
1095 ms2056 KiB
#include <algorithm> #include <iostream> #include <vector> typedef long long ll; using namespace std; int main() { cin.tie(0)->sync_with_stdio(0); int n, q; cin >> n >> q; vector<int> nums(n); for (int &i : nums) cin >> i; while (q--) { int type; cin >> type; if (type == 1) { int p, v; cin >> p >> v; --p; nums[p] = v; } else if (type == 2) { int l, r; cin >> l >> r; --l; --r; if (!((r - l + 1) & 1)) { cout << "0\n"; continue; } int res = 0; for (int i = l; i <= r; i += 2) { res ^= nums[i]; } cout << res << '\n'; } } }
#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...