#837225 (C++17) No.2204 Palindrome Splitting (No Rearrangement ver.)

• 問題: No.2204 Palindrome Splitting (No Rearrangement ver.)
• ユーザー: mai
• 提出日時: 2023-02-03 22:18:48
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 7,371 bytes
• コンパイル時間: 2,399 ms
• コンパイル使用メモリ: 214,792 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-07-02 20:22:17
• 合計ジャッジ時間: 3,553 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,812 KB
testcase_01	AC	2 ms; 6,812 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	WA	-
testcase_04	AC	4 ms; 6,940 KB
testcase_05	AC	3 ms; 6,940 KB
testcase_06	AC	12 ms; 6,940 KB
testcase_07	AC	10 ms; 6,944 KB
testcase_08	AC	9 ms; 6,944 KB
testcase_09	AC	10 ms; 6,944 KB
testcase_10	AC	11 ms; 6,940 KB
testcase_11	AC	9 ms; 6,940 KB
testcase_12	AC	10 ms; 6,940 KB
testcase_13	AC	10 ms; 6,944 KB
testcase_14	AC	11 ms; 6,944 KB
testcase_15	AC	9 ms; 6,940 KB
testcase_16	AC	5 ms; 6,940 KB
testcase_17	AC	6 ms; 6,940 KB
testcase_18	AC	11 ms; 6,940 KB
testcase_19	AC	11 ms; 6,940 KB
testcase_20	AC	11 ms; 6,940 KB
testcase_21	AC	4 ms; 6,944 KB
testcase_22	AC	8 ms; 6,944 KB
testcase_23	AC	5 ms; 6,940 KB
testcase_24	AC	11 ms; 6,944 KB
testcase_25	AC	11 ms; 6,940 KB
testcase_26	AC	10 ms; 6,940 KB
testcase_27	WA	-
testcase_28	AC	9 ms; 6,948 KB
testcase_29	AC	7 ms; 6,940 KB
testcase_30	AC	2 ms; 6,944 KB
testcase_31	AC	2 ms; 6,940 KB
testcase_32	AC	2 ms; 6,944 KB
testcase_33	AC	1 ms; 6,940 KB
testcase_34	WA	-
testcase_35	AC	2 ms; 6,940 KB

ソースコード

#pragma GCC optimize("O3")
#include <bits/stdc++.h>

// clang-format off
using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define upto(cnt,b,e,step) for(auto cnt=(b);(cnt)<=(e);(cnt)+=(step))
#define downto(cnt,b,e,step) for(auto cnt=(b);(e)<=(cnt);(cnt)-=(step))
const long long MD = 998244353; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }template<typename T>
static ostream& operator<<(ostream& o, const std::vector<T>& v) {
  o << "[ "; for(const auto& e : v) o<<e<<' '; return o << ']';
}

template <typename I> struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I> static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' '; return o << ']';
}
template <typename I> struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I> static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n'; repeat(i,(f.n)) { repeat(j,f.m) o<<f.p[i][j]<<' '; o<<'\n'; }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(const char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);
// clang-format on


class Manacher {
 public:
  vector<int> radius_;

  Manacher() {}
  Manacher(const string& str) { build(str); }

  void build(const string& str) {
    int length = str.size() * 2 - 1;
    radius_.resize(length);

    int c = 0;
    for (int i = 0; i < length; i++) {
      int l = c - (i - c);
      if (i + radius_[l] < c + radius_[c]) {
        radius_[i] = radius_[l];
      } else {
        int j = c + radius_[c] - i;
        for (; i - j >= 0 && i + j < length; j++) {
          if (((i ^ j) & 1) == 1)
            continue;
          if (str[(i - j) / 2] != str[(i + j) / 2])
            break;
        }
        radius_[i] = j;
        c = i;
      }
    }
  }

  inline int operator[](int idx) const { return radius_[idx]; }
  inline size_t size() const { return radius_.size(); }

  // 部分文字列str[left..right]が回文かどうか．計算量O(1)
  // left,rightに指定するインデックスは，基の文字列のインデックスを指定する．
  inline bool operator()(int left, int right) { return radius_[left + right] > right - left; }

  // 回文の個数を求める．
  long long count_num() {
    long long r = 0;
    for (auto it = radius_.begin(); it < radius_.end(); ++it, ++it) {
      r += (*it + 1ll) / 2ll;
    }
    for (auto it = radius_.begin() + 1; it < radius_.end(); ++it, ++it) {
      r += (*it) / 2ll;
    }
    return r;
  }

  // void print(const string& str) {
  //   for (int i = 0; i < str.size(); i++) {
  //     cout << str[i] << " ";
  //   }
  //   cout << endl;
  //   for (int i = 0; i < radius_.size(); i++) {
  //     cout << radius_[i];
  //   }
  //   cout << endl;
  // }
};

//

int N;
string S;
Manacher manatee;

//

bool check(int w) {
  bool ok = true;
  repeat(i, N) {
    ok = false;
    upto(r, i + w-1, N-1, 1) {
      if (manatee(i, r)) {
        i = r;
        ok = true;
        break;
      }
    }
    if (!ok) return false;
  }
  return true;
}

int main() {
  scanner >> S;
  N = S.size();
  manatee = Manacher(S);
  
  // int ok = 1;
  // int ng = N + 1;
  // while (ng - ok > 1) {
  //   int m = (ng + ok)/2;
    
  //   if (check(m)) {
  //     ok = m;
  //   } else {
  //     ng = m;
  //   }
  // }
  
  downto(w, N, 1, 1) {
    if (check(w)) {
      cout << w << endl;
      return 0;
    }
  }
  
  
  return 0;
}