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;
const int MAXN = 5e5 + 10;
int Roupas[MAXN], pos[MAXN];
int findK(int num)
{
for (int k = 20; k >= 0; k--) if (num & (1 << k)) return k;
return 0;
}
int inv(int num, int K)
{
int resp = 0;
for (int k = K; k >= 0; k--) resp += (num & (1 << k)) ? (1 << (K - k)) : 0;
return resp;
}
int query(int X, int K)
{
int Y = X + (1 << K) - 1;
int maxK = findK(Y - X);
for (int i = X; i <= Y; i++) pos[i] = inv(i-X, maxK) + X;
for (int i = X; i <= Y; i++) if (Roupas[i] != Roupas[pos[i]]) {return 0;}
return 1;
}
void init(int N, const char s[])
{
for (int i = 0; i < N; i++) Roupas[i] = s[i];
int K = findK(N-1);
for (int i = 0; i < N; i++) pos[i] = inv(i, K);
}
/*int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
init(4, "axxy");
cout << query(0, 2);
}*/
# | 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... |