oj.uz

Submission #976172

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

using namespace std;

#define int long long

bool is_palindrome(string a) {
    for (int i = 0; i < a.size(); ++i) {
        if (a[i] != a[a.size() - i - 1]) return false;
    }
    return true;
}

signed main() {
    string a;
    cin >> a;
    map<string, int> mp;
    int mx = 0;
    for (int i = 1; i <= a.size(); ++i) {
        for (int j = 0; j <= a.size() - i; ++j) {
            string b = a.substr(j, i);
            mp[b]++;
            if (is_palindrome(b)) mx = max(mp[b] * (int) b.size(), mx);
        }
    }
    cout << mx;
    return 0;
}

Compilation message

palindrome.cpp: In function 'bool is_palindrome(std::string)':
palindrome.cpp:8:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for (int i = 0; i < a.size(); ++i) {
      |                     ~~^~~~~~~~~~
palindrome.cpp: In function 'int main()':
palindrome.cpp:19:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int i = 1; i <= a.size(); ++i) {
      |                     ~~^~~~~~~~~~~
palindrome.cpp:20:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'long long unsigned int' [-Wsign-compare]
   20 |         for (int j = 0; j <= a.size() - i; ++j) {
      |                         ~~^~~~~~~~~~~~~~~

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 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 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 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 2 ms 708 KB Output is correct
22 Correct 2 ms 856 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 856 KB Output is correct
29 Correct 2 ms 856 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 2 ms 860 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 1484 KB Output is correct
2 Runtime error 313 ms 131072 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1038 ms 716 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 1074 ms 600 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 1018 ms 1000 KB Time limit exceeded
2 Halted 0 ms 0 KB -