oj.uz

Submission #976202

# Submission time Handle Problem Language Result Execution time Memory
976202 2024-05-06T09:34:39 Z JahonaliX Palindromes (APIO14_palindrome) C++17
23 / 100
 1000 ms 9656 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

signed main() {
    string a;
    cin >> a;
    map<string, int> mp;
    int mx = 0, n = a.size();
    for (int i = 0; i < n; ++i) {
        string b = "";
        b += a[i];
        mp[b]++;
        int l = i, r = i;
        while (l > 0 && r < n - 1 && a[l - 1] == a[r + 1]) {
            l--, r++;
            b = a[l] + b + a[r];
            mp[b]++;
        }
    }
    for (int i = 0; i < n - 1; ++i) {
        string b = "";
        int l = i + 1, r = i;
        while (l > 0 && r < n - 1 && a[l - 1] == a[r + 1]) {
            l--, r++;
            b = a[l] + b + a[r];
            mp[b]++;
        }
    }
    for (auto &[x, y] : mp) {
        mx = max(y * (int) x.size(), mx);
    }
    cout << mx;
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 416 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 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 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 432 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 860 KB Output is correct
2 Correct 20 ms 604 KB Output is correct
3 Correct 98 ms 1148 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 92 ms 1064 KB Output is correct
6 Correct 92 ms 888 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 50 ms 848 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 376 KB Output is correct
12 Correct 1 ms 604 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1056 ms 9056 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 1063 ms 9164 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 1020 ms 9656 KB Time limit exceeded
2 Halted 0 ms 0 KB -