# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362641 | shahriarkhan | Palindromic Partitions (CEOI17_palindromic) | C++14 | 284 ms | 19292 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 ;
const int mx = 1e6 + 5 ;
const long long base = 31 , mod = 1e9 + 7 ;
long long pw[mx] ;
int main()
{
int t ;
scanf("%d",&t) ;
pw[0] = 1 ;
for(int i = 1 ; i < mx ; ++i)
{
pw[i] = (pw[i-1]*base)%mod ;
}
while(t--)
{
string s ;
cin>>s ;
int siz = s.size() , l = 0 , r = siz - 1 , p = 0 , ans = 0 ;
long long h1 = 0 , h2 = 0 ;
while(l<r)
{
h1 = ((h1*base)%mod + s[l++])%mod ;
h2 = (h2 + (pw[p++]*s[r--])%mod)%mod ;
if(h1==h2)
{
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... |