Submission #346112

#	Time	Username	Problem	Language	Result	Execution time	Memory
346112		ali_tavakoli	Palindromic Partitions (CEOI17_palindromic)	C++14	100 / 100	78 ms	19080 KiB

palindromic

//In The Name Of Allah
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
#define pb push_back
#define F first
#define S second
//#pragma GCC optimize("Ofast")

const int maxn = 1e6 + 5, base = 29, md = 1e9 + 7;

int t, n;
ll pw[maxn];
string s;

void solve()
{
    cin >> s;
    ll h1 = 0, h2 = 0;
    int a = 0, b = s.size() - 1, p = 0, ans = 0;
    while(a < b)
    {
        h1 = ((h1 * base % md) + s[a ++]) % md;
        h2 = (h2 + pw[p ++] * s[b --] % md) % md;
        if(h1 == h2)
        {
            ans += 2;
            h1 = h2 = p = 0;
        }
    }
    if(h1 != h2|| a == b)
        ans ++;
    cout << ans << '\n';
}

int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    pw[0] = 1;
    for(int i = 1; i < maxn; i++)
        pw[i] = pw[i - 1] * base % md;
    cin >> t;
    while(t --)
        solve();
}

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