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 <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>
using namespace std;
typedef long long ll;
ll inv(ll n, ll sz){
if(sz == 0)
return 0;
string a;
for(int i = sz - 1; i >= 0; i--){
if((n >> i) % 2 != 0)
a += "1";
else
a += "0";
}
reverse(a.begin(), a.end());
ll n2 = 0, j = 0;
for(int i = sz - 1; i >= 0; i--){
if(a[j] == '1')
n2 += (1 << i);
j++;
}
return n2;
}
string a;
ll N;
void init(int n, const char s[]) {
N = n;
for(int i = 0; i < n; i++)
a.push_back(s[i]);
return;
}
int query(int l, int k) {
if(l + (1 << k) - 1 > N)
return 0;
for(int i = 0; i < (1 << k); i++)
if(a[l + i] != a[l + inv(i, k)])
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... |