# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125624 | gs14004 | Snake Escaping (JOI18_snake_escaping) | C++17 | 1169 ms | 43256 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 lint;
typedef pair<lint, lint> pi;
const int MAXN = (1<<20) + 5;
int n, q;
int cnt1[MAXN];
int cnt2[MAXN];
int pcnt[MAXN];
char str[MAXN];
char buf[25];
int main(){
scanf("%d %d",&n,&q);
scanf("%s", str);
for(int i=0; i<(1<<n); i++){
if(i) pcnt[i] = pcnt[i-(i&-i)] + 1;
cnt1[i ^ ((1<<n) - 1)] += str[i] - '0';
cnt2[i] += str[i] - '0';
}
for(int i=0; i<n; i++){
for(int j=0; j<(1<<n); j++){
if((j >> i) % 2 == 0){
cnt1[j] += cnt1[j | (1<<i)];
cnt2[j] += cnt2[j | (1<<i)];
}
}
}
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... |