Submission #217844

#	Time	Username	Problem	Language	Result	Execution time	Memory
217844		aloo123	Palindromic Partitions (CEOI17_palindromic)	C++14	0 / 100	4 ms	384 KiB

palindromic

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define endl "\n"
#define pll pair<ll,ll>
#define all(x) (x).begin() , (x).end()
#define f first
#define s second
using namespace std;
 
const ll N =(2e5+5);
const ll MOD = 998244353;
const ll INF = 1e16;
const ll LOG = 25;
 
long long binpow(long long a, long long b) {
     a %= MOD;
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = (res * a)%MOD ;
        a = (a * a)%MOD ;
        b >>= 1;
    }
    res%=MOD;
    return res;
}

void solve(){
    string s;
    cin>>s;
    ll n = (ll)s.size();

    ll l= 0,r= n -1;
    string a;
    string b;
    ll ans = 0;
    while(l < r){
        a+=s[l];
        b+=s[r];
        string c =b;reverse(all(c));
        if(c == a){
            ans += 2;
            a="";
            b="";
        }
        l++,r--;
    }
    ans++;ans=min(ans,n);
    cout<<ans<<endl;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    ll t;cin>>t;
    while(t--){
        solve();
    }



    return 0;     
    
        
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 20
• Subtask 3: 0 / 25
• Subtask 4: 0 / 40