oj.uz

Submission #702376

# Submission time Handle Problem Language Result Execution time Memory
702376 2023-02-23T20:28:54 Z bebra Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 2000 ms 24148 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 = 10;

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 1 ms 340 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 1 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 2 ms 4436 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 1 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 2 ms 4436 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct
11 Correct 213 ms 8240 KB Output is correct
12 Correct 262 ms 11956 KB Output is correct
13 Correct 186 ms 7116 KB Output is correct
14 Correct 176 ms 7372 KB Output is correct
15 Correct 250 ms 8128 KB Output is correct
16 Correct 196 ms 7376 KB Output is correct
17 Correct 197 ms 11444 KB Output is correct
18 Correct 160 ms 24024 KB Output is correct
19 Correct 139 ms 6200 KB Output is correct
20 Correct 247 ms 11916 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 1 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 2 ms 4436 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct
11 Correct 213 ms 8240 KB Output is correct
12 Correct 262 ms 11956 KB Output is correct
13 Correct 186 ms 7116 KB Output is correct
14 Correct 176 ms 7372 KB Output is correct
15 Correct 250 ms 8128 KB Output is correct
16 Correct 196 ms 7376 KB Output is correct
17 Correct 197 ms 11444 KB Output is correct
18 Correct 160 ms 24024 KB Output is correct
19 Correct 139 ms 6200 KB Output is correct
20 Correct 247 ms 11916 KB Output is correct
21 Correct 344 ms 8208 KB Output is correct
22 Correct 372 ms 12948 KB Output is correct
23 Correct 196 ms 7416 KB Output is correct
24 Correct 210 ms 7196 KB Output is correct
25 Correct 458 ms 9168 KB Output is correct
26 Correct 231 ms 7656 KB Output is correct
27 Correct 282 ms 11844 KB Output is correct
28 Correct 165 ms 24148 KB Output is correct
29 Correct 153 ms 6268 KB Output is correct
30 Correct 438 ms 13128 KB Output is correct
31 Correct 285 ms 8168 KB Output is correct
32 Correct 219 ms 8152 KB Output is correct
33 Correct 183 ms 7088 KB Output is correct
34 Correct 191 ms 7156 KB Output is correct
35 Correct 297 ms 11728 KB Output is correct
36 Correct 142 ms 6256 KB Output is correct
37 Correct 272 ms 8300 KB Output is correct
38 Correct 144 ms 6188 KB Output is correct
39 Correct 243 ms 7364 KB Output is correct
40 Correct 212 ms 7168 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 1 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 2 ms 4436 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct
11 Execution timed out 2076 ms 10600 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 4436 KB Output is correct
3 Correct 1 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 2 ms 4436 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 4436 KB Output is correct
11 Correct 213 ms 8240 KB Output is correct
12 Correct 262 ms 11956 KB Output is correct
13 Correct 186 ms 7116 KB Output is correct
14 Correct 176 ms 7372 KB Output is correct
15 Correct 250 ms 8128 KB Output is correct
16 Correct 196 ms 7376 KB Output is correct
17 Correct 197 ms 11444 KB Output is correct
18 Correct 160 ms 24024 KB Output is correct
19 Correct 139 ms 6200 KB Output is correct
20 Correct 247 ms 11916 KB Output is correct
21 Correct 344 ms 8208 KB Output is correct
22 Correct 372 ms 12948 KB Output is correct
23 Correct 196 ms 7416 KB Output is correct
24 Correct 210 ms 7196 KB Output is correct
25 Correct 458 ms 9168 KB Output is correct
26 Correct 231 ms 7656 KB Output is correct
27 Correct 282 ms 11844 KB Output is correct
28 Correct 165 ms 24148 KB Output is correct
29 Correct 153 ms 6268 KB Output is correct
30 Correct 438 ms 13128 KB Output is correct
31 Correct 285 ms 8168 KB Output is correct
32 Correct 219 ms 8152 KB Output is correct
33 Correct 183 ms 7088 KB Output is correct
34 Correct 191 ms 7156 KB Output is correct
35 Correct 297 ms 11728 KB Output is correct
36 Correct 142 ms 6256 KB Output is correct
37 Correct 272 ms 8300 KB Output is correct
38 Correct 144 ms 6188 KB Output is correct
39 Correct 243 ms 7364 KB Output is correct
40 Correct 212 ms 7168 KB Output is correct
41 Execution timed out 2076 ms 10600 KB Time limit exceeded
42 Halted 0 ms 0 KB -