# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287314 | luciocf | Snake Escaping (JOI18_snake_escaping) | C++14 | 406 ms | 20220 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 maxn = 10;
int n, q;
char v[1<<maxn];
int dp[1<<maxn][1<<maxn];
int main(void)
{
ios::sync_with_stdio(false); cin.tie(0);
cin >> n >> q;
for (int i = 0; i < (1<<n); i++)
{
cin >> v[i];
v[i] = (int)(v[i]-'0');
}
for (int fixo = (1<<n)-1; fixo >= 0; fixo--)
{
dp[fixo][0] = v[fixo];
for (int outro = 1; outro < (1<<n); outro++)
{
int b;
for (int l = 0; l < n; l++)
{
if (outro&(1<<l))
{
b = l;
break;
}
}
dp[fixo][outro] = dp[fixo][outro^(1<<b)] + dp[fixo|(1<<b)][outro^(1<<b)];
}
}
while (q--)
{
int fixo = 0, outro = 0;
for (int i = 0; i < n; i++)
{
char c;
cin >> c;
if (c == '?') outro += (1<<(n-i-1));
else if (c == '1') fixo += (1<<(n-i-1));
}
cout << dp[fixo][outro] << "\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... |