oj.uz

Submission #235377

# Submission time Handle Problem Language Result Execution time Memory
235377 2020-05-28T07:29:58 Z PeppaPig Palindromes (APIO14_palindrome) C++14
0 / 100
 782 ms 111336 KB 
#include <bits/stdc++.h>

#define long long long

using namespace std;

const int N = 6e5+5;

int n, sz;
int pos[N], sa[N], tmp[N], lcp[N][20];
char S[N];

void build_sa() {
    tmp[1] = 1;
    for(int i = 1; i <= sz; i++) sa[i] = i, pos[i] = S[i];
    for(int gap = 1; gap <= sz; gap <<= 1) {
        auto cmp = [&](int a, int b) {
            if(pos[a] != pos[b]) return pos[a] < pos[b];
            a += gap, b += gap;
            return (a <= sz && b <= sz) ? pos[a] < pos[b] : a > b;
        };
        sort(sa + 1, sa + 1 + sz, cmp);
        for(int i = 1; i < sz; i++) tmp[i + 1] = tmp[i] + cmp(sa[i], sa[i + 1]);
        for(int i = 1; i <= sz; i++) pos[sa[i]] = tmp[i];
    }

    for(int i = 1, k = 0; i <= sz; i++) if(pos[i] != sz) {
        for(int j = sa[pos[i] + 1]; S[i + k] == S[j + k]; k++);
        lcp[pos[i]][0] = k;
        if(k) --k;
    }
    for(int i = 1; i <= sz; i++) for(int j = 0; j < 19; j++)
        lcp[i][j + 1] = min(lcp[i][j], lcp[i + (1 << j)][j]);
}

int find_lcp(int l, int r) {
    if(l > r) swap(l, r);
    int k = 31 - __builtin_clz(r - l);
    assert(r - (1 << k) >= l);
    return min(lcp[l][k], lcp[r - (1 << k)][k]);
}

int lp[N], cnt[N];
long ans;

void solve(int odd) {
    int len = 0;
    long sum; 
    for(int i = 1; i <= sz + 1; i++) {
        sum = 0;
        while(len > lcp[i - 1][0]) {
            sum += cnt[len], cnt[len] = 0;
            ans = max(ans, sum * (2 * len - odd));
            --len;
        }
        if(i == sz + 1) continue;
        cnt[len] += sum;
        len = max(len, lp[i]);
        ++cnt[lp[i]];
    }
}

int main() {
    scanf(" %s", S + 1);
    n = strlen(S + 1), sz = 2 * n + 1;
    S[n + 1] = '#';
    for(int i = 1; i <= n; i++) S[sz - i + 1] = S[i];
    build_sa();

    for(int i = 1; i <= n; i++) lp[pos[i]] = find_lcp(pos[i], pos[sz - i + 1]);
    solve(1);
    lp[pos[1]] = 0;
    for(int i = 2; i <= n; i++) lp[pos[i]] = find_lcp(pos[i], pos[sz - i + 2]);
    solve(0);
    
    printf("%lld\n", ans);

    return 0;
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:64:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf(" %s", S + 1);
     ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 5 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 2304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 201 ms 19704 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

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