oj.uz

Submission #857150

# Submission time Handle Problem Language Result Execution time Memory
857150 2023-10-05T12:57:16 Z lolismek Brperm (RMI20_brperm) C++14
0 / 100
 37 ms 262144 KB 
#include "brperm.h"

#include <iostream>

using namespace std;

const int NMAX = 5e5;
const int LOGMAX = 19;

const int B = 31;
const int MOD = 1e9 + 9;

int dp[NMAX + 1][LOGMAX + 1][LOGMAX + 1];
int powB[NMAX + 1];

int h[NMAX + 1];

void init(int n, const char s[]){
    powB[0] = 1;
    for(int i = 1; i <= n; i++){
        powB[i] = (1ll * powB[i - 1] * B) % MOD;
    }

    for(int i = 1; i <= n; i++){
        h[i] = ((1ll * h[i - 1] * B) % MOD + (s[i - 1] - 'a' + 1)) % MOD;
    }

    int pw = 1, pwind = 0;
    while(pw * 2 <= n){
        pw *= 2;
        pwind++;
    }

    for(int k = pwind; k >= 0; k--){
        for(int i = 1; i <= n; i++){
            dp[i][0][k] = (s[i - 1] - 'a' + 1);
        }
    }

    for(int k = pwind; k >= 0; k--){
        for(int j = 1; (1 << j) <= n; j++){
            for(int i = 1; i <= n; i++){
                if(i + ((1 << j) - 1) * (1 << k) <= n){
                    dp[i][j][k] = ((1ll * dp[i][j - 1][k + 1] * powB[(1 << (j - 1))]) % MOD + dp[i + (1 << k)][j - 1][k + 1]) % MOD;
                }
            }
        }
    }

    return;
}

int query(int i, int k){
    ++i;
    int H1 = dp[i][k][0];
    int H2 = (1ll * h[i + (1 << k) - 1] + MOD - ((1l * h[i - 1] * powB[(1 << k)]) % MOD)) % MOD;

    return (H1 == H2);
}

Subtask #1
0 / 13.0

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

Subtask #2
0 / 37.0

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

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 37 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 Incorrect 1 ms 6492 KB Output isn't correct
2 Halted 0 ms 0 KB -