| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 309820 | peuch | Palindromic Partitions (CEOI17_palindromic) | C++17 | 10067 ms | 256 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
int t;
string st1, st2;
vector<string> part;
int ans;
void bt(int cur);
int main(){
	scanf("%d", &t);
	while(t--){
		ans = 0;
		cin >> st1;
		bt(0);
		printf("%d\n", ans);
	}
}
void bt(int cur){
	if(cur == st1.size()){
		if(st2.size() != 0) part.push_back(st2);
		int tam = part.size();
		int cnt = 0;
		bool flag = 1;
		for(int i = 0; i < tam / 2; i++){
			if(part[i] == part[tam - i - 1]) cnt += 2;
			else flag = 0;
		}
		cnt++;
		if(flag) {
			ans = max(ans, cnt);
		}
		if(st2.size() != 0) part.pop_back();
		return;
	}
	string aux = st2;
	st2 += st1[cur];
	part.push_back(st2);
	st2 = "";
	bt(cur + 1);
	st2 = part[part.size() - 1];
	part.pop_back();
	bt(cur + 1);
	st2 = aux;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
