oj.uz

Submission #702377

# Submission time Handle Problem Language Result Execution time Memory
702377 2023-02-23T20:29:55 Z bebra Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 2000 ms 24128 KB 
#include <bits/stdc++.h>
using namespace std;

#define dbg(x) cerr << #x << ": " << x << endl;


constexpr int MAX_Q = 1e6 + 5;
constexpr int MAX_BIT = 20;
constexpr int MAX_N = 1 << 20;
constexpr int MAGIC = 12;

int ans[MAX_Q];
int dp[MAX_N];


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int k, q;
    cin >> k >> q;

    string s;
    cin >> s;

    map<int, vector<pair<int, int>>> shifts;
    for (int j = 0; j < q; ++j) {
        string t;
        cin >> t;
        reverse(t.begin(), t.end());

        int mask = 0;
        int shift = 0;
        int bits_cnt = 0;
        for (int i = 0; i < k; ++i) {
            if (t[i] == '?') {
                mask |= 1 << i;
                ++bits_cnt;
            } else if (t[i] == '1') {
                shift |= 1 << i;
            }
        }

        if (bits_cnt < MAGIC) {
            int res = s[shift] - '0';
            for (int submask = mask; submask > 0; submask = (submask - 1) & mask) {
                res += s[submask + shift] - '0';
            }
            ans[j] = res;
        } else {
            shifts[shift].emplace_back(mask, j);
        }
    }

    int n = 1 << k;
    for (auto [shift, values] : shifts) {
        memset(dp, 0, sizeof(dp));

        for (int mask = 0; (mask | shift) < n; ++mask) {
            if ((mask & shift) == 0) {
                dp[mask] = s[mask | shift] - '0';
            }
        }

        for (int bit = 0; bit < k; ++bit) {
            if (shift & (1 << bit)) continue;

            for (int mask = 0; mask < n; ++mask) {
                if ((mask & shift) != 0) continue;

                if (mask & (1 << bit)) {
                    dp[mask] += dp[mask ^ (1 << bit)];
                }
            }
        }

        for (const auto& [mask, idx] : values) {
            ans[idx] = dp[mask];
        }
    }

    for (int i = 0; i < q; ++i) {
        cout << ans[i] << '\n';
    }
    
    return 0;
}


/*
4
1
3141592653589793
?01?


*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 206 ms 8284 KB Output is correct
12 Correct 243 ms 7884 KB Output is correct
13 Correct 172 ms 7116 KB Output is correct
14 Correct 171 ms 7224 KB Output is correct
15 Correct 246 ms 8320 KB Output is correct
16 Correct 189 ms 7400 KB Output is correct
17 Correct 200 ms 7304 KB Output is correct
18 Correct 1191 ms 9140 KB Output is correct
19 Correct 150 ms 6296 KB Output is correct
20 Correct 243 ms 7836 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 206 ms 8284 KB Output is correct
12 Correct 243 ms 7884 KB Output is correct
13 Correct 172 ms 7116 KB Output is correct
14 Correct 171 ms 7224 KB Output is correct
15 Correct 246 ms 8320 KB Output is correct
16 Correct 189 ms 7400 KB Output is correct
17 Correct 200 ms 7304 KB Output is correct
18 Correct 1191 ms 9140 KB Output is correct
19 Correct 150 ms 6296 KB Output is correct
20 Correct 243 ms 7836 KB Output is correct
21 Correct 332 ms 8372 KB Output is correct
22 Correct 399 ms 12556 KB Output is correct
23 Correct 198 ms 7320 KB Output is correct
24 Correct 187 ms 7372 KB Output is correct
25 Correct 455 ms 9252 KB Output is correct
26 Correct 248 ms 7776 KB Output is correct
27 Correct 236 ms 11800 KB Output is correct
28 Correct 166 ms 24128 KB Output is correct
29 Correct 143 ms 6200 KB Output is correct
30 Correct 404 ms 12572 KB Output is correct
31 Correct 261 ms 8268 KB Output is correct
32 Correct 222 ms 8248 KB Output is correct
33 Correct 178 ms 7120 KB Output is correct
34 Correct 196 ms 7252 KB Output is correct
35 Correct 240 ms 11760 KB Output is correct
36 Correct 146 ms 6168 KB Output is correct
37 Correct 263 ms 8268 KB Output is correct
38 Correct 143 ms 6128 KB Output is correct
39 Correct 196 ms 7364 KB Output is correct
40 Correct 188 ms 7256 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 72 ms 2416 KB Output is correct
12 Correct 78 ms 7784 KB Output is correct
13 Correct 20 ms 3884 KB Output is correct
14 Correct 24 ms 3912 KB Output is correct
15 Execution timed out 2062 ms 9764 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 206 ms 8284 KB Output is correct
12 Correct 243 ms 7884 KB Output is correct
13 Correct 172 ms 7116 KB Output is correct
14 Correct 171 ms 7224 KB Output is correct
15 Correct 246 ms 8320 KB Output is correct
16 Correct 189 ms 7400 KB Output is correct
17 Correct 200 ms 7304 KB Output is correct
18 Correct 1191 ms 9140 KB Output is correct
19 Correct 150 ms 6296 KB Output is correct
20 Correct 243 ms 7836 KB Output is correct
21 Correct 332 ms 8372 KB Output is correct
22 Correct 399 ms 12556 KB Output is correct
23 Correct 198 ms 7320 KB Output is correct
24 Correct 187 ms 7372 KB Output is correct
25 Correct 455 ms 9252 KB Output is correct
26 Correct 248 ms 7776 KB Output is correct
27 Correct 236 ms 11800 KB Output is correct
28 Correct 166 ms 24128 KB Output is correct
29 Correct 143 ms 6200 KB Output is correct
30 Correct 404 ms 12572 KB Output is correct
31 Correct 261 ms 8268 KB Output is correct
32 Correct 222 ms 8248 KB Output is correct
33 Correct 178 ms 7120 KB Output is correct
34 Correct 196 ms 7252 KB Output is correct
35 Correct 240 ms 11760 KB Output is correct
36 Correct 146 ms 6168 KB Output is correct
37 Correct 263 ms 8268 KB Output is correct
38 Correct 143 ms 6128 KB Output is correct
39 Correct 196 ms 7364 KB Output is correct
40 Correct 188 ms 7256 KB Output is correct
41 Correct 72 ms 2416 KB Output is correct
42 Correct 78 ms 7784 KB Output is correct
43 Correct 20 ms 3884 KB Output is correct
44 Correct 24 ms 3912 KB Output is correct
45 Execution timed out 2062 ms 9764 KB Time limit exceeded
46 Halted 0 ms 0 KB -