oj.uz

Submission #702385

# Submission time Handle Problem Language Result Execution time Memory
702385 2023-02-23T20:49:55 Z bebra Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 2000 ms 23596 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 = 5;

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;
            }
        }
        shifts[shift].emplace_back(mask, j);
    }

    int n = 1 << k;
    for (const auto& [shift, values] : shifts) {

        if (values.size() >= MAGIC) {
            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 | shift) < 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 mask = 0; (mask | shift) < n; ++mask) {
                dp[mask] = 0;
            }
        } else {
            for (const auto& [mask, idx] : values) {
                ans[idx] = s[shift] - '0';
                for (int submask = mask; submask > 0; submask = (submask - 1) & mask) {
                    ans[idx] += s[submask | shift] - '0';
                }
            }
        }
    }

    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 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 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 1 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 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 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 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 208 ms 17232 KB Output is correct
12 Correct 190 ms 15788 KB Output is correct
13 Correct 251 ms 17504 KB Output is correct
14 Correct 213 ms 19668 KB Output is correct
15 Correct 231 ms 20216 KB Output is correct
16 Correct 249 ms 19276 KB Output is correct
17 Correct 265 ms 20056 KB Output is correct
18 Correct 145 ms 17132 KB Output is correct
19 Correct 190 ms 15296 KB Output is correct
20 Correct 246 ms 17612 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 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 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 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 208 ms 17232 KB Output is correct
12 Correct 190 ms 15788 KB Output is correct
13 Correct 251 ms 17504 KB Output is correct
14 Correct 213 ms 19668 KB Output is correct
15 Correct 231 ms 20216 KB Output is correct
16 Correct 249 ms 19276 KB Output is correct
17 Correct 265 ms 20056 KB Output is correct
18 Correct 145 ms 17132 KB Output is correct
19 Correct 190 ms 15296 KB Output is correct
20 Correct 246 ms 17612 KB Output is correct
21 Correct 369 ms 23596 KB Output is correct
22 Correct 210 ms 16300 KB Output is correct
23 Correct 587 ms 18996 KB Output is correct
24 Correct 306 ms 19608 KB Output is correct
25 Correct 428 ms 20552 KB Output is correct
26 Correct 709 ms 20848 KB Output is correct
27 Correct 733 ms 21204 KB Output is correct
28 Correct 175 ms 18176 KB Output is correct
29 Correct 364 ms 21744 KB Output is correct
30 Correct 761 ms 21856 KB Output is correct
31 Correct 601 ms 20200 KB Output is correct
32 Correct 311 ms 20368 KB Output is correct
33 Correct 303 ms 18636 KB Output is correct
34 Correct 702 ms 20168 KB Output is correct
35 Correct 753 ms 21188 KB Output is correct
36 Correct 153 ms 14172 KB Output is correct
37 Correct 205 ms 16248 KB Output is correct
38 Correct 709 ms 19748 KB Output is correct
39 Correct 359 ms 22808 KB Output is correct
40 Correct 358 ms 18764 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 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 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 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 227 ms 10732 KB Output is correct
12 Correct 49 ms 6752 KB Output is correct
13 Execution timed out 2065 ms 9228 KB Time limit exceeded
14 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 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 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 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 208 ms 17232 KB Output is correct
12 Correct 190 ms 15788 KB Output is correct
13 Correct 251 ms 17504 KB Output is correct
14 Correct 213 ms 19668 KB Output is correct
15 Correct 231 ms 20216 KB Output is correct
16 Correct 249 ms 19276 KB Output is correct
17 Correct 265 ms 20056 KB Output is correct
18 Correct 145 ms 17132 KB Output is correct
19 Correct 190 ms 15296 KB Output is correct
20 Correct 246 ms 17612 KB Output is correct
21 Correct 369 ms 23596 KB Output is correct
22 Correct 210 ms 16300 KB Output is correct
23 Correct 587 ms 18996 KB Output is correct
24 Correct 306 ms 19608 KB Output is correct
25 Correct 428 ms 20552 KB Output is correct
26 Correct 709 ms 20848 KB Output is correct
27 Correct 733 ms 21204 KB Output is correct
28 Correct 175 ms 18176 KB Output is correct
29 Correct 364 ms 21744 KB Output is correct
30 Correct 761 ms 21856 KB Output is correct
31 Correct 601 ms 20200 KB Output is correct
32 Correct 311 ms 20368 KB Output is correct
33 Correct 303 ms 18636 KB Output is correct
34 Correct 702 ms 20168 KB Output is correct
35 Correct 753 ms 21188 KB Output is correct
36 Correct 153 ms 14172 KB Output is correct
37 Correct 205 ms 16248 KB Output is correct
38 Correct 709 ms 19748 KB Output is correct
39 Correct 359 ms 22808 KB Output is correct
40 Correct 358 ms 18764 KB Output is correct
41 Correct 227 ms 10732 KB Output is correct
42 Correct 49 ms 6752 KB Output is correct
43 Execution timed out 2065 ms 9228 KB Time limit exceeded
44 Halted 0 ms 0 KB -