# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853365 | anhduc2701 | Snake Escaping (JOI18_snake_escaping) | C++17 | 674 ms | 34256 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>
#define pb push_back
#define fi first
#define se second
#define BIT(x,i) (((x)>>(i))&1)
using namespace std;
typedef long long ll;
int dp[1<<20];
int dp1[1<<20];
int l,q;
int sum=0;
string a;
signed main(){
// freopen("input.inp","r",stdin);
// freopen("output.out","w",stdout);
cin.tie(0),cout.tie(0)->sync_with_stdio(0);
cin >> l >> q;
cin >> a;
for(int i=0;i<(1<<l);i++){
int num=a[i]-'0';
dp[i]=num;
dp1[i]=num;
}
for(int i=0;i<l;i++){
for(int j=0;j<(1<<l);j++){
if((1<<i)&j)dp[j]+=dp[j^(1<<i)];
else dp1[j]+=dp1[j^(1<<i)];
}
}
for(int i=1;i<=q;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... |