# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996958 | jpfr12 | Palindromes (APIO14_palindrome) | C++17 | 1062 ms | 6356 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>
typedef long long ll;
typedef unsigned long long int ull;
using namespace std;
const int MOD = (int)1e9+9;
int MAXN = 1e6;
//classes
//global
string str;
int n;
vector<ll> str_hash;
map<ll,ll> Map;
map<ll,int> Len;
void computeHash(){
ll m = 1e9+9;
ll p = 31;
ll pow_p = 1;
for(int i = 1; i <= n; i++){
str_hash[i] = (str_hash[i-1] + (str[i-1] - 'a'+1)*pow_p)%m;
pow_p = (pow_p*p)%m;
}
}
void sol(int left, int right){
# | 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... |