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>
#define endl '\n'
#define ll long long
using namespace std;
const long long MAXN = 500;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
long long n, m;
long long a[MAXN], aa[MAXN];
long long ql[MAXN], qr[MAXN], xx[MAXN];
long long mod = 1e9 + 7, total = 0;
void apply(long long subset)
{
for (long long i = 1; i <= n; ++ i)
aa[i] = a[i];
for (long long i = 0; i < m; ++ i)
{
if((1 << i) & subset)
{
for (long long j = ql[i]; j <= qr[i]; ++ j)
aa[i] = (aa[i] ^ xx[i]);
}
}
long long ans = 0;
for (long long i = 1; i <= n; ++ i)
{
long long current = 0;
for (long long j = i; j <= n; ++ j)
{
current += aa[j];
current %= mod;
ans += current * current;
ans %= mod;
}
}
total += ans;
total %= mod;
}
void read()
{
cin >> n;
for (long long i = 1; i <= n; ++ i)
{
cin >> a[i];
}
long long pow = 1;
cin >> m;
for (long long i = 0; i < m; ++ i)
{
pow *= 2;
cin >> ql[i] >> qr[i] >> xx[i];
}
for (long long i = 0; i < pow; ++ i)
{
apply(i);
}
cout << total% mod << endl;
}
int main()
{
speed();
read();
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... |