oj.uz

Submission #30165

# Submission time Handle Problem Language Result Execution time Memory
30165 2017-07-22T19:10:42 Z Andrei1998 Palindromes (APIO14_palindrome) C++14
23 / 100
 1000 ms 79612 KB 
#include <bits/stdc++.h>

using namespace std;

const int NMAX = 2 * 300000 + 5;

inline int toInt(char ch) {
    if (ch == '#')
        return 0;
    else
        return ch - 'a' + 1;
}

string str;

int nodes;
int alf[NMAX][27];
int h[NMAX];
int father[NMAX];

int ext[NMAX];
int whichNode[NMAX];
int cnt[NMAX];

long long int ans = 1;

void dfs(int node, int realH) {
    for (int i = 0; i < 27; ++ i)
        if (alf[node][i]) {
            dfs(alf[node][i], realH + (i > 0) * (1 + (node > 1)));
            cnt[node] += cnt[alf[node][i]];
        }
    ans = max(ans, 1LL * realH * cnt[node]);
}

int main()
{
    //freopen("data.in", "r", stdin);

    cin >> str;
    string str2 = "#";
    for (auto it: str) {
        str2 += it;
        str2 += '#';
    }
    str = str2;
    str = " " + str;
    int N = str.size() - 1;

    ++ nodes;

    int center = 0;
    for (int i = 1; i <= N; ++ i) {
        int node = 1;
        int l = 0;

        while (i - l >= 1 && i + l <= N && str[i - l] == str[i + l]) {
            if (!alf[node][toInt(str[i - l])]) {
                alf[node][toInt(str[i - l])] = ++ nodes;
                h[nodes] = 1 + h[node];
                father[nodes] = node;
            }

            node = alf[node][toInt(str[i - l])];
            ++ l;
        }
        ext[i] = l;
        whichNode[i] = node;
        ++ cnt[node];
    }

    dfs(1, 0);

    cout << ans << '\n';
    return 0;
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:52:9: warning: unused variable 'center' [-Wunused-variable]
     int center = 0;
         ^

Subtask #1
8.0 / 8.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 77020 KB Output is correct
2 Correct 0 ms 77020 KB Output is correct
3 Correct 6 ms 77020 KB Output is correct
4 Correct 0 ms 77020 KB Output is correct
5 Correct 6 ms 77020 KB Output is correct
6 Correct 9 ms 77020 KB Output is correct
7 Correct 0 ms 77020 KB Output is correct
8 Correct 3 ms 77020 KB Output is correct
9 Correct 0 ms 77020 KB Output is correct
10 Correct 0 ms 77020 KB Output is correct
11 Correct 0 ms 77020 KB Output is correct
12 Correct 0 ms 77020 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 916 ms 77516 KB Output is correct
2 Correct 506 ms 77380 KB Output is correct
3 Execution timed out 1000 ms 77516 KB Execution timed out
4 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 77824 KB Execution timed out
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 79612 KB Execution timed out
2 Halted 0 ms 0 KB -