제출 #279907

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
279907		mvanaltvorst	Palindromic Partitions (CEOI17_palindromic)	C++17	0 / 100	1 ms	256 KiB

palindromic

#include <iostream>
#include <string>
#include <vector>

using namespace std;

bool isPalindrome(vector<char> &lbuf, vector<char> &rbuf, int len) {
	int i = 0;
	int j = len - 1;
	while (j >= 0) {
		if (lbuf[i] != rbuf[j]) return false;
		j--;
		i++;
	}
	return true;
}

int main() {
	int t;
	cin >> t;
	for (int z = 0; z < t; z++) {
		string input;
		cin >> input;

		int l = 0, r = input.size() - 1;
		vector<char> lbuf;
		vector<char> rbuf;
		int bufSize = 0;
		int ans = 1;
		while (l < r) {
			lbuf.push_back(input[l]);
			rbuf.push_back(input[r]);
			bufSize++;
			l++;
			r--;
			if (isPalindrome(lbuf, rbuf, bufSize)) {
				ans += 2;
				lbuf.clear();
				rbuf.clear();
				bufSize = 0;
			}
		}
		cout << ans << endl;
	}
}

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