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>
#include "brperm.h"
using namespace std;
string str;
void init(int n, const char s[]) {
str = s;
}
int rev_bits(int x, int k){
int ans = 0;
for(int i = 0; i < k; i++){
int bt = (x>>i)&1;
ans += bt*(1<<(k-i-1));
}
return ans;
}
int query(int pos, int k){
int len = (1<<k);
string sub = str.substr(pos, len);
for(int i = 0; i < len; i++){
if(sub[i] != sub[rev_bits(i, k)]){
return false;
}
}
return true;
}
# | 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... |