Submission #970543

#	Time	Username	Problem	Language	Result	Execution time	Memory
970543		mychecksedad	Snake Escaping (JOI18_snake_escaping)	C++17	75 / 100	2033 ms	32500 KiB

snake_escaping

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 2e6+100, M = 1e5+10, K = 13, MX = 30;

int n, q, dp[N];
string s;
void solve(){
  cin >> n >> q >> s;
  for(int i = 0; i < (1<<n); ++i) dp[i] = s[i] - '0';
  for(int i = 0; i < n; ++i){
    for(int mask = 0; mask < (1<<n); ++mask){
      if(((1<<i)&mask) == 0) dp[mask] += dp[(1<<i) ^ mask];
    }
  }
  for(int i = 0; i < q; ++i){
    string t; cin >> t;
    int A = 0, B = 0, C = 0;
    for(int j = 0; j < n; ++j){
      if(t[n-j-1] == '0') A += (1<<j);
      if(t[n-j-1] == '1') B += (1<<j);
      if(t[n-j-1] == '?') C += (1<<j);
    }
    if(__builtin_popcount(C) <= 6){
      int ans = 0;
      for(int S = C; S > 0; S = (S-1)&C){
        ans += s[S | B] - '0';
      }
      ans += s[B] - '0';
      cout << ans << '\n';
    }else{
      int ans = 0;
      for(int S = A; S > 0; S = (S-1)&A){
        ans += dp[B | S] * (__builtin_popcount(S) % 2 == 0 ? 1 : -1);
      }
      ans += dp[B];
      cout << ans << '\n';
    }
  }

}



int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  // cin >> tt;
  while(tt--){
    solve();
    // en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

Compilation message (stderr)

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:53:15: warning: unused variable 'aa' [-Wunused-variable]
   53 |   int tt = 1, aa;
      |               ^~

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 10 / 10
• Subtask 4: 53 / 53
• Subtask 5: 0 / 25