Submission #364830

#	Time	Username	Problem	Language	Result	Execution time	Memory
364830		balbit	Snake Escaping (JOI18_snake_escaping)	C++14	100 / 100	1208 ms	21740 KiB

snake_escaping

#include <bits/stdc++.h>
#pragma GCC target ("popcnt")
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 1e5+5;

int A[1<<20|7], B[1<<20|7], F[1<<20|7];
bool poppar[1<<20|7];

signed main(){
    IOS();
    int n, q; cin>>n>>q;
    REP(i, 1<<n) {
        poppar[i] = __builtin_popcount(i) & 1;
    }
    int flip = (1<<n)-1;
    REP(i, 1<<n) {
        char c; cin>>c;
        F[i] = A[i] = B[i^flip] = c-'0';
    }
    REP(i, n) {
        REP(j, 1<<n) {
            if (j & (1<<i)) {
                A[j] += A[j^(1<<i)];
                B[j] += B[j^(1<<i)];
            }
        }
    }
//    bug(A[6]);
    while (q--) {
        string s; cin>>s;
        reverse(ALL(s));
        int a,b,c; a=b=c=0;
        for( char ch : s) {
            if (ch == '?') ++c;
            if (ch == '1') ++a;
            if (ch == '0') ++b;
        }
        int mn = min({a,b,c});
        int re = 0;
        if (mn == c) {
            int msk = 0;
            int base = 0;
            REP(i, n) {
                if (s[i] == '?') msk += 1<<i;
                if (s[i] == '1') base+= 1<<i;
            }
            int org = msk;
            for (;;msk = (msk-1) & (org)) {
                re += F[base | msk];
                if(msk == 0) break;
            }
        }else {
            int *U = min(a,b) == a? A:B;
            if (min(a,b) != a) {
                for (char &ch : s) {
                    if (ch != '?') ch = ch=='1'?'0':'1';
                }
            }
            int msk = 0;
            int base = 0;
            REP(i,n) {
                if (s[i] == '1') msk += 1<<i;
                if (s[i] == '?') base+= 1<<i;
            }
            bug(msk, base, min(a,b) == a);
            int org = msk;
            for (; ; msk = (msk - 1) & org) {
                re += (poppar[msk^org])?-U[msk|base]:U[msk|base];
                if (msk == 0) break;
            }
        }
        cout<<re<<endl;
    }
}

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