제출 #163343

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
163343		alishahali1382	Palindromic Partitions (CEOI17_palindromic)	C++14	100 / 100	57 ms	11232 KiB

palindromic

#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 100010, Base=10007, Mod=1e9+9;

int n, m, k, u, v, x, y, t, a, b;
int A[MAXN];
string s;

void solve(){
	cin>>s;
	int ans=0;
	ll h1=0, h2=0, tav=1;
	n=s.size();
	for (int i=0; i<n-i-1; i++){
		h1=(h1*Base + (s[i]-'a'+1))%Mod;
		h2=((s[n-i-1]-'a'+1)*tav + h2)%Mod;
		tav=tav*Base%Mod;
		if (h1==h2){
			ans+=2;
			h1=h2=0;
			tav=1;
		}
	}
	if (h1!=h2 || n&1) ans++;
	cout<<ans<<'\n';
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	int T;
	cin>>T;
	while (T--) solve();
	
	return 0;
}
/*
4
bonobo
deleted
racecar
racers

1
abcdcba

*/

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