# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161302 | brover29 | Snake Escaping (JOI18_snake_escaping) | C++17 | 2094 ms | 10032 KiB |
#include <bits/stdc++.h>
//qwerty47924692
using namespace std;
using ll = long long;
const ll N=(1ll<<20);
const string br="617283";
#define sz(a)(ll)a.size()
#define f first
#define s second
ll l,q,dp[N];
string s;
ll calc(ll x){
return dp[x];
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>l>>q>>s;
ll n=(1ll<<l);
for(ll i=0;i<n;i++)dp[i]=(s[i]-'0');
for(ll i=0;i<l;i++){
for(ll mask=0;mask<n;mask++){
if((mask>>i)&1){
dp[mask]+=dp[mask-(1ll<<i)];
}
}
}
// cout<<dp[0]<<'\n';
# | 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... |