#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
int D0[1 << 20];
int D1[1 << 20];
char str[1 << 20];
int coef[1 << 20];
int main(void)
{
int n,q;
cin>>n>>q>>str;
const int N = 1 << n;
for (int i = 0;i < N;++i)
str[i] -= '0';
for (int i = 0;i < N;++i)
coef[i] = __builtin_popcount(i) & 1 ? -1 : 1;
for (int i = 0;i < N;++i)
D0[i] = D1[i] = str[i];
for (int i = 0;i < n;++i)
for (int mask = 0;mask < N;++mask)
if ((mask >> i) & 1)
D0[mask ^ (1 << i)] += D0[mask];
else
D1[mask ^ (1 << i)] += D1[mask];
while (q --) {
string s;
cin>>s;
reverse(all(s));
dbg(s);
int a = 0,b = 0,c = 0;
int la = 0,lb = 0,lc = 0;
for (int i = 0;i < n;++i) {
if (s[i] == '0')
a |= 1 << i,++la;
else
if (s[i] == '1')
b |= 1 << i,++lb;
else
c |= 1 << i,++lc;
}
int ans = 0;
if (la <= lb && la <= lc) {
for (int mask = a;mask >= 0;mask = !mask ? -1 : ((mask - 1) & a))
ans += coef[mask] * D0[(N - 1) ^ mask ^ c];
} else
if (lb <= la && lb <= lc) {
for (int mask = b;mask >= 0;mask = !mask ? -1 : ((mask - 1) & b))
ans += coef[mask] * D1[mask ^ c];
} else {
for (int mask = c;mask >= 0;mask = !mask ? -1 : ((mask - 1) & c))
ans += str[mask ^ b];
}
ans = abs(ans);
cout << ans << '\n';
}
return 0;
}
Compilation message
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:31:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for (int i = 0;i < n;++i)
^~~
snake_escaping.cpp:37:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
while (q --) {
^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
10 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
10 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
10 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
10 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
10 ms |
376 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
