oj.uz

Submission #279907

# Submission time Handle Problem Language Result Execution time Memory
279907 2020-08-22T12:00:11 Z mvanaltvorst Palindromic Partitions (CEOI17_palindromic) C++17
0 / 100
 1 ms 256 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -