# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1070113 | Sorting | Brperm (RMI20_brperm) | C++17 | 25 ms | 42520 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>
#include "brperm.h"
#define MAXN 100010 //500010
#define LOGN 25
using namespace std;
long long tab[MAXN][LOGN];
string str="";
//transition: x-> r*(2^(k-bits)), bits=log2(x), r=transition for x in base form
//unchanged: 2^(k/2)*fl, fl=1 for k%2=0, otherwise fl=2
//changed: (2^k - unchanged)/2
void init(int n, const char s[])
{
str = "";
for(int i=0;i<n;i++)str +=s[i];
for(int j=0;j<=20;j++){tab[0][j]=0;}
for(int i=1;i<=n;i++)
{
int logx=log2(i)+1;
int si=i,cntr=1;
long long m=0;
while(si>0)
{
bool bit=si&1;
long long ncalc=logx-cntr;
ncalc=1<<ncalc;
m+=bit*ncalc;
si>>=1;
cntr++;
}
tab[i][logx]=m;
for(int j=logx+1;j<=20;j++)
{
tab[i][j]=tab[i][j-1]<<1;
}
}
}
int query(int i, int k)
{
int lim=(1<<k);
//if(i+lim>=(int)str.size())return 0;
for(int curr=0;curr<lim;curr++)
{
if(i+curr>=str.size())return 0;
if(str[i+curr]!=str[i+tab[curr][k]])return 0;
}
return 1;
}
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... |