This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 101;
int n, a[N], q, l[N], r[N], x[N], pre[N];
ll ans;
int main(){
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
cin >> q;
for (int i = 0; i < q; ++i) {
cin >> l[i] >> r[i] >> x[i], --l[i], --r[i];
}
for (int i = 0; i < (1 << q); ++i) {
for (int j = 0; j < q; ++j) {
if (i & 1 << j) {
pre[l[j]] ^= x[j];
pre[r[j] + 1] ^= x[j];
}
}
for (int i = 1; i < n; ++i) pre[i] ^= pre[i - 1];
for (int i = 0; i < n; ++i) a[i] ^= pre[i];
int sum = 0;
for (int i = 0; i < n; ++i) {
int cur = 0;
for (int j = i; j < n; ++j) {
cur += a[j];
sum += cur * cur;
}
}
ans += sum;
for (int i = 0; i < n; ++i) {
a[i] ^= pre[i];
pre[i] = 0;
}
}
cout << ans << "\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... |
# | 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... |