Submission #967543

#	Time	Username	Problem	Language	Result	Execution time	Memory
967543		KasymK	Palindromes (APIO14_palindrome)	C++17	23 / 100	1031 ms	131072 KiB

palindrome

#include "bits/stdc++.h"

using namespace std;

bool pal(string s){
    int l = 0, r = (int)s.size() - 1;
    while(l < r){
        if(s[l] != s[r])
            return 0;
        l++, r--;
    }
    return 1;
}

int main(){
    string s;
    cin >> s;
    int n = (int)s.size();
    unordered_map<string, int> mp;
    for(int i = 0; i < n; ++i){
        string str = "";
        for(int j = i; j < n; ++j){
            str += s[j];
            if(pal(str))
                mp[str]++;
        }
    }
    int jog = -1;
    for(auto &to : mp)
        jog = max(jog, (int)to.first.size()*to.second);
    printf("%d\n", jog);
    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 15 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 26
• Subtask 5: 0 / 27