Submission #917770

#	Time	Username	Problem	Language	Result	Execution time	Memory
917770		HaciyevAlik	Palindromic Partitions (CEOI17_palindromic)	C++14	0 / 100	0 ms	348 KiB

palindromic

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9+7,P=47,mx=1e6+5;
ll h[mx],p[mx];
string s;
bool check(int a,int b,int l) {
	ll h1=h[a+l-1]-h[a-1];
	ll h2=h[b+l-1]-h[b-1];
	return 1LL*h1*p[b-a]%mod == h2;
}
void solve() {
	cin >> s;
	int n=int(s.size());
	p[0]=1;
	for(int i=1;i<=n;++i) {	
		p[i]=(p[i-1]*P)%mod;
	}
	for(int i=1;i<=n;++i) {
		h[i]=(h[i-1]+(s[i-1]-'a'+1)*p[i-1])%mod;
		h[i]%=mod;
	}
	int l=1,r=n,res=0;
	while(l<=r) {
		int k=1;
		while(!check(l,r-k+1,k)) {
			++k;
		}
		l+=k,r-=k;
		res+=2;
	}
	cout << res-1;
}
int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int t; cin >> t;
	while(t--) {
		solve();
		cout << '\n';
	}
	return 0;
}

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