oj.uz

Submission #107949

# Submission time Handle Problem Language Result Execution time Memory
107949 2019-04-26T10:02:57 Z SamAnd Palindromes (APIO14_palindrome) C++17
23 / 100
 718 ms 132096 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 10004;
const long long P = 31;

int n;
char aa[N], a[N];

long long ast[N];
long long p[N], s[N];

bool pal(int l, int r)
{
    return (p[r] - p[l - 1]) * ast[n - r] == (s[l] - s[r + 1]) * ast[l - 1];
}

int z;
int t[N * 1000][26];
int b[N * 1000];

int main()
{
    cin >> aa;
    n = strlen(aa);
    for (int i = 1; i <= n; ++i)
        a[i] = aa[i - 1];

    ast[0] = 1;
    for (int i = 1; i <= n; ++i)
        ast[i] = ast[i - 1] * P;

    for (int i = 1; i <= n; ++i)
        p[i] = p[i - 1] + ast[i - 1] * (a[i] - 'a' + 1);
    for (int i = n; i >= 1; --i)
        s[i] = s[i + 1] + ast[n - i] * (a[i] - 'a' + 1);

    for (int l = 1; l <= n; ++l)
    {
        int pos = 0;
        for (int r = l; r <= n; ++r)
        {
            if (t[pos][a[r] - 'a'] == 0)
                t[pos][a[r] - 'a'] = ++z;
            pos = t[pos][a[r] - 'a'];
            b[pos]++;
        }
    }

    int ans = 0;
    for (int l = 1; l <= n; ++l)
    {
        int pos = 0;
        for (int r = l; r <= n; ++r)
        {
            pos = t[pos][a[r] - 'a'];
            if (pal(l, r))
                ans = max(ans, b[pos] * (r - l + 1));
        }
    }

    cout << ans << endl;
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 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 3 ms 384 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 432 KB Output is correct
16 Correct 3 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 3 ms 384 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 2 ms 768 KB Output is correct
23 Correct 3 ms 512 KB Output is correct
24 Correct 3 ms 768 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 3 ms 768 KB Output is correct
27 Correct 3 ms 768 KB Output is correct
28 Correct 3 ms 768 KB Output is correct
29 Correct 3 ms 896 KB Output is correct
30 Correct 4 ms 896 KB Output is correct
31 Correct 4 ms 896 KB Output is correct
32 Correct 3 ms 768 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 640 KB Output is correct
2 Correct 43 ms 28536 KB Output is correct
3 Correct 7 ms 432 KB Output is correct
4 Correct 77 ms 47476 KB Output is correct
5 Correct 8 ms 512 KB Output is correct
6 Correct 8 ms 512 KB Output is correct
7 Correct 62 ms 35960 KB Output is correct
8 Correct 13 ms 640 KB Output is correct
9 Correct 74 ms 49144 KB Output is correct
10 Correct 72 ms 52728 KB Output is correct
11 Correct 67 ms 52728 KB Output is correct
12 Correct 73 ms 40568 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 718 ms 2688 KB Output is correct
2 Runtime error 174 ms 132096 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 26 ms 384 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 29 ms 384 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -