제출 #519559

#제출 시각아이디문제언어결과실행 시간메모리
519559MurotYPalindromic Partitions (CEOI17_palindromic)C++14
60 / 100
10043 ms7248 KiB
#include <bits/stdc++.h>
#define ll long long
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first
#define ss second
using namespace std;
const int N=2*1e5+7, M=1e9+7;

int main()
{
	ios;
	int t;
	cin >> t;
	
	while (t--){
		string s;
		cin >> s;
		int l=0, r=s.size()-1, ans=0;
		string lf, rg;
		while (r >= l){
			lf+=s[l];
			rg=s[r]+rg;
			if (lf == rg){
				lf.clear();
				rg.clear();
				ans+=2-(l == r);
			}
			l++;
			r--;
		}
		if (lf.size()) ans++;
		cout << ans <<"\n";
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...