# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101827 | KCSC | Snake Escaping (JOI18_snake_escaping) | C++14 | 1161 ms | 43076 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;
const int DIM = 20;
char str[1 << DIM], aux[DIM];
int udp[1 << DIM], ddp[1 << DIM], cbit[1 << DIM];
int main(void) {
#ifdef HOME
freopen("snake.in", "r", stdin);
freopen("snake.out", "w", stdout);
#endif
int n, q; scanf("%d %d\n%s\n", &n, &q, str);
for (int msk = 0; msk < (1 << n); ++msk) {
cbit[msk] = cbit[msk >> 1] + (msk & 1);
udp[msk] = ddp[msk] = str[msk] - '0'; }
for (int b = 0; b < n; ++b) {
for (int msk = 0; msk < (1 << n); ++msk) {
if (msk & (1 << b)) {
udp[msk ^ (1 << b)] += udp[msk]; }
else {
ddp[msk ^ (1 << b)] += ddp[msk]; } } }
while (q--) {
int msk0 = 0, msk1 = 0, mskq = 0;
scanf("%s\n", aux); reverse(aux, aux + n);
for (int i = 0; i < n; ++i) {
if (aux[i] == '0') { msk0 ^= (1 << i); }
if (aux[i] == '1') { msk1 ^= (1 << i); }
if (aux[i] == '?') { mskq ^= (1 << i); } }
Compilation message (stderr)
# | 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... |