Submission #1158769

#TimeUsernameProblemLanguageResultExecution timeMemory
1158769HakunaSnake Escaping (JOI18_snake_escaping)C++20
12 / 100
2092 ms131072 KiB
#include <bits/stdc++.h> using namespace std; int l, Q; string s; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> l >> Q; cin >> s; unordered_map<string, int> cnt; for (int i = 0; i < (1 << l); i++) { string f; for (int j = l - 1; j >= 0; j--) { f += ((i >> j) & 1) + '0'; } for (int mask = 0; mask < (1 << l); mask++) { string temp = f; for (int j = 0; j < l; j++) { if ((mask >> j) & 1) temp[j] = '?'; } cnt[temp] += s[i] - '0'; } } while (Q--) { string d; cin >> d; cout << cnt[d] << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...