제출 #523315

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
523315	2022-02-07 12:27:13	sidon	Snake Escaping (JOI18_snake_escaping)	C++17	58 / 100	1310 ms	65540 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;
const int B = 12, N = 1<<20, SZ = pow(3, B);
int Q, dp[SZ], ans[N];
string A, t[N];
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> Q >> Q >> A;
  A.resize(N, '0');
  for(int i = 0; i < Q; ++i) {
    cin >> t[i];
    reverse(begin(t[i]), end(t[i]));
    t[i].resize(20, '0');
  }
  for(int s = 0; s < (1<<(20-B)); ++s) {
    memset(dp, 0, sizeof dp);
    for(int i = 0; i < (1<<B); ++i) {
      int j = 0;
      for(int k = 0, p = 1; k < B; ++k, p *= 3)
        if(i & (1<<k)) j += p;
      dp[j] += A[i | (s << B)] - '0';
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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