# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
243284 | Lawliet | Palindromic Partitions (CEOI17_palindromic) | C++17 | 644 ms | 17840 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 <bits/stdc++.h>
using namespace std;
typedef long long int lli;
const int MAXN = 1000010;
int prime = 31;
int mod = 1000000009;
int n;
lli pot[MAXN];
lli pHash[MAXN];
string s;
int getHash(int L, int R)
{
lli ans = pHash[R + 1];
ans -= pHash[L]*pot[R - L + 1];
ans %= mod;
if( ans < 0 ) ans += mod;
return (int)ans;
}
int main()
{
# | 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... |