oj.uz

Submission #702380

# Submission time Handle Problem Language Result Execution time Memory
702380 2023-02-23T20:38:24 Z bebra Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 2000 ms 22244 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 (const 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 | 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 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 0 ms 340 KB Output is correct
4 Correct 1 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 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 0 ms 340 KB Output is correct
4 Correct 1 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 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 211 ms 8144 KB Output is correct
12 Correct 246 ms 7852 KB Output is correct
13 Correct 170 ms 7144 KB Output is correct
14 Correct 170 ms 7220 KB Output is correct
15 Correct 247 ms 8144 KB Output is correct
16 Correct 191 ms 7380 KB Output is correct
17 Correct 193 ms 7288 KB Output is correct
18 Correct 1218 ms 9312 KB Output is correct
19 Correct 134 ms 6232 KB Output is correct
20 Correct 253 ms 7816 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 0 ms 340 KB Output is correct
4 Correct 1 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 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 211 ms 8144 KB Output is correct
12 Correct 246 ms 7852 KB Output is correct
13 Correct 170 ms 7144 KB Output is correct
14 Correct 170 ms 7220 KB Output is correct
15 Correct 247 ms 8144 KB Output is correct
16 Correct 191 ms 7380 KB Output is correct
17 Correct 193 ms 7288 KB Output is correct
18 Correct 1218 ms 9312 KB Output is correct
19 Correct 134 ms 6232 KB Output is correct
20 Correct 253 ms 7816 KB Output is correct
21 Correct 330 ms 8192 KB Output is correct
22 Correct 411 ms 12492 KB Output is correct
23 Correct 202 ms 7416 KB Output is correct
24 Correct 193 ms 7256 KB Output is correct
25 Correct 463 ms 9488 KB Output is correct
26 Correct 236 ms 7672 KB Output is correct
27 Correct 243 ms 7620 KB Output is correct
28 Correct 156 ms 22244 KB Output is correct
29 Correct 148 ms 6240 KB Output is correct
30 Correct 404 ms 12436 KB Output is correct
31 Correct 267 ms 8212 KB Output is correct
32 Correct 219 ms 8152 KB Output is correct
33 Correct 177 ms 7136 KB Output is correct
34 Correct 190 ms 7244 KB Output is correct
35 Correct 238 ms 7716 KB Output is correct
36 Correct 143 ms 6216 KB Output is correct
37 Correct 271 ms 8200 KB Output is correct
38 Correct 140 ms 6220 KB Output is correct
39 Correct 200 ms 7372 KB Output is correct
40 Correct 196 ms 7228 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 0 ms 340 KB Output is correct
4 Correct 1 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 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 74 ms 2416 KB Output is correct
12 Correct 100 ms 5996 KB Output is correct
13 Correct 18 ms 2416 KB Output is correct
14 Correct 23 ms 2416 KB Output is correct
15 Execution timed out 2081 ms 7588 KB Time limit exceeded
16 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 0 ms 340 KB Output is correct
4 Correct 1 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 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 211 ms 8144 KB Output is correct
12 Correct 246 ms 7852 KB Output is correct
13 Correct 170 ms 7144 KB Output is correct
14 Correct 170 ms 7220 KB Output is correct
15 Correct 247 ms 8144 KB Output is correct
16 Correct 191 ms 7380 KB Output is correct
17 Correct 193 ms 7288 KB Output is correct
18 Correct 1218 ms 9312 KB Output is correct
19 Correct 134 ms 6232 KB Output is correct
20 Correct 253 ms 7816 KB Output is correct
21 Correct 330 ms 8192 KB Output is correct
22 Correct 411 ms 12492 KB Output is correct
23 Correct 202 ms 7416 KB Output is correct
24 Correct 193 ms 7256 KB Output is correct
25 Correct 463 ms 9488 KB Output is correct
26 Correct 236 ms 7672 KB Output is correct
27 Correct 243 ms 7620 KB Output is correct
28 Correct 156 ms 22244 KB Output is correct
29 Correct 148 ms 6240 KB Output is correct
30 Correct 404 ms 12436 KB Output is correct
31 Correct 267 ms 8212 KB Output is correct
32 Correct 219 ms 8152 KB Output is correct
33 Correct 177 ms 7136 KB Output is correct
34 Correct 190 ms 7244 KB Output is correct
35 Correct 238 ms 7716 KB Output is correct
36 Correct 143 ms 6216 KB Output is correct
37 Correct 271 ms 8200 KB Output is correct
38 Correct 140 ms 6220 KB Output is correct
39 Correct 200 ms 7372 KB Output is correct
40 Correct 196 ms 7228 KB Output is correct
41 Correct 74 ms 2416 KB Output is correct
42 Correct 100 ms 5996 KB Output is correct
43 Correct 18 ms 2416 KB Output is correct
44 Correct 23 ms 2416 KB Output is correct
45 Execution timed out 2081 ms 7588 KB Time limit exceeded
46 Halted 0 ms 0 KB -