oj.uz

Submission #107879

# Submission time Handle Problem Language Result Execution time Memory
107879 2019-04-26T05:59:14 Z SamAnd Palindromes (APIO14_palindrome) C++17
8 / 100
 1000 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 102;

int n;
char a[N];

int main()
{
    cin >> a;
    n = strlen(a);
    int ans = 0;
    for (int l = 0; l < n; ++l)
    {
        for (int r = l; r < n; ++r)
        {
            bool z = true;
            for (int i = l, j = r; i <= r; ++i, --j)
            {
                if (a[i] != a[j])
                {
                    z = false;
                    break;
                }
            }
            if (!z)
                continue;
            int q = 0;
            for (int ll = 0; ll <= n - (l - r + 1); ++ll)
            {
                int rr = ll + (l - r + 1) - 1;
                z = true;
                for (int i = l, j = ll; i <= r; ++i, ++j)
                {
                    if (a[i] != a[j])
                    {
                        z = false;
                        break;
                    }
                }
                if (z)
                    ++q;
            }
            ans = max(ans, (r - l + 1) * q);
        }
    }
    cout << ans << endl;
    return 0;
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:31:21: warning: unused variable 'rr' [-Wunused-variable]
                 int rr = ll + (l - r + 1) - 1;
                     ^~

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -