oj.uz

Submission #900613

# Submission time Handle Problem Language Result Execution time Memory
900613 2024-01-08T16:18:31 Z oviyan_gandhi Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 40720 KB 
#include <bits/stdc++.h>
using namespace std;

#define MAXN 20
int n, q;
string s;
int prv[1 << MAXN], dp[1 << MAXN], sub1[1 << MAXN];

int flip(int x){
    return ~x ^ ~((1 << n) - 1);
}

int curr = 0;
int brute(string t, int pos = 0){
    if (pos == 0)
        curr = 0;
    if (pos == n)
        return s[curr] - '0';
    int ret = 0;
    if (t[pos] != '1')
        ret += brute(t, pos+1);
    if (t[pos] != '0'){
        curr |= (1 << pos);
        ret += brute(t, pos+1);
        curr ^= (1 << pos);
    }
    return ret;
}

void sos(bool one){
    memset(dp, 0, sizeof(dp));
    for (int mask = 0; mask < (1 << n); mask++){
        dp[mask] = s[one ? mask : flip(mask)]-'0';
        if (mask & 1)
            dp[mask] += s[one ? (mask ^ 1) : flip(mask ^ 1)]-'0';
        prv[mask] = dp[mask];
    }
    for (int i = 1; i <= n; i++){
        for (int mask = 0; mask < (1 << n); mask++){
            dp[mask] = prv[mask];
            if (mask & (1 << i))
                dp[mask] += prv[mask ^ (1 << i)];
        }
        for (int mask = 0; mask < (1 << n); mask++)
            prv[mask] = dp[mask];
    }
    if (one)
        for (int mask = 0; mask < (1 << n); mask++)
            sub1[mask] = dp[mask];
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> q >> s;
    sos(1), sos(0);
    while (q--){
        string t; cin >> t;
        reverse(t.begin(), t.end());
        int cnt[]{0, 0, 0};
        for (char c : t){
            if (c == '?')
                cnt[0]++;
            else cnt[1+c-'0']++;
        }
        int least = min_element(cnt, cnt+3) - cnt - 1;
        if (least == -1){
            cout << brute(t) << '\n';
            continue;
        }
        int m = cnt[least+1], omask = 0;
        vector<int> pos;
        for (int i = 0; i < n; i++){
            if (t[i] == '?' || t[i] == ('0' + least))
                omask |= (1 << i);
            if (t[i] == ('0' + least))
                pos.push_back(i);
        }
        int *sub = (least ? sub1 : dp);
        int ans = 0;
        for (int i = 0; i < (1 << m); i++){
            int mask = omask;
            for (int j = 0; j < m; j++)
                if (i & (1 << j))
                    mask ^= (1 << pos[j]);
            if (__builtin_popcount(i) % 2) ans -= sub[mask];
            else ans += sub[mask];
        }
        cout << ans << '\n';
    }
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6500 KB Output is correct
3 Correct 2 ms 6488 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 2 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 186 ms 21328 KB Output is correct
12 Correct 217 ms 20960 KB Output is correct
13 Correct 387 ms 20304 KB Output is correct
14 Correct 690 ms 20180 KB Output is correct
15 Correct 275 ms 21504 KB Output is correct
16 Correct 489 ms 20476 KB Output is correct
17 Correct 470 ms 20316 KB Output is correct
18 Correct 150 ms 22236 KB Output is correct
19 Correct 278 ms 19340 KB Output is correct
20 Correct 215 ms 20828 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6500 KB Output is correct
3 Correct 2 ms 6488 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 2 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 186 ms 21328 KB Output is correct
12 Correct 217 ms 20960 KB Output is correct
13 Correct 387 ms 20304 KB Output is correct
14 Correct 690 ms 20180 KB Output is correct
15 Correct 275 ms 21504 KB Output is correct
16 Correct 489 ms 20476 KB Output is correct
17 Correct 470 ms 20316 KB Output is correct
18 Correct 150 ms 22236 KB Output is correct
19 Correct 278 ms 19340 KB Output is correct
20 Correct 215 ms 20828 KB Output is correct
21 Correct 257 ms 24148 KB Output is correct
22 Correct 286 ms 24400 KB Output is correct
23 Correct 576 ms 23536 KB Output is correct
24 Correct 1260 ms 23180 KB Output is correct
25 Correct 354 ms 25384 KB Output is correct
26 Correct 758 ms 23856 KB Output is correct
27 Correct 639 ms 23784 KB Output is correct
28 Correct 167 ms 26192 KB Output is correct
29 Correct 328 ms 22356 KB Output is correct
30 Correct 288 ms 24660 KB Output is correct
31 Correct 402 ms 24288 KB Output is correct
32 Correct 474 ms 24396 KB Output is correct
33 Correct 428 ms 23272 KB Output is correct
34 Correct 829 ms 23616 KB Output is correct
35 Correct 644 ms 24168 KB Output is correct
36 Correct 289 ms 22356 KB Output is correct
37 Correct 261 ms 24244 KB Output is correct
38 Correct 333 ms 22352 KB Output is correct
39 Correct 582 ms 23468 KB Output is correct
40 Correct 1268 ms 23280 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6500 KB Output is correct
3 Correct 2 ms 6488 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 2 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 101 ms 16032 KB Output is correct
12 Correct 90 ms 16084 KB Output is correct
13 Correct 226 ms 16296 KB Output is correct
14 Correct 149 ms 16108 KB Output is correct
15 Correct 108 ms 16204 KB Output is correct
16 Correct 258 ms 16276 KB Output is correct
17 Correct 227 ms 16112 KB Output is correct
18 Correct 100 ms 16116 KB Output is correct
19 Correct 123 ms 16024 KB Output is correct
20 Correct 108 ms 16024 KB Output is correct
21 Correct 115 ms 16212 KB Output is correct
22 Correct 147 ms 16536 KB Output is correct
23 Correct 165 ms 15940 KB Output is correct
24 Correct 381 ms 16108 KB Output is correct
25 Correct 225 ms 16112 KB Output is correct
26 Correct 150 ms 15940 KB Output is correct
27 Correct 109 ms 16116 KB Output is correct
28 Correct 140 ms 16120 KB Output is correct
29 Correct 225 ms 16116 KB Output is correct
30 Correct 564 ms 16140 KB Output is correct
31 Correct 163 ms 16112 KB Output is correct
32 Correct 306 ms 16100 KB Output is correct
33 Correct 228 ms 16108 KB Output is correct
34 Correct 119 ms 15860 KB Output is correct
35 Correct 197 ms 16104 KB Output is correct
36 Correct 191 ms 15940 KB Output is correct
37 Correct 187 ms 16068 KB Output is correct
38 Correct 191 ms 16368 KB Output is correct
39 Correct 193 ms 16112 KB Output is correct
40 Correct 187 ms 16120 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 2 ms 6500 KB Output is correct
3 Correct 2 ms 6488 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 2 ms 6488 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 186 ms 21328 KB Output is correct
12 Correct 217 ms 20960 KB Output is correct
13 Correct 387 ms 20304 KB Output is correct
14 Correct 690 ms 20180 KB Output is correct
15 Correct 275 ms 21504 KB Output is correct
16 Correct 489 ms 20476 KB Output is correct
17 Correct 470 ms 20316 KB Output is correct
18 Correct 150 ms 22236 KB Output is correct
19 Correct 278 ms 19340 KB Output is correct
20 Correct 215 ms 20828 KB Output is correct
21 Correct 257 ms 24148 KB Output is correct
22 Correct 286 ms 24400 KB Output is correct
23 Correct 576 ms 23536 KB Output is correct
24 Correct 1260 ms 23180 KB Output is correct
25 Correct 354 ms 25384 KB Output is correct
26 Correct 758 ms 23856 KB Output is correct
27 Correct 639 ms 23784 KB Output is correct
28 Correct 167 ms 26192 KB Output is correct
29 Correct 328 ms 22356 KB Output is correct
30 Correct 288 ms 24660 KB Output is correct
31 Correct 402 ms 24288 KB Output is correct
32 Correct 474 ms 24396 KB Output is correct
33 Correct 428 ms 23272 KB Output is correct
34 Correct 829 ms 23616 KB Output is correct
35 Correct 644 ms 24168 KB Output is correct
36 Correct 289 ms 22356 KB Output is correct
37 Correct 261 ms 24244 KB Output is correct
38 Correct 333 ms 22352 KB Output is correct
39 Correct 582 ms 23468 KB Output is correct
40 Correct 1268 ms 23280 KB Output is correct
41 Correct 101 ms 16032 KB Output is correct
42 Correct 90 ms 16084 KB Output is correct
43 Correct 226 ms 16296 KB Output is correct
44 Correct 149 ms 16108 KB Output is correct
45 Correct 108 ms 16204 KB Output is correct
46 Correct 258 ms 16276 KB Output is correct
47 Correct 227 ms 16112 KB Output is correct
48 Correct 100 ms 16116 KB Output is correct
49 Correct 123 ms 16024 KB Output is correct
50 Correct 108 ms 16024 KB Output is correct
51 Correct 115 ms 16212 KB Output is correct
52 Correct 147 ms 16536 KB Output is correct
53 Correct 165 ms 15940 KB Output is correct
54 Correct 381 ms 16108 KB Output is correct
55 Correct 225 ms 16112 KB Output is correct
56 Correct 150 ms 15940 KB Output is correct
57 Correct 109 ms 16116 KB Output is correct
58 Correct 140 ms 16120 KB Output is correct
59 Correct 225 ms 16116 KB Output is correct
60 Correct 564 ms 16140 KB Output is correct
61 Correct 163 ms 16112 KB Output is correct
62 Correct 306 ms 16100 KB Output is correct
63 Correct 228 ms 16108 KB Output is correct
64 Correct 119 ms 15860 KB Output is correct
65 Correct 197 ms 16104 KB Output is correct
66 Correct 191 ms 15940 KB Output is correct
67 Correct 187 ms 16068 KB Output is correct
68 Correct 191 ms 16368 KB Output is correct
69 Correct 193 ms 16112 KB Output is correct
70 Correct 187 ms 16120 KB Output is correct
71 Correct 498 ms 40416 KB Output is correct
72 Correct 510 ms 40720 KB Output is correct
73 Execution timed out 2045 ms 31384 KB Time limit exceeded
74 Halted 0 ms 0 KB -