# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
135076 | wilwxk | Palindromes (APIO14_palindrome) | C++14 | 1078 ms | 7672 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 ll;
const int MAXN=3e5+5;
const ll MOD=1e9+9;
const ll P=257;
char c[MAXN];
ll h[MAXN], rh[MAXN];
ll pot[MAXN];
int n;
ll respf=0;
ll ghash(int ini, int fim) {
ll val=0;
if(ini<=fim) {
if(ini!=0) val=h[ini-1];
val*=pot[fim-ini+1]; val%=MOD;
val=h[fim]-val;
while(val<0) val+=MOD;
}
else {
if(ini!=n-1) val=rh[ini+1];
val*=pot[ini-fim+1]; val%=MOD;
val=rh[fim]-val;
while(val<0) val+=MOD;
}
return val;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |