# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
344188 | Nurlykhan | Intergalactic ship (IZhO19_xorsum) | C++17 | 2072 ms | 1900 KiB |
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;
const int N = (int)1e5 + 10;
const int mod = (int)1e9 + 7;
int n, q;
int a[N], b[N];
int l[N], r[N], x[N], xr[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++)
scanf("%d%d%d", &l[i], &r[i], &x[i]);
int ans = 0;
for (int i = 0; i < (1 << q); i++) {
for (int j = 0; j < q; j++) {
xr[j] = 0;
}
for (int j = 0; j < q; j++) {
if ((i >> j) % 2) {
xr[l[j]] ^= x[j];
xr[r[j] + 1] ^= x[j];
}
}
for (int i = 1; i <= n; i++) {
xr[i] ^= xr[i - 1];
b[i] = a[i] ^ xr[i];
}
for (int i = 1; i <= n; i++) {
int s = 0;
for (int j = i; j <= n; j++) {
s += b[j];
(ans += (s * 1ll * s) % mod) %= mod;
}
}
}
cout << ans;
return 0;
}
Compilation message (stderr)
# | 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... |