# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226680 | keta_tsimakuridze | Palindromic Partitions (CEOI17_palindromic) | C++14 | 551 ms | 19044 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;
long long mod,p,t,k,i,pwr[1000005],j,s1,s2,cur,ans;
string s;
int main(){
cin>>t;
p=31;
mod=1e9+7;
pwr[1]=1;
for(k=2;k<=1000005;k++){
pwr[k]=pwr[k-1]*p%mod;
}
while(t--){
cin>>s;
j=s.size()-1;
cur=1;
for(i=0;i<(s.size())/2;i++){
s1+=pwr[cur]*((int)s[i]-'a'+1);
s1%=mod;
s2=s2*p%mod+((int)s[j]-'a'+1);
s2%=mod;
if(s1==s2){
cur=1; s1=s2=0;
ans+=2;
}else cur++;
j--;
} s2=s1=0;
if(cur!=1 || s.size()%2==1) cout<<ans+1<<endl;
else cout<<ans<<endl;
ans=0;
}
}
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... |