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

• View this file on GitHub
• Last update: 2024-04-24 02:34:04+09:00
• Problem: https://judge.yosupo.jp/problem/enumerate_palindromes

Depends on

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

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/enumerate_palindromes

#include "../../template/template.hpp"

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

int main() {
  string s;
  cin >> s;
  cout << manacher(s) << "\n";
}

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

#line 1 "template/template.hpp"
#include<bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};
 
template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}
#line 4 "test/verify/yosupo-enumerate-palindromes.test.cpp"

#line 1 "string/manacher.hpp"
/**
 * @brief Manacher(最長回文)
 */
template< typename S >
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 = *min_element(begin(s), end(s));
    for(int i = 0; i < n - 1; i++) {
      s[2 * i + 1] = d;
    }
  }
  int n = (int) s.size();
  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 6 "test/verify/yosupo-enumerate-palindromes.test.cpp"

int main() {
  string s;
  cin >> s;
  cout << manacher(s) << "\n";
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	all_same_00	AC	61 ms	9 MB
g++	all_same_01	AC	61 ms	9 MB
g++	all_same_02	AC	70 ms	9 MB
g++	all_same_03	AC	70 ms	9 MB
g++	all_same_04	AC	71 ms	9 MB
g++	example_00	AC	6 ms	4 MB
g++	example_01	AC	6 ms	4 MB
g++	example_02	AC	6 ms	4 MB
g++	example_03	AC	6 ms	4 MB
g++	max_random_00	AC	54 ms	9 MB
g++	max_random_01	AC	55 ms	9 MB
g++	max_random_02	AC	55 ms	9 MB
g++	max_random_03	AC	56 ms	9 MB
g++	max_random_04	AC	58 ms	9 MB
g++	random_00	AC	44 ms	8 MB
g++	random_01	AC	54 ms	9 MB
g++	random_02	AC	12 ms	4 MB
g++	random_03	AC	50 ms	8 MB
g++	random_04	AC	34 ms	7 MB
g++	small_00	AC	6 ms	4 MB
g++	small_01	AC	6 ms	4 MB
g++	small_02	AC	6 ms	4 MB
g++	small_03	AC	6 ms	4 MB
g++	small_04	AC	6 ms	4 MB
clang++	all_same_00	AC	60 ms	9 MB
clang++	all_same_01	AC	65 ms	9 MB
clang++	all_same_02	AC	70 ms	9 MB
clang++	all_same_03	AC	69 ms	9 MB
clang++	all_same_04	AC	68 ms	9 MB
clang++	example_00	AC	6 ms	4 MB
clang++	example_01	AC	6 ms	4 MB
clang++	example_02	AC	6 ms	4 MB
clang++	example_03	AC	6 ms	4 MB
clang++	max_random_00	AC	55 ms	9 MB
clang++	max_random_01	AC	59 ms	9 MB
clang++	max_random_02	AC	55 ms	9 MB
clang++	max_random_03	AC	59 ms	9 MB
clang++	max_random_04	AC	59 ms	9 MB
clang++	random_00	AC	47 ms	8 MB
clang++	random_01	AC	54 ms	8 MB
clang++	random_02	AC	12 ms	4 MB
clang++	random_03	AC	50 ms	8 MB
clang++	random_04	AC	35 ms	7 MB
clang++	small_00	AC	6 ms	4 MB
clang++	small_01	AC	6 ms	4 MB
clang++	small_02	AC	6 ms	4 MB
clang++	small_03	AC	6 ms	4 MB
clang++	small_04	AC	6 ms	4 MB

Back to top page