| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 330178 | casperwang | Snake Escaping (JOI18_snake_escaping) | C++14 | 2090 ms | 5648 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 L = 20;
int n, q;
string str;
int val[1<<L];
int ans;
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> q;
cin >> str;
for (int i = 0; i < (1<<n); i++)
val[i] = str[i] - '0';
for (int i = 0; i < q; i++) {
cin >> str;
ans = 0;
for (int j = 0; j < (1<<n); j++) {
bool tf = 1;
for (int k = 0; k < n && tf; k++) {
if (str[n-1-k] == '?') continue;
if (str[n-1-k]-'0' != ((1<<k)&(j))>0) tf = 0;
}
if (tf) ans += val[j];
}
cout << ans << "\n";
}
}
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... | ||||
