oj.uz

Submission #958981

# Submission time Handle Problem Language Result Execution time Memory
958981 2024-04-07T10:43:49 Z KasymK Palindromes (APIO14_palindrome) C++17
8 / 100
 1000 ms 1480 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 ss) {
    int n = (int)ss.size();
    int k = (int)a.size();
    int cnt = 0, gec = 0;
    while (cnt != n - k + 1) {
        if (ss.substr(cnt, k) == a)
            gec++;
        cnt++;
    }
    return gec;
}

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 504 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 432 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 432 KB Output is correct
15 Correct 1 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 1 ms 348 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 4 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 436 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 7 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 1 ms 436 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 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 1044 ms 348 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 1008 ms 592 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 1046 ms 728 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 1060 ms 1480 KB Time limit exceeded
2 Halted 0 ms 0 KB -