oj.uz

Submission #702388

# Submission time Handle Problem Language Result Execution time Memory
702388 2023-02-23T21:02:16 Z bebra Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 2000 ms 23636 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 = 1;

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;
        for (int i = 0; i < k; ++i) {
            if (t[i] == '?') {
                mask |= 1 << i;
            } else if (t[i] == '1') {
                shift |= 1 << i;
            }
        }
        shifts[shift].emplace_back(mask, j);
    }

    for (const auto& [shift, values] : shifts) {
        if (values.size() >= MAGIC) {
            int total_mask = ((1 << k) - 1) & (~shift);

            dp[0] = s[shift] - '0';
            for (int mask = total_mask; mask > 0; mask = (mask - 1) & total_mask) {
                dp[mask] = s[mask | shift] - '0';
            }

            for (int bit = 0; bit < k; ++bit) {
                if (shift & (1 << bit)) continue;
                for (int mask = total_mask; mask > 0; mask = (mask - 1) & total_mask) {
                    if (mask & (1 << bit)) {
                        dp[mask] += dp[mask ^ (1 << bit)];
                    }
                }
            }

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

            for (int mask = total_mask; mask > 0; mask = (mask - 1) & total_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 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 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 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 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 215 ms 17240 KB Output is correct
12 Correct 204 ms 15768 KB Output is correct
13 Correct 228 ms 17428 KB Output is correct
14 Correct 219 ms 19676 KB Output is correct
15 Correct 227 ms 20176 KB Output is correct
16 Correct 272 ms 19320 KB Output is correct
17 Correct 260 ms 19980 KB Output is correct
18 Correct 155 ms 17208 KB Output is correct
19 Correct 195 ms 15240 KB Output is correct
20 Correct 254 ms 17740 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 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 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 215 ms 17240 KB Output is correct
12 Correct 204 ms 15768 KB Output is correct
13 Correct 228 ms 17428 KB Output is correct
14 Correct 219 ms 19676 KB Output is correct
15 Correct 227 ms 20176 KB Output is correct
16 Correct 272 ms 19320 KB Output is correct
17 Correct 260 ms 19980 KB Output is correct
18 Correct 155 ms 17208 KB Output is correct
19 Correct 195 ms 15240 KB Output is correct
20 Correct 254 ms 17740 KB Output is correct
21 Correct 270 ms 23636 KB Output is correct
22 Correct 217 ms 16476 KB Output is correct
23 Correct 310 ms 19036 KB Output is correct
24 Correct 267 ms 19644 KB Output is correct
25 Correct 286 ms 20552 KB Output is correct
26 Correct 344 ms 20820 KB Output is correct
27 Correct 354 ms 21328 KB Output is correct
28 Correct 163 ms 18160 KB Output is correct
29 Correct 252 ms 21588 KB Output is correct
30 Correct 375 ms 21896 KB Output is correct
31 Correct 332 ms 20044 KB Output is correct
32 Correct 281 ms 20352 KB Output is correct
33 Correct 271 ms 18600 KB Output is correct
34 Correct 340 ms 20268 KB Output is correct
35 Correct 348 ms 21196 KB Output is correct
36 Correct 157 ms 14228 KB Output is correct
37 Correct 207 ms 16196 KB Output is correct
38 Correct 333 ms 19728 KB Output is correct
39 Correct 280 ms 22712 KB Output is correct
40 Correct 281 ms 18740 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 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 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 631 ms 10720 KB Output is correct
12 Correct 39 ms 6760 KB Output is correct
13 Execution timed out 2075 ms 9208 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 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 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 215 ms 17240 KB Output is correct
12 Correct 204 ms 15768 KB Output is correct
13 Correct 228 ms 17428 KB Output is correct
14 Correct 219 ms 19676 KB Output is correct
15 Correct 227 ms 20176 KB Output is correct
16 Correct 272 ms 19320 KB Output is correct
17 Correct 260 ms 19980 KB Output is correct
18 Correct 155 ms 17208 KB Output is correct
19 Correct 195 ms 15240 KB Output is correct
20 Correct 254 ms 17740 KB Output is correct
21 Correct 270 ms 23636 KB Output is correct
22 Correct 217 ms 16476 KB Output is correct
23 Correct 310 ms 19036 KB Output is correct
24 Correct 267 ms 19644 KB Output is correct
25 Correct 286 ms 20552 KB Output is correct
26 Correct 344 ms 20820 KB Output is correct
27 Correct 354 ms 21328 KB Output is correct
28 Correct 163 ms 18160 KB Output is correct
29 Correct 252 ms 21588 KB Output is correct
30 Correct 375 ms 21896 KB Output is correct
31 Correct 332 ms 20044 KB Output is correct
32 Correct 281 ms 20352 KB Output is correct
33 Correct 271 ms 18600 KB Output is correct
34 Correct 340 ms 20268 KB Output is correct
35 Correct 348 ms 21196 KB Output is correct
36 Correct 157 ms 14228 KB Output is correct
37 Correct 207 ms 16196 KB Output is correct
38 Correct 333 ms 19728 KB Output is correct
39 Correct 280 ms 22712 KB Output is correct
40 Correct 281 ms 18740 KB Output is correct
41 Correct 631 ms 10720 KB Output is correct
42 Correct 39 ms 6760 KB Output is correct
43 Execution timed out 2075 ms 9208 KB Time limit exceeded
44 Halted 0 ms 0 KB -