Submission #1103975

#	Time	Username	Problem	Language	Result	Execution time	Memory
1103975		vjudge1	Snake Escaping (JOI18_snake_escaping)	C++17	100 / 100	558 ms	65536 KiB

snake_escaping

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numSnake, numQuery;
string label;
string s[MASK(20) + 5];


int dp_on[MASK(20) + 5], dp_off[MASK(20) + 5];
void process(void){
    cin >> numSnake >> numQuery >> label;
    #define cnt(x)                 __builtin_popcount(x)

    for (int mask = 0; mask < MASK(numSnake); ++mask){
        dp_on[mask] = label[mask] - '0';
        dp_off[(MASK(numSnake) - 1) ^ mask] = label[mask] - '0';
    }

    for (int i = 0; i < numSnake; ++i){
        for (int mask = 0; mask < MASK(numSnake); ++mask) if(!BIT(mask, i)){
            dp_on[mask]  += dp_on[mask ^ MASK(i)];
            dp_off[mask] += dp_off[mask ^ MASK(i)];
        }
    }


    for (int qu = 1; qu <= numQuery; ++qu){
        int on = 0, off = 0, ask = 0;
        string  s; cin >> s;
        for (int i = 0; i < numSnake; ++i){
            if(s[i] == '1') on  |= MASK(numSnake - i - 1);
            if(s[i] == '0') off |= MASK(numSnake - i - 1);
            if(s[i] == '?') ask |= MASK(numSnake - i - 1);
        }

        if(cnt(on) <= 6){
            int ans = dp_off[off];
            for (int sub = on; sub > 0; sub = (sub - 1) & on){
                if(cnt(sub) & 1){
                    ans -= dp_off[sub | off];
                }
                else{
                    ans += dp_off[sub | off];
                }
            }
            cout << ans << '\n';
            continue;
        }

        if(cnt(off) <= 6){
            int ans = dp_on[on];
            for (int sub = off; sub > 0; sub = (sub - 1) & off){
                if(cnt(sub) & 1){
                    ans -= dp_on[on | sub];
                }
                else{
                    ans += dp_on[on | sub];
                }
            }
            cout << ans << '\n';
            continue;
        }

        if(cnt(ask) <= 6){
            int ans = label[on] - '0';
            for (int sub = ask; sub > 0; sub = (sub - 1) & ask){
                ans += label[on | sub] - '0';
            }
            cout << ans << '\n';
        }
    }

}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

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