Submission #245858

#	Time	Username	Problem	Language	Result	Execution time	Memory
245858		Goolakh	Palindromic Partitions (CEOI17_palindromic)	C++17	100 / 100	79 ms	20756 KiB

palindromic

#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Os")

#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair

typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=1e6+10, maxm=1e3+10, lg=21, mod=1e9+7, inf=1e18;

const ll B=619;
ll pw[maxn];

int main(){
	ios_base::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]*B%mod;
	ll T; cin>>T;
	while(T--){
		string s; cin>>s;
		ll l=0,r=SZ(s)-1,sr=0,ans=0,lh=0,rh=0;
		while(l<r){
			lh=(lh*B%mod+(s[l++]-'a'+1))%mod;
			rh=(pw[sr++]*(s[r--]-'a'+1)%mod+rh)%mod;
			if(lh==rh) ans+=2, lh=rh=sr=0;
		}
		cout<<ans+(lh!=0||l==r)<<endl;
	}
 	
	return 0;
}

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