# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023355 | snpmrnhlol | Snake Escaping (JOI18_snake_escaping) | C++17 | 674 ms | 42180 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;
const int N = 20;
int cost[1<<N],cost0[1<<N],cost1[1<<N];
vector <int> pos;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,q;
cin>>n>>q;
for(int i = 0;i < (1<<n);i++){
char ch;
cin>>ch;
ch-='0';
cost[i]+=ch;
cost0[i]+=ch;
cost1[i]+=ch;
}
for(int i = 0;i < n;i++){
for(int j = 0;j < (1<<i);j++){
for(int k = 0;k < (1<<n);k+=(1<<(i + 1))){
cost0[(1<<i) + j + k]+=cost0[j + k];
///0 - 0
///1 - 0 and 1
}
}
}
for(int i = 0;i < n;i++){
for(int j = 0;j < (1<<i);j++){
for(int k = 0;k < (1<<n);k+=(1<<(i + 1))){
Compilation message (stderr)
# | 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... |