| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1246292 | trinm01 | XORanges (eJOI19_xoranges) | C++20 | 1093 ms | 1864 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, q;
vector<int> a;
int bruteForce(int l, int r) {
int res = 0;
for (int i = l; i <= r; ++i) {
int xorSub = 0;
for (int j = i; j <= r; ++j) {
xorSub ^= a[j];
res ^= xorSub;
}
}
return res;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> q;
a.resize(n + 1);
for (int i = 1; i <= n; ++i) cin >> a[i];
while (q--) {
int type;
cin >> type;
if (type == 1) {
int i, x;
cin >> i >> x;
a[i] = x;
} else {
int l, r;
cin >> l >> r;
cout << bruteForce(l, r) << '\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... | ||||
