# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853890 | willychan | Snake Escaping (JOI18_snake_escaping) | C++14 | 1030 ms | 43252 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;
//#include<bits/extc++.h>
//__gnu_pbds
int main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int n,q;cin>>n>>q;
vector<int> normal(1<<n);
vector<int> sum1(1<<n);
vector<int> sum0(1<<n);
string s;cin>>s;
for(int i=0;i<(1<<n);i++){
normal[i] = s[i]-'0';
sum1[i]=normal[i];
sum0[i]=normal[i];
}
for(int j=0;j<n;j++){
for(int i=0;i<(1<<n);i++){
if((i>>j)&1) sum1[i]+=sum1[i^(1<<j)];
}
}
for(int j=0;j<n;j++){
for(int i=(1<<n)-1;i>=0;i--){
if(!((i>>j)&1)) sum0[i]+=sum0[i^(1<<j)];
}
# | 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... |