test/verify/yosupo-enumerate-palindromes.test.cpp

• View this file on GitHub
• Last update: 2026-08-10 14:28:01+00:00
• Problem: https://judge.yosupo.jp/problem/enumerate_palindromes

Depends on

• Manacher(最長回文) (string/manacher.hpp)

Code

// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/enumerate_palindromes
// clang-format on

#include <iostream>
#include <string>

#include "../../string/manacher.hpp"

using namespace std;

int main() {
  string s;
  cin >> s;
  auto lengths = manacher(s);
  for (int i = 0; i < static_cast<int>(lengths.size()); i++) {
    if (i > 0) cout << " ";
    cout << lengths[i];
  }
  cout << "\n";
}

#line 1 "test/verify/yosupo-enumerate-palindromes.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/enumerate_palindromes
// clang-format on

#include <iostream>
#include <string>

#line 2 "string/manacher.hpp"

#include <algorithm>
#include <cassert>
#include <vector>

/**
 * @brief Manacher(最長回文)
 */
template <typename S>
std::vector<int> manacher(S s, bool calc_even = true) {
  if (calc_even) {
    int n = (int)s.size();
    assert(n > 0);
    s.resize(2 * n - 1);
    for (int i = n - 1; i >= 0; i--) {
      s[2 * i] = s[i];
    }
    auto d = *std::min_element(std::begin(s), std::end(s));
    for (int i = 0; i < n - 1; i++) {
      s[2 * i + 1] = d;
    }
  }
  int n = (int)s.size();
  std::vector<int> rad(n);
  {
    int i = 0, j = 0;
    while (i < n) {
      while (i - j >= 0 && i + j < n && s[i - j] == s[i + j]) ++j;
      rad[i] = j;
      int k = 1;
      while (i - k >= 0 && i + k < n && k + rad[i - k] < j) {
        rad[i + k] = rad[i - k];
        ++k;
      }
      i += k, j -= k;
    }
  }
  if (calc_even) {
    for (int i = 0; i < n; i++) {
      if (((i ^ rad[i]) & 1) == 0) rad[i]--;
    }
  } else {
    for (auto&& x : rad) x = 2 * x - 1;
  }
  return rad;
}
#line 9 "test/verify/yosupo-enumerate-palindromes.test.cpp"

using namespace std;

int main() {
  string s;
  cin >> s;
  auto lengths = manacher(s);
  for (int i = 0; i < static_cast<int>(lengths.size()); i++) {
    if (i > 0) cout << " ";
    cout << lengths[i];
  }
  cout << "\n";
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	all_same_00	AC	89 ms	9 MB
g++	all_same_01	AC	73 ms	9 MB
g++	all_same_02	AC	72 ms	9 MB
g++	all_same_03	AC	72 ms	9 MB
g++	all_same_04	AC	81 ms	9 MB
g++	example_00	AC	2 ms	4 MB
g++	example_01	AC	2 ms	4 MB
g++	example_02	AC	2 ms	4 MB
g++	example_03	AC	2 ms	4 MB
g++	max_random_00	AC	69 ms	9 MB
g++	max_random_01	AC	68 ms	9 MB
g++	max_random_02	AC	64 ms	9 MB
g++	max_random_03	AC	71 ms	9 MB
g++	max_random_04	AC	66 ms	9 MB
g++	random_00	AC	51 ms	8 MB
g++	random_01	AC	59 ms	9 MB
g++	random_02	AC	9 ms	4 MB
g++	random_03	AC	57 ms	8 MB
g++	random_04	AC	37 ms	7 MB
g++	small_00	AC	3 ms	4 MB
g++	small_01	AC	2 ms	4 MB
g++	small_02	AC	2 ms	4 MB
g++	small_03	AC	2 ms	4 MB
g++	small_04	AC	2 ms	4 MB
clang++	all_same_00	AC	96 ms	9 MB
clang++	all_same_01	AC	77 ms	9 MB
clang++	all_same_02	AC	83 ms	9 MB
clang++	all_same_03	AC	71 ms	9 MB
clang++	all_same_04	AC	73 ms	9 MB
clang++	example_00	AC	2 ms	4 MB
clang++	example_01	AC	2 ms	4 MB
clang++	example_02	AC	2 ms	4 MB
clang++	example_03	AC	2 ms	4 MB
clang++	max_random_00	AC	70 ms	9 MB
clang++	max_random_01	AC	65 ms	9 MB
clang++	max_random_02	AC	65 ms	9 MB
clang++	max_random_03	AC	65 ms	9 MB
clang++	max_random_04	AC	72 ms	9 MB
clang++	random_00	AC	56 ms	8 MB
clang++	random_01	AC	68 ms	9 MB
clang++	random_02	AC	10 ms	4 MB
clang++	random_03	AC	56 ms	8 MB
clang++	random_04	AC	37 ms	6 MB
clang++	small_00	AC	3 ms	4 MB
clang++	small_01	AC	2 ms	4 MB
clang++	small_02	AC	2 ms	4 MB
clang++	small_03	AC	2 ms	4 MB
clang++	small_04	AC	2 ms	4 MB

Back to top page