Submission #1098876

#	Time	Username	Problem	Language	Result	Execution time	Memory
1098876		steveonalex	Snake Escaping (JOI18_snake_escaping)	C++17	22 / 100	334 ms	19984 KiB

snake_escaping

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
 
 
int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();
 
    int l, q; cin >> l >> q;
    string s; cin >> s;
 
    int sum1[MASK(l)], sum2[MASK(l)];
    memset(sum1, 0, sizeof sum1);
    for(int i= 0; i<MASK(l); ++i){
        sum1[i] = s[i] - '0';
        sum2[i] = s[i] - '0';
    }
 
    for(int j = 0; j < l; ++j) for(int i = 0; i<MASK(l); ++i) if (GETBIT(i, j)){
        sum1[i] += sum1[i - MASK(j)];
    }
    for(int j = 0; j < l; ++j) for(int i = 0; i<MASK(l); ++i) if (!GETBIT(i, j)){
        sum2[i] += sum2[i + MASK(j)];
    }


 
    while(q--){
        string _s; cin >> _s;
        reverse(ALL(_s));
 
        int mask1 = 0, mask2 = 0;
        for(int i = 0; i<l; ++i) {
            if (_s[i] == '1') mask1 += MASK(i);
            else if (_s[i] == '?') mask2 += MASK(i);
        }
 
        if (pop_cnt(mask2) <= 6){
            int ans = 0;
            for(int mask = mask2; mask >= 0; mask = (mask - 1) & mask2){
                ans += s[mask + mask1] - '0';
                if (mask == 0) break;
            }
            cout << ans << "\n";
        }
        else if (pop_cnt(mask1) <= 6){
            int ans = 0;
            int cur_pop = pop_cnt(mask1);
            for(int mask = mask1; mask >= 0; mask = (mask - 1) & mask1){
                if ((pop_cnt(mask) & 1) == (cur_pop & 1)) ans += sum1[mask + mask2];
                else ans -= sum1[mask + mask2];
                if (mask == 0) break;
            }
            cout << ans << "\n";
        }
        else{
            int ans = 0;
            int mask3 = (MASK(l) - 1) ^ mask1 ^ mask2;
            for(int mask = mask3; mask >= 0; mask = (mask - 1) & mask3){
                if (pop_cnt(mask) & 1) ans -= sum2[mask1 + mask];
                else ans += sum1[mask1 + mask];
                if (mask == 0) break;
            }
            cout << ans << "\n";
        }
    }
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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