oj.uz

Submission #468929

# Submission time Handle Problem Language Result Execution time Memory
468929 2021-08-30T08:21:51 Z Autumn Palindromic Partitions (CEOI17_palindromic) C++17
0 / 100
 1 ms 316 KB 
#include <bits/stdc++.h>
using namespace std;

#define int int64_t

bool check(int s1, int s2, int l, string s){
    for(int i=0;i<l;i++){
        if(s[s1]!=s[s2])return false;
        s1++;
        s2++;
    }
    return true;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    for(int T=0;T<t;T++){
        string s;
        cin>>s;
        int n=s.size();
        int pal=1;
        int is=0;
        int jcurr=n-1;
        int jend=n;
        
        while(jcurr>=(n+1)/2){    
            if(s[is]==s[jcurr]){
                if(check(is,jcurr,jend-jcurr, s)){
                    pal+=2;
                    is+=(jend-jcurr);
                    jend=jcurr;
                    
                }
                
            }
            jcurr--;
        }
        cout<<pal<<"\n";


    }
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 316 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 316 KB Output isn't correct
2 Halted 0 ms 0 KB -