# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
965420 | four_specks | Snake Escaping (JOI18_snake_escaping) | C++17 | 551 ms | 43460 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.
#include <bits/stdc++.h>
using namespace std;
namespace {}
void solve() {
int h, q;
cin >> h >> q;
uint32_t n = 1 << h;
string a;
cin >> a;
vector<int> b(n);
for (uint32_t x = 0; x < n; x++) {
b[x] = a[x] - '0';
}
vector dp_sub = b, dp_super = b;
for (int s = 0; s < h; s++) {
for (uint32_t x = n; x + 1 > 0; x--) {
if (x >> s & 1) {
dp_sub[x] += dp_sub[x ^ (1u << s)];
}
}
for (uint32_t x = 0; x < n; x++) {
if (!(x >> s & 1)) {
dp_super[x] += dp_super[x | (1u << s)];
}
}
}
for (int i = 0; i < q; i++) {
# | 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... |