oj.uz

Submission #1094831

# Submission time Handle Problem Language Result Execution time Memory
1094831 2024-09-30T16:05:25 Z alexdd Brperm (RMI20_brperm) C++17
50 / 100
 3000 ms 158288 KB 
#include "brperm.h"
#include <bits/stdc++.h>
using namespace std;
int n;
const long long MOD = 1e9+9;
long long p[530005];
long long put(long long a, long long 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];
long long sump[500005];
void init(int copn, const char s[])
{
    n=copn;
    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;

        }
        long long pref=0;
        for(int i=0;i<n;i++)
        {
            pref = (pref + 1LL*s[i]*put(31,1LL*i*(1<<(18-k))))%MOD;
            sump[i] = pref;
        }
        for(int i=0;i+(1<<k)-1<n;i++)
        {
            normal[i][k] = sump[i+(1<<k)-1];
            if(i>0) normal[i][k] = (normal[i][k] + MOD - sump[i-1])%MOD;
            normal[i][k] = normal[i][k]*put(put(31,1LL*i*(1<<(18-k))),MOD-2)%MOD;
        }
    }
}

int query(int i, int k)
{
    if(i+(1<<k)-1 >= n)
        return 0;
    return hsh[i][k] == normal[i][k];
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4696 KB Output is correct
2 Correct 7 ms 4916 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4696 KB Output is correct
2 Correct 7 ms 4916 KB Output is correct
3 Correct 731 ms 36212 KB Output is correct
4 Correct 742 ms 36180 KB Output is correct
5 Correct 738 ms 36220 KB Output is correct

Subtask #3
0 / 17.0

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

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4696 KB Output is correct
2 Correct 7 ms 4916 KB Output is correct
3 Correct 731 ms 36212 KB Output is correct
4 Correct 742 ms 36180 KB Output is correct
5 Correct 738 ms 36220 KB Output is correct
6 Execution timed out 3063 ms 158288 KB Time limit exceeded
7 Halted 0 ms 0 KB -