Submission #961215

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
961215	2024-04-11 17:30:14	efishel	Snake Escaping (JOI18_snake_escaping)	C++17	100 / 100	662 ms	48020 KiB

snake_escaping

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
const ll MAXN = 1.1E6;
ll dp1[MAXN], dp0[MAXN];
int main () {
    cin.tie(nullptr) -> sync_with_stdio(false);
    ll n, Q;
    cin >> n >> Q;
    ll ALL = (1<<n)-1;
    string str;
    cin >> str;
    for (ll i = 0; i <= ALL; i++)
        dp1[i] = str[i]-'0';
    for (ll bit = 0; bit < n; bit++)
        for (int mask = 0; mask <= ALL; mask++)
            if (mask>>bit&1) dp1[mask] += dp1[mask ^ (1<<bit)];
    for (ll i = 0; i <= ALL; i++)
        dp0[i] = str[i ^ ALL]-'0';
    for (ll bit = 0; bit < n; bit++)
        for (int mask = 0; mask <= ALL; mask++)
            if (mask>>bit&1) dp0[mask] += dp0[mask ^ (1<<bit)];
    while (Q--) {
        string q;
        cin >> q;
        reverse(q.begin(), q.end());
        int nul = 0, unu = 0, dem;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 10 / 10
• Subtask 4: 53 / 53
• Subtask 5: 25 / 25