| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1219211 | mariamp1 | XORanges (eJOI19_xoranges) | C++20 | 1094 ms | 2104 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
while (q--) {
int type;
cin >> type;
if (type == 1) {
int i, x;
cin >> i >> x;
a[i - 1] = x;
} else {
int l, r;
cin >> l >> r;
l--, r--;
int result = 0;
for (int i = l; i <= r; ++i) {
int count = (i - l + 1) * (r - i + 1);
if (count % 2 == 1)
result ^= a[i];
}
cout << result << '\n';
}
}
return 0;
}| # | 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... | ||||
