oj.uz

Submission #560903

# Submission time Handle Problem Language Result Execution time Memory
560903 2022-05-12T04:44:17 Z Yazan_Alattar Palinilap (COI16_palinilap) C++14
17 / 100
 1000 ms 468 KB 
#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.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 10 ms 324 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 2 ms 328 KB Output is correct
5 Correct 2 ms 212 KB Output is correct

Subtask #2
0 / 37.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 212 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 46.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 468 KB Time limit exceeded
2 Halted 0 ms 0 KB -