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 sz(x) ((int)x.size())
#define a3 array<int, 3>
using namespace std;
const int N = (1 << 20);
const int oo = 2e9;
int a[N], need, m, ans = 0;
bool par[N];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef _LOCAL
freopen("in.txt","r",stdin);
#endif // _LOCAL
cin >> m;
for (int i = 0; i < (1 << m); i++)
cin >> a[i];
need = (1 << m) - 1;
for (int l = 0; l < (1 << m); l++){
int xr = 0;
fill(par, par + (1 << m), 0);
int kol = 0;
for (int r = l; r < (1 << m); r++){
xr ^= a[r];
par[a[r]] = 1;
if (par[need - a[r]])
kol--;
else kol++;
if (xr == need){
if (r - l + 3 <= (1 << m) || (r - l + 1 > 1))
ans++;
} else {
if (kol > 0)
ans++;
}
}
}
cout << ans;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |