# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
884700 | theghostking | Palindromic Partitions (CEOI17_palindromic) | C++17 | 179 ms | 30552 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;
#define int long long
const int P = 31;
const int M = 1e9+9;
vector<int> binpow;
vector<int> pref;
int gethash(int l, int r){
int h = ((pref[r+1] - (binpow[r-l+1] * pref[l]))%M + M)%M;
return h;
}
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--){
string s;
cin >> s;
int n = s.size();
binpow.clear();
binpow.resize(n);
binpow[0] = 1;
for (int i = 1; i<n; i++){
binpow[i] = (binpow[i-1]*P) % M;
# | 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... |