Submission #553261

# Submission time Handle Problem Language Result Execution time Memory
553261 2022-04-25T09:12:07 Z tht2005 Palindromes (APIO14_palindrome) C++17
100 / 100
27 ms 35036 KB
#include <bits/stdc++.h>

using namespace std;

const int N = 300005;
int n;
long long res;
char s[N];
int nNode, edge[N][26], link[N], len[N], f[N];

int main() {
    scanf("%s", s);
    n = strlen(s);
    len[0] = -1; link[0] = 0;
    len[1] = 0; link[1] = 0;
    nNode = 2;
    memset(edge, 0xff, sizeof(edge));
    for(int i = 0, cur = 0; i < n; ++i) {
        int c = s[i] - 'a', p = cur;
        while(s[i - 1 - len[p]] != s[i]) p = link[p];
        if(edge[p][c] == -1) {
            edge[p][c] = nNode;
            len[nNode] = len[p] + 2;
            int q = link[p];
            while(s[i - 1 - len[q]] != s[i]) q = link[q];
            if(p)
                link[nNode] = edge[q][c];
            else
                link[nNode] = 1;
            ++nNode;
        }
        cur = edge[p][c];
        ++f[cur];
    }
    res = 0;
    for(int i = nNode; i--; ) {
        f[link[i]] += f[i];
        res = max(res, (long long)len[i] * f[i]);
    }
    printf("%lld", res);
    return 0;
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%s", s);
      |     ~~~~~^~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 15 ms 30764 KB Output is correct
2 Correct 16 ms 30804 KB Output is correct
3 Correct 14 ms 30780 KB Output is correct
4 Correct 18 ms 30776 KB Output is correct
5 Correct 16 ms 30832 KB Output is correct
6 Correct 13 ms 30804 KB Output is correct
7 Correct 13 ms 30804 KB Output is correct
8 Correct 17 ms 30776 KB Output is correct
9 Correct 15 ms 30772 KB Output is correct
10 Correct 14 ms 30748 KB Output is correct
11 Correct 15 ms 30776 KB Output is correct
12 Correct 18 ms 30756 KB Output is correct
13 Correct 19 ms 30776 KB Output is correct
14 Correct 15 ms 30804 KB Output is correct
15 Correct 14 ms 30804 KB Output is correct
16 Correct 15 ms 30844 KB Output is correct
17 Correct 14 ms 30804 KB Output is correct
18 Correct 14 ms 30804 KB Output is correct
19 Correct 14 ms 30804 KB Output is correct
20 Correct 15 ms 30772 KB Output is correct
21 Correct 14 ms 30764 KB Output is correct
22 Correct 14 ms 30776 KB Output is correct
23 Correct 14 ms 30804 KB Output is correct
24 Correct 14 ms 30820 KB Output is correct
25 Correct 15 ms 30776 KB Output is correct
26 Correct 17 ms 30796 KB Output is correct
27 Correct 14 ms 30796 KB Output is correct
28 Correct 17 ms 30732 KB Output is correct
29 Correct 14 ms 30828 KB Output is correct
30 Correct 13 ms 30804 KB Output is correct
31 Correct 14 ms 30804 KB Output is correct
32 Correct 17 ms 30848 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 30752 KB Output is correct
2 Correct 13 ms 30804 KB Output is correct
3 Correct 13 ms 30784 KB Output is correct
4 Correct 14 ms 30804 KB Output is correct
5 Correct 13 ms 30804 KB Output is correct
6 Correct 14 ms 30804 KB Output is correct
7 Correct 14 ms 30804 KB Output is correct
8 Correct 14 ms 30804 KB Output is correct
9 Correct 14 ms 30824 KB Output is correct
10 Correct 14 ms 30804 KB Output is correct
11 Correct 16 ms 30804 KB Output is correct
12 Correct 14 ms 30832 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 30912 KB Output is correct
2 Correct 15 ms 30880 KB Output is correct
3 Correct 15 ms 30912 KB Output is correct
4 Correct 15 ms 30924 KB Output is correct
5 Correct 16 ms 30900 KB Output is correct
6 Correct 14 ms 30908 KB Output is correct
7 Correct 14 ms 30880 KB Output is correct
8 Correct 15 ms 30804 KB Output is correct
9 Correct 15 ms 30860 KB Output is correct
10 Correct 16 ms 30976 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 19 ms 32180 KB Output is correct
2 Correct 17 ms 32160 KB Output is correct
3 Correct 19 ms 32088 KB Output is correct
4 Correct 18 ms 32196 KB Output is correct
5 Correct 18 ms 32192 KB Output is correct
6 Correct 18 ms 31804 KB Output is correct
7 Correct 18 ms 31900 KB Output is correct
8 Correct 16 ms 30992 KB Output is correct
9 Correct 16 ms 31224 KB Output is correct
10 Correct 16 ms 31956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 25 ms 34892 KB Output is correct
2 Correct 25 ms 34916 KB Output is correct
3 Correct 26 ms 34872 KB Output is correct
4 Correct 23 ms 34884 KB Output is correct
5 Correct 23 ms 34892 KB Output is correct
6 Correct 22 ms 34444 KB Output is correct
7 Correct 27 ms 34252 KB Output is correct
8 Correct 23 ms 31404 KB Output is correct
9 Correct 21 ms 31428 KB Output is correct
10 Correct 25 ms 34228 KB Output is correct
11 Correct 25 ms 35036 KB Output is correct
12 Correct 20 ms 31716 KB Output is correct