oj.uz

Submission #868889

# Submission time Handle Problem Language Result Execution time Memory
868889 2023-11-02T11:54:26 Z sleepntsheep Palindromes (APIO14_palindrome) C++17
0 / 100
 19 ms 34940 KB 
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <deque>
#include <set>
#include <utility>
#include <array>

using namespace std;
#define ALL(x) x.begin(), x.end()
#define ShinLena cin.tie(nullptr)->sync_with_stdio(false);
using ll = long long;
#define N 300005

char s[N]; 
int lz[N], len[N], link[N], nxt[N][26], n = 2, t = 2;
ll ans;

void init()
{
    n = t = 2;
    len[1] = -1, link[1] = 1;
    len[2] = 0, link[2] = 1;
}

void append(int pos)
{
    int la, l, c = s[pos] - 'a';
    for (l = t; !(pos-1>=len[l] && s[pos-1-len[l]] == s[pos]); l = link[l]);
    if (nxt[l][c]) { t = nxt[l][c]; return; }

    t = ++n;
    len[n] = len[l] + 2;
    ++lz[n];
    nxt[l][c] = n;

    if (len[n] == 1)
    {
        link[n] = 2;
        return;
    }

    for (la = link[l]; !(pos-1>=len[la] && s[pos-1-len[la]] == s[pos]); la=link[la]);
    link[n] = nxt[la][c];
}

void pushlazy()
{
    for (int i = n; i >= 1; --i)
    {
        lz[link[i]] += lz[i];
        ans = max(ans, 1ll*lz[i]*len[i]);
    }
}


int main()
{
    ShinLena;
    cin >> s;
    init();
    for (int i = 0; s[i]; ++i) append(i);
    pushlazy();
    cout << ans;
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 3 ms 4564 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4568 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 0 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Incorrect 1 ms 4444 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Incorrect 1 ms 4444 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5468 KB Output is correct
2 Correct 1 ms 5468 KB Output is correct
3 Correct 2 ms 5468 KB Output is correct
4 Correct 1 ms 5464 KB Output is correct
5 Correct 0 ms 5468 KB Output is correct
6 Correct 1 ms 5468 KB Output is correct
7 Correct 1 ms 5468 KB Output is correct
8 Incorrect 1 ms 4444 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14940 KB Output is correct
2 Correct 6 ms 14936 KB Output is correct
3 Correct 6 ms 14940 KB Output is correct
4 Correct 6 ms 14940 KB Output is correct
5 Correct 5 ms 14940 KB Output is correct
6 Correct 5 ms 12124 KB Output is correct
7 Correct 6 ms 13416 KB Output is correct
8 Incorrect 2 ms 4700 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 34648 KB Output is correct
2 Correct 16 ms 34740 KB Output is correct
3 Correct 19 ms 34652 KB Output is correct
4 Correct 18 ms 34652 KB Output is correct
5 Correct 17 ms 34940 KB Output is correct
6 Correct 15 ms 32908 KB Output is correct
7 Correct 14 ms 31324 KB Output is correct
8 Incorrect 5 ms 5212 KB Output isn't correct
9 Halted 0 ms 0 KB -