#include <bits/stdc++.h>
#include <bits/extc++.h>
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
using namespace std;
using namespace __gnu_pbds;
#define orz
#ifdef orz
#define print(a...)cerr<<"Line "<<__LINE__<<":",kout("[" + string(#a) + "] = ", a)
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...); }
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
if(pvaspace) b << " "; pvaspace=true;\
b << pva;\
}\
b << "\n";}
#else
#define print(a...)
void kout() {}
template<class T1, class ... T2> void kout(T1 a, T2 ... e) {}
#define printv(a, b)
#endif
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;
const ll MOD = 1000000007;
const ll MAX = 2147483647;
template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
return o << '(' << p.F << ',' << p.S << ')';
}
ll ifloor(ll a, ll b){
if(b < 0) a *= -1, b *= -1;
if(a < 0) return (a - b + 1) / b;
else return a / b;
}
ll iceil(ll a, ll b){
if(b < 0) a *= -1, b *= -1;
if(a > 0) return (a + b - 1) / b;
else return a / b;
}
int main(){
StarBurstStream
int L, q;
cin >> L >> q;
int n = 1 << L;
string ts;
cin >> ts;
vector<int> a(n);
for(int i = 0; i < n; i++){
a[i] = ts[i] - '0';
}
vector<int> one(n), zero(n);
for(int i = 0; i < n; i++){
int tmp = 0;
for(int j = 0; j < L; j++){
if(1 << j & i) tmp |= 1 << j;
}
one[tmp] += a[i];
zero[((1 << L) - 1) ^ tmp] += a [i];
}
auto solvedp = [&](vector<int>& dp){
for(int i = 0; i < L; i++){
for(int j = 0; j < n; j++){
if(1 << i & j) continue;
dp[j] += dp[j ^ (1 << i)];
}
}
};
solvedp(zero);
solvedp(one);
auto solveq = [&](string& s){
int now = 0;
vector<int> pos;
for(int i = 0; i < L; i++){
if(s[i] == '?') pos.eb(i);
else if(s[i] == '1') now |= 1 << (L - 1 - i);
}
function<ll(int)> dfs = [&](int i){
if(i == pos.size()) return (ll)a[now];
int p = pos[i];
ll ans = 0;
if(s[p] == '1'){
now ^= 1 << (L - 1 - p);
ans += dfs(i + 1);
now ^= 1 << (L - 1 - p);
}
else if(s[p] == '0'){
ans += dfs(i + 1);
}
else{
ans += dfs(i + 1);
now ^= 1 << (L - 1 - p);
ans += dfs(i + 1);
now ^= 1 << (L - 1 - p);
}
return ans;
};
return dfs(0);
};
auto solve0 = [&](string& s){
int now = 0;
vector<int> pos;
for(int i = 0; i < L; i++){
if(s[i] == '0') pos.eb(i);
else if(s[i] == '1') now |= 1 << (L - 1 - i);
}
int cnt = 0;
function<ll(int)> dfs = [&](int i){
if(i == pos.size()) return (ll)one[now] * (cnt % 2 ? -1 : 1);
int p = pos[i];
ll ans = 0;
if(s[p] == '1'){
now ^= 1 << (L - 1 - p);
ans += dfs(i + 1);
now ^= 1 << (L - 1 - p);
}
else if(s[p] == '0'){
ans += dfs(i + 1);
now ^= 1 << (L - 1 - p);
cnt++;
ans += dfs(i + 1);
now ^= 1 << (L - 1 - p);
cnt--;
}
else{
ans += dfs(i + 1);
}
return ans;
};
return dfs(0);
};
auto solve1 = [&](string& s){
int now = 0;
int cnt = 0;
vector<int> pos;
for(int i = 0; i < L; i++){
if(s[i] == '1') pos.eb(i);
else if(s[i] == '0') now |= 1 << (L - 1 - i);
}
function<ll(int)> dfs = [&](int i){
if(i == pos.size()) return (ll)zero[now] * (cnt % 2 ? -1 : 1);
int p = pos[i];
ll ans = 0;
if(s[i] == '1'){
ans += dfs(i + 1);
now ^= 1 << (L - 1 - p);
cnt++;
ans += dfs(i + 1);
now ^= 1 << (L - 1 - p);
cnt--;
}
else if(s[i] == '0'){
now ^= 1 << (L - 1 - p);
ans += dfs(i + 1);
now ^= 1 << (L - 1 - p);
}
else{
ans += dfs(i + 1);
}
return ans;
};
return dfs(0);
};
while(q--){
string s;
cin >> s;
int o = 0, z = 0, qm = 0;
for(char i : s){
if(i == '0') z++;
else if(i == '1') o++;
else qm++;
}
int mn = min({o, z, qm});
ll ans = 0;
if(mn == z) ans = solve0(s);
else if(mn == o) ans = solve1(s);
else ans = solveq(s);
cout << ans << "\n";
}
return 0;
}
Compilation message
snake_escaping.cpp: In lambda function:
snake_escaping.cpp:120:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
120 | if(i == pos.size()) return (ll)a[now];
| ~~^~~~~~~~~~~~~
snake_escaping.cpp: In lambda function:
snake_escaping.cpp:150:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
150 | if(i == pos.size()) return (ll)one[now] * (cnt % 2 ? -1 : 1);
| ~~^~~~~~~~~~~~~
snake_escaping.cpp: In lambda function:
snake_escaping.cpp:182:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
182 | if(i == pos.size()) return (ll)zero[now] * (cnt % 2 ? -1 : 1);
| ~~^~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
