#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1005;
const int MAX_Q = 1e5 + 5;
const int MOD = 1e9 + 7;
int A[MAX_N];
int L[MAX_Q], R[MAX_Q], X[MAX_Q];
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int N;
cin >> N;
for(int i = 1; i <= N; i++) {
cin >> A[i];
}
int Q;
cin >> Q;
for(int i = 0; i < Q; i++) {
cin >> L[i] >> R[i] >> X[i];
}
long long ans = 0;
for(int mask = 0; mask < (1<<Q); mask++) {
for(int q = 0; q < Q; q++) {
if(mask & (1<<q)) {
for(int i = L[q]; i <= R[q]; i++) {
A[i] ^= X[q];
}
}
}
for(int i = 1; i <= N; i++) {
long long sum = 0;
for(int j = i; j <= N; j++) {
sum += A[j];
sum %= MOD;
ans += sum * sum;
ans %= MOD;
}
}
for(int q = 0; q < Q; q++) {
if(mask & (1<<q)) {
for(int i = L[q]; i <= R[q]; i++) {
A[i] ^= X[q];
}
}
}
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
22 ms |
340 KB |
Output is correct |
7 |
Correct |
23 ms |
328 KB |
Output is correct |
8 |
Correct |
21 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
17 ms |
2260 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2075 ms |
340 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2058 ms |
340 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2058 ms |
340 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
22 ms |
340 KB |
Output is correct |
7 |
Correct |
23 ms |
328 KB |
Output is correct |
8 |
Correct |
21 ms |
212 KB |
Output is correct |
9 |
Execution timed out |
2058 ms |
340 KB |
Time limit exceeded |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
22 ms |
340 KB |
Output is correct |
7 |
Correct |
23 ms |
328 KB |
Output is correct |
8 |
Correct |
21 ms |
212 KB |
Output is correct |
9 |
Execution timed out |
2058 ms |
340 KB |
Time limit exceeded |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
22 ms |
340 KB |
Output is correct |
7 |
Correct |
23 ms |
328 KB |
Output is correct |
8 |
Correct |
21 ms |
212 KB |
Output is correct |
9 |
Incorrect |
17 ms |
2260 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |