# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1018204 | mnbvcxz123 | Snake Escaping (JOI18_snake_escaping) | C++17 | 571 ms | 43492 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
int main() {
using namespace std;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int L, Q;
cin >> L >> Q;
string S;
cin >> S;
vector<int> A(1 << L), dp1(1 << L), dp2(1 << L);
for (int i = 0; i < (1 << L); i++)
A[i] = dp1[i] = dp2[i] = S[i] - '0';
for (int b = 0; b < L; b++) {
for (int m = 0; m < (1 << L); m++) {
if (m >> b & 1)
dp1[m] += dp1[m ^ (1 << b)];
else
dp2[m] += dp2[m ^ (1 << b)];
}
}
while (Q--) {
string S;
cin >> S;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |