# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
535333 | amunduzbaev | Snake Escaping (JOI18_snake_escaping) | C++17 | 851 ms | 65536 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;
#define ar array
const int N = 20;
int dp[2][1 << N ][N];
int a[1 << N];
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
int n, m; cin>>n>>m;
for(int i=0;i<(1 << n);i++){
char c; cin>>c;
a[i] = c - '0';
}
for(int mask=(1 << n) - 1;~mask;mask--){
int res = a[mask];
for(int i=n-1;~i;i--){
if(!(mask >> i & 1)){
res += dp[0][mask | (1 << i)][i];
}
dp[0][mask][i] = res;
}
}
for(int mask=0;mask<(1 << n);mask++){
int res = a[mask];
for(int i=n-1;~i;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... |