oj.uz

Submission #959056

# Submission time Handle Problem Language Result Execution time Memory
959056 2024-04-07T12:39:42 Z KasymK Palindromes (APIO14_palindrome) C++17
8 / 100
 1000 ms 1564 KB 
#include <bits/stdc++.h>
using namespace std;

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

int occ(string a, string s){
    int n = (int)s.size();
    int k = (int)a.size();
    string window = "";
    int ret = 0;
    for(int i = 0; i < k; ++i)
        window += s[i];
    if(window == a)
        ret++;
    // time complexity if erase is O(n + m)
    for(int i = k; i < n; ++i){
        window += s[i];
        window.erase(0, 1);
        if(window == a)
            ret++;
    }
    return ret;
}

int main(){
    string s;
    cin >> s;
    int n = (int)s.size();
    int mx = INT_MIN;
    for (int i = 0; i < n; ++i)
        for (int j = 1; j <= n - i; ++j) {
            string a = s.substr(i, j);
            if (pal(a)){
                int ret = a.size() * occ(a, s);
                mx = max(mx, ret);
            }
        }
    cout << mx << "\n";
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct

Subtask #2
0 / 15.0

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

Subtask #3
0 / 24.0

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

Subtask #4
0 / 26.0

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

Subtask #5
0 / 27.0

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