# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230645 | islingr | Palindromic Partitions (CEOI17_palindromic) | C++14 | 109 ms | 22160 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(x, v) for (auto &x : v)
#define sz(x) int((x).size())
using ll = long long;
constexpr ll p = 5, M = 1e9 + 7, N = 1 << 20;
string s; int n;
ll pp[N], pref[N];
void init() {
rep(i, 0, n) pref[i + 1] = (pref[i] + pp[i] * (s[i] - 'a' + 1)) % M;
}
ll hsh(int l, int r) { // [l, r]
int ret = pref[r + 1] - pref[l];
ret = ret * pp[n - l] % M;
if (ret < 0) ret += M;
return ret;
}
int solve() {
cin >> s; n = sz(s);
init();
int cnt = 0;
int x = 0, y = n - 1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |