oj.uz

Submission #858068

# Submission time Handle Problem Language Result Execution time Memory
858068 2023-10-07T11:29:37 Z boris_mihov Brperm (RMI20_brperm) C++17
50 / 100
 300 ms 262144 KB 
#include "brperm.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>

typedef long long llong;
const int MAXN = 500000 + 10;
const int MOD = 998244353;
const int MAXLOG = 20;

int n;
char s1[MAXN];
int base[3 * MAXN];

struct Sparse
{
    int normalHash[MAXN][MAXLOG];
    int danceHash[MAXN][MAXLOG][MAXLOG];

    void build()
    {
        for (int i = 0 ; i < n ; ++i)
        {
            normalHash[i][0] = s1[i] - 'a' + 1;
            for (int lgH = 0 ; lgH < MAXLOG ; ++lgH)
            {
                danceHash[i][0][lgH] = s1[i] - 'a' + 1;
            }
        }

        for (int lgLen = 1 ; (1 << lgLen) <= n ; ++lgLen)
        {
            for (int i = 0 ; i + (1 << lgLen) <= n ; ++i)
            {
                normalHash[i][lgLen] = (1LL * base[(1 << (lgLen - 1))] * normalHash[i][(lgLen - 1)] + 1LL * normalHash[i + (1 << (lgLen - 1))][(lgLen - 1)]) % MOD;
                for (int lgH = 0 ; lgH + 1 < MAXLOG ; ++lgH)
                {
                    danceHash[i][lgLen][lgH] = (1LL * base[1 << lgH] * danceHash[i][(lgLen - 1)][lgH + 1] + 1LL * danceHash[i + (1 << (lgLen - 1))][(lgLen - 1)][lgH + 1]) % MOD;
                }
            }        
        }
    }

    int query(int idx, int log)
    {
        if ((idx + (1 << log)) > n) return 0;
        return normalHash[idx][log] == danceHash[idx][log][0];
    }
};

Sparse sparse;
void init(int N, const char S[]) 
{
    n = N;
    for (int i = 0 ; i < n ; ++i)
    {
        s1[i] = S[i];
    }

    base[0] = 1;
    for (int i = 1 ; i < 3 * MAXN ; ++i)
    {
        base[i] = (27LL * base[i - 1]) % MOD;
    }

    sparse.build();
}

int query(int idx, int log) 
{
    return sparse.query(idx, log);
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11352 KB Output is correct
2 Correct 9 ms 11356 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11352 KB Output is correct
2 Correct 9 ms 11356 KB Output is correct
3 Correct 291 ms 176904 KB Output is correct
4 Correct 297 ms 176908 KB Output is correct
5 Correct 300 ms 176976 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 39 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 11352 KB Output is correct
2 Correct 9 ms 11356 KB Output is correct
3 Correct 291 ms 176904 KB Output is correct
4 Correct 297 ms 176908 KB Output is correct
5 Correct 300 ms 176976 KB Output is correct
6 Runtime error 39 ms 262144 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -