제출 #1332527

#제출 시각아이디문제언어결과실행 시간메모리
1332527WarinchaiPalindromic Partitions (CEOI17_palindromic)C++20
60 / 100
10089 ms18816 KiB
#include<bits/stdc++.h>
#define int long long
using namespace std;

int md=1e9+7;
int val[1000005];
int sum[1000005];
int pw[10000005];

int same(int l,int r,int st,int en){
    for(int i=l;i<=r;i++){
        if(val[i]!=val[st])return 0;
        st++;
    }
    return 1;
}

int fans(int st,int en){
    int l=st,r=en;
    int pre=0,suf=0,ln=0;
    if(st==en)return 1;
    if(st>en)return 0;
    while(st<en){
        pre=(pre*26+val[st]);
        suf=(val[en]*pw[ln]+suf);
        if(same(l,st,en,r)){
            return 2+fans(st+1,en-1);
        }
        ln++;
        st++,en--;
    }
    return 1;
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t;cin>>t;
    pw[0]=1;
    while(t--){
        string s;cin>>s;
        int n=s.size();
        for(int i=1;i<=n;i++)pw[i]=(pw[i-1]*26)%md;
        for(int i=1;i<=n;i++){
            val[i]=s[i-1]-'a';
        }
        cout<<fans(1,n)<<"\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...