Submission #560903

#	Time	Username	Problem	Language	Result	Execution time	Memory
560903		Yazan_Alattar	Palinilap (COI16_palinilap)	C++14	17 / 100	1093 ms	468 KiB

palinilap

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 5007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

string s;
int n, ans;

int solve(){
    int ret = 0;

    for(int i = 1; i <= n; ++i){
        int l = i, r = i;
        while(l && r <= n){
            if(s[l] != s[r]) break;
            ++ret;
            --l; ++r;
        }

        l = i, r = i + 1;
        while(l && r <= n){
            if(s[l] != s[r]) break;
            ++ret;
            --l; ++r;
        }
    }
    return ret;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> s;
    n = s.size(); s = '#' + s;

    for(int i = 1; i <= n; ++i){
        char c = s[i];

        for(int j = 0; j < 26; ++j){
            s[i] = char('a' + j);
            ans = max(ans, solve());
        }
        s[i] = c;
    }

    cout << ans << endl;
    return 0;
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 37
• Subtask 3: 0 / 46