| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1278658 | wedonttalkanymore | Snake Escaping (JOI18_snake_escaping) | C++20 | 1655 ms | 34320 KiB | 
#include <bits/stdc++.h>
/*
    Wake up, I'm wake up
    Thu sang roi, em thay khong?
*/
using namespace std;
using ll = long long;
#define int long long
#define pii pair<ll, ll>
#define fi first
#define se second
const ll N = 2e5 + 5, inf = 1e18, mod = 1e9 + 7, block = 320, lim = 20;
int L, q, n;
string s;
int submask[1 << lim], supermask[1 << lim], sum[1 << lim];
void solve(string t) {
    int sz = t.size();
    reverse(t.begin(), t.end());
    int cnt0 = 0, cnt1 = 0, cntx = 0;
    int mask0 = 0, mask1 = 0, maskx = 0;
    for (int i = 0; i < sz; i++) {
        if (t[i] == '0') cnt0++, mask0 |= (1 << i);
        if (t[i] == '1') cnt1++, mask1 |= (1 << i);
        if (t[i] == '?') cntx++, maskx |= (1 << i);
    }
    if (cntx <= 6) {
        int res = 0;
        for (int sub = maskx; ; sub = (sub - 1) & maskx) {
            res += sum[mask1 | sub];
            if (sub == 0) break;
        }
        cout << res << '\n';
    }
    else if (cnt0 <= 6) {
        int res = 0;
        for (int sub = mask0; ; sub = (sub - 1) & mask0) {
            int tt = __builtin_popcountll(sub);
            if (tt % 2 == 0) res += supermask[sub | mask1];
            else res -= supermask[sub | mask1];
            if (sub == 0) break;
        }
        cout << res << '\n';
    }
    else {
        int res = 0;
        for (int sub = mask1; ; sub = (sub - 1) & mask1) {
            int tt = __builtin_popcountll(sub);
            int remain = cnt1 - tt;
            int sign = (remain % 2 == 0) ? 1 : -1;
            res += sign * submask[maskx | sub];
            if (sub == 0) break;
        }
        cout << res << '\n';
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    if (fopen(".inp", "r")) {
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }
    cin >> L >> q >> s;
    n = s.size();
    int allmask = 1 << L;
    for (int i = 0; i < allmask; i++) {
        sum[i] = submask[i] = supermask[i] = s[i] - '0';
    }
    for (int i = 0; i < L; i++) {
        for (int mask = 0; mask < allmask; mask++) {
            if (mask & (1 << i)) submask[mask] += submask[mask ^ (1 << i)];
        }
    }
    for (int i = 0; i < L; i++) {
        for (int mask = 0; mask < allmask; mask++) {
            if (!(mask & (1 << i))) supermask[mask] += supermask[mask | (1 << i)];
        }
    }
    for (int i = 1; i <= q; i++) {
        string t;
        cin >> t;
        solve(t);
    }
    return 0;
}
Compilation message (stderr)
| # | 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... | ||||
