Submission #585589

#TimeUsernameProblemLanguageResultExecution timeMemory
585589tengiz05Palindromic Partitions (CEOI17_palindromic)C++17
15 / 100
1 ms340 KiB
#include <bits/stdc++.h>

using i64 = long long;
using namespace std;

void solve() {
    string s;
    cin >> s;
    
    int n = s.size();
    
    vector<int> a(26), b(26);
    
    int ans = 0;
    
    for (int i = 0; i < n / 2; i++) {
        a[s[i] - 'a']++;
        b[s[n - i - 1] - 'a']++;
        if (a == b) {
            ans += 2;
        }
    }
    
    ans += n % 2 != 0 || a != b;
    
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t;
    cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...