# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
519603 |
2022-01-26T18:59:54 Z |
Stickfish |
Brperm (RMI20_brperm) |
C++17 |
|
6 ms |
2684 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 l, int k) {
assert(k == (1 << lg2(k)));
k = lg2(k);
//assert(l + (1 << k) <= N + 1000);
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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
6 ms |
2684 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |