#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int B1 = 7;
const int B2 = 20-B1;
const int N1 = (1<<B1)+10;
const int N2 = (1<<B2)+2;
const int M1 = 2190;
const int M2 = 1594325;
vector<array<int,2>> v, w[N1];
string s;
bitset<N1+10> submask[M1];
int l, q, ans[M2], dp[M2];
int p3[] = {1,3,9,27,81,243,729,729*3,729*9};
int calc(string lol){
int p = 1, ans = 0, xd;
for(int i = 0; i < sz(lol); i++){
if(lol[i]=='?') xd=2;
else xd = lol[i]-'0';
ans+=xd*p, p*=3;
}
return ans;
}
int calc(int lol){
int p = 1, ans = 0;
while(lol){
int r = lol%2; lol/=2;
ans+=r*p; p*=3;
}
return ans;
}
int32_t main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> l >> q >> s;
for(int i = 0; i < M1; i++){
for(int j = 0; j < N1; j++){
int ok = 1, cur = i, cur2 = j;
for(int k = 0; k < B1; k++){
int t = cur%3, t2=cur2%2; cur/=3; cur2/=2;
if(t==2 or t==t2) continue; ok=0; break;
}
if(ok) submask[i][j]=1;
}
}
for(int mask = 0; mask < (1<<l); mask++){
int m1 = 0, m2 = mask;
if(l>B1) m1 = mask&((1<<B1)-1), m2>>=B1;
w[m1].pb({calc(m2),s[mask]-'0'});
}
for(int i = 0; i < q; i++){
string t; cin >> t;
reverse(all(t)); string x="";
if(l>B1) x = t.substr(0,B1),t=t.substr(B1);
v.pb({calc(x),calc(t)});
}
for(int _ = 0; _ < N1-9; _++){
memset(dp,0,sizeof(dp));
for(auto [xd,sc] : w[_]) dp[xd]=sc;
for(int j = 0; j < 7; j++)
for(int i = 0; i < M2; i++)
if((i/p3[j])%3==2) dp[i]+=dp[i-p3[j]]+dp[i-2*p3[j]];
for(int i = 0; i < q; i++){
auto [x,y] = v[i];
if(submask[x][_]) ans[i]+=dp[y];
}
}
for(int i = 0; i < q; i++) cout << ans[i] << "\n";
}
Compilation message
snake_escaping.cpp: In function 'int32_t main()':
snake_escaping.cpp:46:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
46 | if(t==2 or t==t2) continue; ok=0; break;
| ^~
snake_escaping.cpp:46:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
46 | if(t==2 or t==t2) continue; ok=0; break;
| ^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2063 ms |
8784 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2063 ms |
8784 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2063 ms |
8784 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2063 ms |
8784 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2063 ms |
8784 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
