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 "brperm.h"
#include <bits/stdc++.h>
using namespace std;
string S;
void init(int n, const char s[]) {
S=s;
}
int query(int ind, int k) {
for (int i=ind; i<ind+(1<<k); ++i) {
int j=0;
for (int b=k-1; b>=0; --b) {
j+=(((i-ind)>>b)&1)<<(k-1-b);
}
if (S[i]!=S[ind+j]) return 0;
}
return 1;
}
# | 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... |