# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
539323 | pnm1384 | Snake Escaping (JOI18_snake_escaping) | C++14 | 1002 ms | 20208 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;
typedef long long ll;
const int N = 21;
int dp[1 << N], dp2[1 << N], cnt[3], bads[N];
string ss;
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int len, q;
cin >> len >> q >> ss;
for (int i = 0; i < (1 << len); i++)
{
dp[i] = ss[i] - '0';
dp2[i] = ss[i] - '0';
}
for (int i = 0; i < len; i++)
{
for (int mask = 0; mask < (1 << len); mask++)
{
if (!((mask >> i) & 1)) dp[mask] += dp[mask ^ (1 << i)];
else dp2[mask] += dp2[mask ^ (1 << i)];
}
}
for (int jj = 0; jj < q; jj++)
{
string s2;
# | 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... |