This documentation is automatically generated by competitive-verifier/competitive-verifier
# competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/enumerate_palindromes
from libs.manacher import manacher_algorithm
S = input()
T = ["$"]
for s in S:
T.append(s)
T.append("$")
T = "".join(T)
L = manacher_algorithm(T)
print(*[c - 1 if i % 2 == 0 else c - 1 for i, c in enumerate(L)][1:-1])
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
Python | all_same_00 |
![]() |
691 ms | 100 MB |
Python | all_same_01 |
![]() |
682 ms | 99 MB |
Python | all_same_02 |
![]() |
668 ms | 99 MB |
Python | all_same_03 |
![]() |
668 ms | 99 MB |
Python | all_same_04 |
![]() |
696 ms | 99 MB |
Python | example_00 |
![]() |
28 ms | 11 MB |
Python | example_01 |
![]() |
28 ms | 11 MB |
Python | example_02 |
![]() |
28 ms | 11 MB |
Python | example_03 |
![]() |
28 ms | 11 MB |
Python | max_random_00 |
![]() |
678 ms | 37 MB |
Python | max_random_01 |
![]() |
685 ms | 37 MB |
Python | max_random_02 |
![]() |
676 ms | 37 MB |
Python | max_random_03 |
![]() |
676 ms | 37 MB |
Python | max_random_04 |
![]() |
670 ms | 37 MB |
Python | random_00 |
![]() |
535 ms | 32 MB |
Python | random_01 |
![]() |
634 ms | 35 MB |
Python | random_02 |
![]() |
101 ms | 14 MB |
Python | random_03 |
![]() |
594 ms | 34 MB |
Python | random_04 |
![]() |
395 ms | 26 MB |
Python | small_00 |
![]() |
30 ms | 12 MB |
Python | small_01 |
![]() |
29 ms | 11 MB |
Python | small_02 |
![]() |
28 ms | 11 MB |
Python | small_03 |
![]() |
30 ms | 12 MB |
Python | small_04 |
![]() |
29 ms | 12 MB |