Submission #1130083

#	Time	Username	Problem	Language	Result	Execution time	Memory
1130083		nabeul001	Palindromic Partitions (CEOI17_palindromic)	C++20	0 / 100	0 ms	320 KiB

palindromic

#include <bits/stdc++.h>
using namespace std;

// Helper function to check if a substring is a palindrome
bool is_palindrome(const string &s, int l, int r) {
    while (l < r) {
        if (s[l] != s[r]) return false;
        l++;
        r--;
    }
    return true;
}

int max_palindromic_partition(const string &s) {
    int n = s.size();
    int chunks = 0;
    int i = 0;
    while (i < n) {
        for (int j = n - 1; j >= i; --j) {
            if (is_palindrome(s, i, j)) {
                chunks++;
                i = j + 1;  // Move past the current palindrome
                break;
            }
        }
    }
    return chunks;
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        string s;
        cin >> s;
        cout << max_palindromic_partition(s) << "\n";
    }
    return 0;
}

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