oj.uz

Submission #519897

# Submission time Handle Problem Language Result Execution time Memory
519897 2022-01-27T14:17:56 Z Stickfish Brperm (RMI20_brperm) C++17
0 / 100
 99 ms 2356 KB 
#include "brperm.h"
#include <cassert>
#include <string>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

const int MAXN = 500008;
int N;
string s;

void init(int n, const char s_[]) {
    N = n;
    for (int i = 0; i < n; ++i)
        s.push_back(s_[i]);
    return;
    //ll raymoo = 1;
    //for (int i = 0; i < n; ++i) {
        //phash[i] = (phash[i - 1] + raymoo * (s[i] - 'a')) % MOD;
        //raymoo = (raymoo * MUL) % MOD;
        //cout << phash[i] << ' ';
    //}
    //cout << endl;
    //return;
}

int lg2(int n) {
    int cnt = 0;
    while (n > 1) {
        n >>= 1;
        ++cnt;
    }
    return cnt;
}

int query(int i, int k) {
    int l = i;
    //return 0;
    //assert(k == (1 << lg2(k)));
    //k = lg2(k);
    assert(k != 20);
    //assert((1 << k) <= N);
    //assert(l + (1 << k) <= MAXN);
    return 0;
    vector<int> ps = {0};
    for (int t = 0; t < k; ++t) {
        for (int i = 0; i < (1 << t); ++i)
            ps.push_back(ps[i] + (1 << (k - t - 1)));
    }
    for (int i = 0; i < (1 << k); ++i) {
        if (s[l + i] != s[l + ps[i]])
            return 0;
    }
    return 1;
}

Subtask #1
0 / 13.0

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

Subtask #3
0 / 17.0

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

Subtask #4
0 / 33.0

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