Submission #654657

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
654657	2022-11-01 06:17:33	lunchbox1	Snake Escaping (JOI18_snake_escaping)	C++17	100 / 100	696 ms	43472 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
/*
 Snake Escaping
 https://oj.uz/problem/view/JOI18_snake_escaping
*/
#include <bits/stdc++.h>
using namespace std;
const int L = 20, N = 1 << L;
int main() {
 ios::sync_with_stdio(0), cin.tie(0);
 int l, q; cin >> l >> q;
 string s; cin >> s;
 int n = 1 << l;
 static int f[N], g[N], c[N];
 for (int i = 0; i < n; i++)
  f[i] += s[i] - '0', g[i] += s[i] - '0';
 for (int i = 1; i < n; i++)
  c[i] = c[i & (i - 1)] + 1;
 for (int b = 0; b < l; b++)
  for (int i = 0; i < n; i++)
   if (i >> b & 1) {
    f[i] += f[i ^ (1 << b)];
    g[i ^ (1 << b)] += g[i];
   }
 while (q--) {
  string t; cin >> t;
  reverse(t.begin(), t.end());
  int i0 = 0, i1 = 0, iq = 0;
  for (int b = 0; b < l; b++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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