# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519490 | 2022-01-26T12:23:10 Z | Stickfish | Brperm (RMI20_brperm) | C++17 | 7 ms | 2944 KB |
#include "brperm.h" #include <cassert> #include <string> #include <iostream> #include <vector> using namespace std; using ll = long long; const int MAXN = 500008; string s; void init(int n, const char s_[]) { 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 query(int l, int k) { assert(k < 10 && l + (1 << k) <= s.size()); 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; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 452 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 452 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 2944 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 452 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |