oj.uz

Submission #1094647

# Submission time Handle Problem Language Result Execution time Memory
1094647 2024-09-30T08:02:46 Z alexdd Brperm (RMI20_brperm) C++17
0 / 100
 3000 ms 2128 KB 
#include "brperm.h"
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+9;
long long p[530005];
int put(int a, int exp)
{
    if(exp==0)
        return 1;
    if(exp%2==0)
        return put(a*a%MOD,exp/2);
    else
        return put(a*a%MOD,exp/2)*a%MOD;
}
int rev(int x, int k)
{
    int aux=0;
    for(int i=0;i<k;i++)
        if(((1<<i)&x))
            aux += (1<<(k-i-1));
    return aux;
}
long long hsh[500005][19];
long long normal[500005][19];
char S[500005];
void init(int n, const char copS[])
{
    for(int i=0;i<n;i++)
        S[i] = copS[i];
    /*p[0]=1;
    p[1]=31;
    for(int i=2;i<=(1<<19);i++)
        p[i] = (p[i-1]*p[1])%MOD;

    for(int i=0;i<n;i++)
    {
        hsh[i][0] = normal[i][0] = S[i];
    }
    for(int k=1;k<19;k++)
    {
        for(int i=0;i+(1<<k)-1<n;i++)
        {
            hsh[i][k] = (hsh[i][k-1] + hsh[i+(1<<(k-1))][k-1]*p[(1<<(18-k))])%MOD;

            for(int j=0;j<(1<<k);j++)
            {
                normal[i][k] = (normal[i][k] + S[i+j]*p[j*(1<<(18-k))])%MOD;
            }

        }
    }*/
}

int query(int i, int k)
{
    for(int j=0;j<(1<<k);j++)
        if(S[i+j]!=S[i+rev(j,k)])
            return 0;
    return 1;
    return hsh[i][k] == normal[i][k];
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3032 ms 2128 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -