Submission #1304064

#	Time	Username	Problem	Language	Result	Execution time	Memory
1304064		anhkiet	Snake Escaping (JOI18_snake_escaping)	C++20	75 / 100	301 ms	109400 KiB

snake_escaping

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 100;
#define int long long
#define fi first
#define pdi pair < pair < double, double >, int >
#define se second
#define ll long long
#define pii pair < int, int >
const int MOD = 1e9 + 7;
const ll inf = 1e18;

string s;
int l, q;
int n, ans;
char b[maxn];
int c[maxn];
string qry[maxn];

void xuly() {
    for (int i = 1; i <= l; i++) {
        if (c[i] != (b[i] - '0') && b[i] != '?') return;
    }

    int cur = 0;
    int t = 0;
    for (int i = l; i >= 1; i--) {
        if (c[i] == 1) t += (1 << cur);
        cur ++;
    }

//    for (int i = 1; i <= l; i++) cout << c[i];
//    cout << "  " << t;
//    cout << endl;

    ans += (s[t] - '0');
}

void backtrack(int i) {
    for (int j = 0; j <= 1; j++) {
        c[i] = j;
        if (i == l) xuly();
        else backtrack(i + 1);
    }
}

namespace subtask1 {
    void solve() {
    for (int i = 1; i <= q; i++) {
        for (int j = 1; j <= l; j++) {
               b[j] = qry[i][j - 1];
        }
            backtrack(1);
            cout << ans << '\n';
            ans = 0;
        }
    }
}

namespace subtaskbip {
    static int f[1 << 20], g[1 << 20], base[1 << 20];

    void solve() {
        int S = (1 << l);
        for (int i = 0; i < S; i++) {
            base[i] = s[i] - '0';
            f[i] = base[i];
            g[(S - 1) ^ i] = base[i];
        }
        for (int i = 0; i < l; i++)
            for (int mask = 0; mask < S; mask++)
                if (mask & (1 << i)) {
                    f[mask] += f[mask ^ (1 << i)];
                    g[mask] += g[mask ^ (1 << i)];
                }

        for (int i = 1; i <= q; i++) {
            string st = qry[i];
            reverse(st.begin(), st.end());
            int x = 0, y = 0, z = 0, d0 = 0, d1 = 0, d2 = 0;
            for (int j = 0; j < l; j++) {
                if (st[j] == '0') x |= (1 << j), d0++;
                else if (st[j] == '1') y |= (1 << j), d1++;
                else z |= (1 << j), d2++;
            }
            long long ans = 0;
            if (d2 <= 6)
                for (int mask = z; ; mask = (mask - 1) & z) {
                    ans += base[mask | y];
                    if (mask == 0) break;
                }
            else if (d1 <= 6)
                for (int mask = y; ; mask = (mask - 1) & y) {
                    if (__builtin_popcount(mask ^ y) & 1) ans -= f[mask | z];
                    else ans += f[mask | z];
                    if (mask == 0) break;
                }
            else
                for (int mask = x; ; mask = (mask - 1) & x) {
                    if (__builtin_popcount(mask ^ x) & 1) ans -= g[mask | z];
                    else ans += g[mask | z];
                    if (mask == 0) break;
                }
            cout << ans << '\n';
        }
    }
}


signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);     cout.tie(0);

    #define NAME "test"
    if (fopen(NAME".INP", "r")) {
        freopen(NAME".INP", "r",stdin);
        freopen(NAME".OUT", "w",stdout);
    }

    cin >> l >> q;
    cin >> s;

    for (int i = 1; i <= q; i++) {
        cin >> qry[i];
    }

 
   subtaskbip::solve();
}

Compilation message (stderr)

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:116:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  116 |         freopen(NAME".INP", "r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
snake_escaping.cpp:117:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |         freopen(NAME".OUT", "w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

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