#1031074 (C++17(gcc12)) No.3000 Optimal Run Length Encoding

提出ソース

結果

問題	No.3000 Optimal Run Length Encoding
ユーザー	NyaanNyaan
提出日時	2024-12-13 12:05:25
言語	C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
結果	MLE (最新) AC (最初)
実行時間	-
コード長	21,214 bytes
コンパイル時間	5,058 ms
コンパイル使用メモリ	301,800 KB
実行使用メモリ	818,044 KB
最終ジャッジ日時	2024-12-24 23:37:13
合計ジャッジ時間	170,172 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	223 ms 16,128 KB
testcase_02	AC	223 ms 15,488 KB
testcase_03	AC	209 ms 13,440 KB
testcase_04	AC	215 ms 13,952 KB
testcase_05	AC	189 ms 9,472 KB
testcase_06	AC	188 ms 10,752 KB
testcase_07	AC	221 ms 14,464 KB
testcase_08	AC	209 ms 13,568 KB
testcase_09	AC	188 ms 10,112 KB
testcase_10	AC	177 ms 8,448 KB
testcase_11	AC	192 ms 10,624 KB
testcase_12	AC	199 ms 11,648 KB
testcase_13	AC	199 ms 12,032 KB
testcase_14	AC	173 ms 7,808 KB
testcase_15	AC	181 ms 8,192 KB
testcase_16	AC	197 ms 10,624 KB
testcase_17	AC	175 ms 7,168 KB
testcase_18	AC	119 ms 6,272 KB
testcase_19	AC	343 ms 29,056 KB
testcase_20	AC	351 ms 29,568 KB
testcase_21	AC	401 ms 29,824 KB
testcase_22	AC	360 ms 29,824 KB
testcase_23	AC	352 ms 30,720 KB
testcase_24	AC	352 ms 29,824 KB
testcase_25	AC	352 ms 29,824 KB
testcase_26	AC	343 ms 29,696 KB
testcase_27	AC	311 ms 27,136 KB
testcase_28	AC	334 ms 22,272 KB
testcase_29	AC	381 ms 22,912 KB
testcase_30	AC	429 ms 23,808 KB
testcase_31	AC	438 ms 24,320 KB
testcase_32	AC	486 ms 25,216 KB
testcase_33	AC	562 ms 26,296 KB
testcase_34	AC	712 ms 38,832 KB
testcase_35	AC	323 ms 37,044 KB
testcase_36	AC	320 ms 36,928 KB
testcase_37	AC	325 ms 37,184 KB
testcase_38	AC	325 ms 37,060 KB
testcase_39	AC	322 ms 37,064 KB
testcase_40	AC	323 ms 36,864 KB
testcase_41	AC	319 ms 37,240 KB
testcase_42	AC	321 ms 37,020 KB
testcase_43	AC	325 ms 36,804 KB
testcase_44	AC	330 ms 36,792 KB
testcase_45	MLE	-
testcase_46	MLE	-
testcase_47	MLE	-
testcase_48	MLE	-
testcase_49	MLE	-
testcase_50	MLE	-
testcase_51	MLE	-
testcase_52	MLE	-
testcase_53	MLE	-
testcase_54	MLE	-
testcase_55	MLE	-
testcase_56	MLE	-
testcase_57	MLE	-
testcase_58	MLE	-
testcase_59	MLE	-
testcase_60	MLE	-
testcase_61	MLE	-
testcase_62	MLE	-
testcase_63	MLE	-
testcase_64	MLE	-
testcase_65	AC	762 ms 121,852 KB
testcase_66	AC	384 ms 57,864 KB
testcase_67	AC	721 ms 102,024 KB
testcase_68	AC	364 ms 54,676 KB
testcase_69	AC	869 ms 153,500 KB
testcase_70	AC	1,869 ms 110,924 KB
testcase_71	AC	331 ms 46,528 KB
testcase_72	AC	1,499 ms 142,708 KB
testcase_73	AC	778 ms 87,212 KB
testcase_74	AC	1,047 ms 144,316 KB
testcase_75	AC	420 ms 80,992 KB
testcase_76	AC	1,216 ms 144,868 KB
testcase_77	AC	781 ms 82,232 KB
testcase_78	AC	1,280 ms 144,328 KB
testcase_79	AC	788 ms 85,636 KB
testcase_80	AC	1,212 ms 132,108 KB
testcase_81	AC	80 ms 8,448 KB
testcase_82	AC	1,977 ms 117,496 KB
testcase_83	AC	1,633 ms 119,972 KB
testcase_84	AC	1,595 ms 120,060 KB
testcase_85	AC	1,584 ms 119,964 KB
testcase_86	AC	1,562 ms 119,788 KB
testcase_87	AC	1,640 ms 117,580 KB
testcase_88	AC	1,591 ms 120,024 KB
testcase_89	AC	1,603 ms 117,516 KB
testcase_90	AC	1,586 ms 119,908 KB
testcase_91	AC	1,591 ms 119,924 KB
testcase_92	AC	1,619 ms 117,236 KB
testcase_93	AC	1,654 ms 117,152 KB
testcase_94	AC	1,597 ms 117,136 KB
testcase_95	AC	1,588 ms 119,572 KB
testcase_96	AC	1,995 ms 119,696 KB
testcase_97	AC	641 ms 51,172 KB
testcase_98	AC	500 ms 51,708 KB
testcase_99	AC	441 ms 43,300 KB
testcase_100	AC	531 ms 47,224 KB
testcase_101	AC	570 ms 53,556 KB
testcase_102	AC	778 ms 91,940 KB
testcase_103	AC	800 ms 96,512 KB
testcase_104	AC	929 ms 109,084 KB
testcase_105	AC	811 ms 102,540 KB
testcase_106	AC	903 ms 102,972 KB
testcase_107	AC	695 ms 101,360 KB
testcase_108	AC	813 ms 100,488 KB
testcase_109	AC	749 ms 94,928 KB
testcase_110	AC	802 ms 107,116 KB
testcase_111	AC	987 ms 114,060 KB
testcase_112	AC	854 ms 99,484 KB
testcase_113	AC	860 ms 99,276 KB
testcase_114	AC	849 ms 99,264 KB
testcase_115	AC	880 ms 99,120 KB
testcase_116	AC	828 ms 100,620 KB
testcase_117	AC	842 ms 99,896 KB
testcase_118	AC	867 ms 99,552 KB
testcase_119	AC	829 ms 100,580 KB
testcase_120	AC	836 ms 99,896 KB
testcase_121	AC	837 ms 100,256 KB
testcase_122	AC	839 ms 99,940 KB
testcase_123	AC	842 ms 100,244 KB
testcase_124	AC	839 ms 100,104 KB
testcase_125	AC	913 ms 97,440 KB
testcase_126	AC	925 ms 96,160 KB
testcase_127	AC	852 ms 99,688 KB
testcase_128	AC	905 ms 97,556 KB
testcase_129	AC	915 ms 97,048 KB
testcase_130	AC	868 ms 99,392 KB
testcase_131	AC	909 ms 97,060 KB
testcase_132	AC	1,582 ms 115,460 KB
testcase_133	AC	1,561 ms 116,048 KB
testcase_134	AC	1,546 ms 116,120 KB
testcase_135	AC	1,599 ms 116,592 KB
testcase_136	AC	1,573 ms 116,944 KB
testcase_137	AC	1,540 ms 117,108 KB
testcase_138	AC	1,573 ms 117,040 KB
testcase_139	AC	1,513 ms 117,332 KB
testcase_140	AC	1,550 ms 117,228 KB
testcase_141	AC	1,518 ms 117,356 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/**
 * date   : 2024-12-13 12:05:04
 * author : Nyaan
 */

#define NDEBUG

/**
 * date   : 2024-12-12 23:46:05
 * author : Nyaan
 */

using namespace std;

// intrinstic
#include <immintrin.h>


#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <cctype>

#include <cfenv>

#include <cfloat>

#include <chrono>

#include <cinttypes>

#include <climits>

#include <cmath>

#include <complex>

#include <cstdarg>

#include <cstddef>

#include <cstdint>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <deque>

#include <fstream>

#include <functional>

#include <initializer_list>

#include <iomanip>

#include <ios>

#include <iostream>

#include <istream>

#include <iterator>

#include <limits>

#include <list>

#include <map>

#include <memory>

#include <new>

#include <numeric>

#include <ostream>

#include <queue>

#include <random>

#include <set>

#include <sstream>

#include <stack>

#include <streambuf>

#include <string>

#include <tr2/dynamic_bitset>

#include <tuple>

#include <type_traits>

#include <typeinfo>

#include <unordered_map>

#include <unordered_set>

#include <utility>

#include <vector>


// utility

namespace Nyaan {
using ll = long long;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;

template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<vector<T>>;
using vi = vector<int>;
using vl = vector<long long>;
using vd = V<double>;
using vs = V<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;

template <typename T, typename U>
struct P : pair<T, U> {
  template <typename... Args>
  constexpr P(Args... args) : pair<T, U>(args...) {}

  using pair<T, U>::first;
  using pair<T, U>::second;

  P &operator+=(const P &r) {
    first += r.first;
    second += r.second;
    return *this;
  }
  P &operator-=(const P &r) {
    first -= r.first;
    second -= r.second;
    return *this;
  }
  P &operator*=(const P &r) {
    first *= r.first;
    second *= r.second;
    return *this;
  }
  template <typename S>
  P &operator*=(const S &r) {
    first *= r, second *= r;
    return *this;
  }
  P operator+(const P &r) const { return P(*this) += r; }
  P operator-(const P &r) const { return P(*this) -= r; }
  P operator*(const P &r) const { return P(*this) *= r; }
  template <typename S>
  P operator*(const S &r) const {
    return P(*this) *= r;
  }
  P operator-() const { return P{-first, -second}; }
};

using pl = P<ll, ll>;
using pi = P<int, int>;
using vp = V<pl>;

constexpr int inf = 1001001001;
constexpr long long infLL = 4004004004004004004LL;

template <typename T>
int sz(const T &t) {
  return t.size();
}

template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}

template <typename T>
inline T Max(const vector<T> &v) {
  return *max_element(begin(v), end(v));
}
template <typename T>
inline T Min(const vector<T> &v) {
  return *min_element(begin(v), end(v));
}
template <typename T>
inline long long Sum(const vector<T> &v) {
  return accumulate(begin(v), end(v), 0LL);
}

template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}

constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  for (; n; x *= x, n >>= 1) ret *= (n & 1 ? x : 1);
  return ret;
}

template <typename T, typename U>
pair<T, U> mkp(const T &t, const U &u) {
  return make_pair(t, u);
}

template <typename T>
vector<T> mkrui(const vector<T> &v, bool rev = false) {
  vector<T> ret(v.size() + 1);
  if (rev) {
    for (int i = int(v.size()) - 1; i >= 0; i--) ret[i] = v[i] + ret[i + 1];
  } else {
    for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  }
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

template <typename T>
vector<int> mkinv(vector<T> &v) {
  int max_val = *max_element(begin(v), end(v));
  vector<int> inv(max_val + 1, -1);
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

vector<int> mkiota(int n) {
  vector<int> ret(n);
  iota(begin(ret), end(ret), 0);
  return ret;
}

template <typename T>
T mkrev(const T &v) {
  T w{v};
  reverse(begin(w), end(w));
  return w;
}

template <typename T>
bool nxp(T &v) {
  return next_permutation(begin(v), end(v));
}

// 返り値の型は入力の T に依存
// i 要素目 : [0, a[i])
template <typename T>
vector<vector<T>> product(const vector<T> &a) {
  vector<vector<T>> ret;
  vector<T> v;
  auto dfs = [&](auto rc, int i) -> void {
    if (i == (int)a.size()) {
      ret.push_back(v);
      return;
    }
    for (int j = 0; j < a[i]; j++) v.push_back(j), rc(rc, i + 1), v.pop_back();
  };
  dfs(dfs, 0);
  return ret;
}

// F : function(void(T&)), mod を取る操作
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I, const function<void(T &)> &f) {
  T res = I;
  for (; n; f(a = a * a), n >>= 1) {
    if (n & 1) f(res = res * a);
  }
  return res;
}
// T : 整数型のときはオーバーフローに注意する
template <typename T>
T Power(T a, long long n, const T &I = T{1}) {
  return Power(a, n, I, function<void(T &)>{[](T &) -> void {}});
}

template <typename T>
T Rev(const T &v) {
  T res = v;
  reverse(begin(res), end(res));
  return res;
}

template <typename T>
vector<T> Transpose(const vector<T> &v) {
  using U = typename T::value_type;
  if (v.empty()) return {};
  int H = v.size(), W = v[0].size();
  vector res(W, T(H, U{}));
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      res[j][i] = v[i][j];
    }
  }
  return res;
}

template <typename T>
vector<T> Rotate(const vector<T> &v, int clockwise = true) {
  using U = typename T::value_type;
  int H = v.size(), W = v[0].size();
  vector res(W, T(H, U{}));
  for (int i = 0; i < H; i++) {
    for (int j = 0; j < W; j++) {
      if (clockwise) {
        res[W - 1 - j][i] = v[i][j];
      } else {
        res[j][H - 1 - i] = v[i][j];
      }
    }
  }
  return res;
}

}  // namespace Nyaan

// bit operation

namespace Nyaan {
__attribute__((target("popcnt"))) inline int popcnt(const u64 &a) {
  return __builtin_popcountll(a);
}
inline int lsb(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int ctz(const u64 &a) { return a ? __builtin_ctzll(a) : 64; }
inline int msb(const u64 &a) { return a ? 63 - __builtin_clzll(a) : -1; }
template <typename T>
inline int gbit(const T &a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void sbit(T &a, int i, bool b) {
  if (gbit(a, i) != b) a ^= T(1) << i;
}
constexpr long long PW(int n) { return 1LL << n; }
constexpr long long MSK(int n) { return (1LL << n) - 1; }
}  // namespace Nyaan

// inout

namespace Nyaan {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}

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

istream &operator>>(istream &is, __int128_t &x) {
  string S;
  is >> S;
  x = 0;
  int flag = 0;
  for (auto &c : S) {
    if (c == '-') {
      flag = true;
      continue;
    }
    x *= 10;
    x += c - '0';
  }
  if (flag) x = -x;
  return is;
}

istream &operator>>(istream &is, __uint128_t &x) {
  string S;
  is >> S;
  x = 0;
  for (auto &c : S) {
    x *= 10;
    x += c - '0';
  }
  return is;
}

ostream &operator<<(ostream &os, __int128_t x) {
  if (x == 0) return os << 0;
  if (x < 0) os << '-', x = -x;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}
ostream &operator<<(ostream &os, __uint128_t x) {
  if (x == 0) return os << 0;
  string S;
  while (x) S.push_back('0' + x % 10), x /= 10;
  reverse(begin(S), end(S));
  return os << S;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u) {
  cin >> t;
  in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
  cout << t;
  if (sizeof...(u)) cout << sep;
  out(u...);
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

}  // namespace Nyaan

// debug

#ifdef NyaanDebug
#define trc(...) (void(0))
#endif
#ifndef NyaanDebug
#define trc(...) (void(0))
#endif

#ifndef NyaanLocal
#define trc2(...) (void(0))
#endif

// macro

#define each(x, v) for (auto &&x : v)
#define each2(x, y, v) for (auto &&[x, y] : v)
#define all(v) (v).begin(), (v).end()
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N) - 1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define regr(i, a, b) for (long long i = (b) - 1; i >= (a); i--)
#define fi first
#define se second
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define die(...)             \
  do {                       \
    Nyaan::out(__VA_ARGS__); \
    return;                  \
  } while (0)

namespace Nyaan {
void solve();
}
int main() { Nyaan::solve(); }

//

using namespace std;

template <typename Container>
vector<int> z_algorithm(const Container &s) {
  int n = s.size();
  if (n == 0) return {};
  vector<int> a(n);
  a[0] = n;
  int i = 1, j = 0;
  while (i < n) {
    while (i + j < n && s[j] == s[i + j]) j++;
    a[i] = j;
    if (j == 0) {
      i++;
      continue;
    }
    int k = 1;
    while (i + k < n && k + a[k] < j) a[i + k] = a[k], k++;
    i += k, j -= k;
  }
  return a;
}

/**
 * @brief Z algorithm
 */

// (p, l, r) : S[l, r) は周期 p かつ極大
// sum_{(p,l,r)} 1 <= n
// sum_{(p,l,r)} (r-l)/p <= 3n
// sum_{(p,l,r)} (r-l+1-2*p) = O(n log n)
template <typename C>
vector<tuple<int, int, int>> run_enumerate(const C &S) {
  int N = S.size();
  using T = tuple<int, int, int>;
  vector<vector<pair<int, int>>> by_p(N + 1);

  auto solve_sub = [&](const C &l, const C &r) {
    vector<T> res;
    int n = l.size(), m = r.size();
    C s = l, t = r;
    t.insert(end(t), begin(l), end(l));
    t.insert(end(t), begin(r), end(r));
    reverse(begin(s), end(s));
    auto ZS = z_algorithm(s), ZT = z_algorithm(t);
    for (int p = 1; p <= n; p++) {
      int a = p == n ? p : min(ZS[p] + p, n);
      int b = min(ZT[n + m - p], m);
      if (a + b < 2 * p) continue;
      res.emplace_back(p, a, b);
    }
    return res;
  };

  auto dfs = [&](auto rc, int L, int R) -> void {
    if (R - L <= 1) return;
    int M = (L + R) / 2;
    rc(rc, L, M), rc(rc, M, R);
    C SL{begin(S) + L, begin(S) + M};
    C SR{begin(S) + M, begin(S) + R};
    auto sub_res1 = solve_sub(SL, SR);
    for (auto &[p, a, b] : sub_res1) by_p[p].emplace_back(M - a, M + b);
    reverse(begin(SL), end(SL));
    reverse(begin(SR), end(SR));
    auto sub_res2 = solve_sub(SR, SL);
    for (auto &[p, a, b] : sub_res2) by_p[p].emplace_back(M - b, M + a);
  };
  dfs(dfs, 0, N);

  vector<T> res;
  set<pair<int, int>> done;
  for (int p = 0; p <= N; p++) {
    auto &LR = by_p[p];
    sort(begin(LR), end(LR), [](auto &x, auto &y) {
      if (x.first == y.first) return x.second > y.second;
      return x.first < y.first;
    });
    int r = -1;
    for (auto &lr : LR) {
      if (r >= lr.second) continue;
      r = lr.second;
      if (!done.count(lr)) {
        done.insert(lr);
        res.emplace_back(p, lr.first, lr.second);
      }
    }
  }
  return res;
}

using namespace Nyaan;

constexpr int INF = 1001001001;





template <typename Node>
struct RBSTBase {
  using Ptr = Node *;
  template <typename... Args>
  inline Ptr my_new(Args... args) {
    return new Node(args...);
  }
  inline void my_del(Ptr t) { delete t; }
  inline Ptr make_tree() const { return nullptr; }

  // for avoiding memory leak, activate below
  /*
  using Ptr = shared_ptr<Node>;
  template <typename... Args>
  inline Ptr my_new(Args... args) {
    return make_shared<Node>(args...);
  }
  inline void my_del(Ptr t) {}
  Ptr make_tree() {return Ptr();}
  */

  int size(Ptr t) const { return count(t); }

  Ptr merge(Ptr l, Ptr r) {
    if (!l || !r) return l ? l : r;
    if (int((rng() * (l->cnt + r->cnt)) >> 32) < l->cnt) {
      push(l);
      l->r = merge(l->r, r);
      return update(l);
    } else {
      push(r);
      r->l = merge(l, r->l);
      return update(r);
    }
  }

  pair<Ptr, Ptr> split(Ptr t, int k) {
    if (!t) return {nullptr, nullptr};
    push(t);
    if (k <= count(t->l)) {
      auto s = split(t->l, k);
      t->l = s.second;
      return {s.first, update(t)};
    } else {
      auto s = split(t->r, k - count(t->l) - 1);
      t->r = s.first;
      return {update(t), s.second};
    }
  }

  Ptr build(int l, int r, const vector<decltype(Node::key)> &v) {
    if (l + 1 == r) return my_new(v[l]);
    int m = (l + r) >> 1;
    Ptr pm = my_new(v[m]);
    if (l < m) pm->l = build(l, m, v);
    if (m + 1 < r) pm->r = build(m + 1, r, v);
    return update(pm);
  }

  Ptr build(const vector<decltype(Node::key)> &v) {
    return build(0, (int)v.size(), v);
  }

  template <typename... Args>
  void insert(Ptr &t, int k, const Args &... args) {
    auto x = split(t, k);
    t = merge(merge(x.first, my_new(args...)), x.second);
  }

  void erase(Ptr &t, int k) {
    auto x = split(t, k);
    auto y = split(x.second, 1);
    my_del(y.first);
    t = merge(x.first, y.second);
  }

 protected:
  static uint64_t rng() {
    static uint64_t x_ = 88172645463325252ULL;
    return x_ ^= x_ << 7, x_ ^= x_ >> 9, x_ & 0xFFFFFFFFull;
  }

  inline int count(const Ptr t) const { return t ? t->cnt : 0; }

  virtual void push(Ptr) = 0;

  virtual Ptr update(Ptr) = 0;
};

/**
 * @brief 乱択平衡二分木(基底クラス)
 */


template <typename T>
struct RBSTNode {
  typename RBSTBase<RBSTNode>::Ptr l, r;
  T key, sum;
  int cnt;

  RBSTNode(const T &t = T()) : l(), r(), key(t), sum(t), cnt(1) {}
};

template <typename T, T (*f)(T, T)>
struct RBST : RBSTBase<RBSTNode<T>> {
  using Node = RBSTNode<T>;
  using base = RBSTBase<RBSTNode<T>>;
  using base::merge;
  using base::split;
  using typename base::Ptr;

  RBST() = default;

  T fold(Ptr &t, int a, int b) {
    auto x = split(t, a);
    auto y = split(x.second, b - a);
    auto ret = sum(y.first);
    t = merge(x.first, merge(y.first, y.second));
    return ret;
  }

  inline T sum(const Ptr t) const { return t ? t->sum : T(); }

 protected:
  Ptr update(Ptr t) override {
    push(t);
    t->cnt = 1;
    t->sum = t->key;
    if (t->l) t->cnt += t->l->cnt, t->sum = f(t->l->sum, t->sum);
    if (t->r) t->cnt += t->r->cnt, t->sum = f(t->sum, t->r->sum);
    return t;
  }

  void push(Ptr) override {}
};

/**
 * @brief 遅延伝搬反転可能乱択平衡二分木
 * @docs docs/rbst/lazy-reversible-rbst.md
 */



namespace RBSTImpl {
pair<int, int> f(pair<int, int> a, pair<int, int> b) { return min(a, b); }
}  // namespace RBSTImpl

using Seg = RBST<pair<int, int>, RBSTImpl::f>;
using Ptr = typename Seg::Ptr;
Seg seg;

struct Data {
  vector<Ptr> dat;
  static constexpr int size_table[9] = {
      9, 90, 900, 9000, 90000, 900000, 9000000, 90000000, 900000000,
  };
  Data() { dat.push_back(nullptr); }

  void push(int val, int pos) {
    dat[0] = seg.merge(dat[0], seg.my_new(make_pair(val, pos)));
    for (int i = 0; i < (int)dat.size(); i++) {
      // cerr << "i " << i << " size " << seg.size(dat[i]) << "\n";
      if (seg.size(dat[i]) <= size_table[i]) break;
      if (i + 1 == (int)dat.size()) dat.push_back(nullptr);
      auto [x, y] = seg.split(dat[i], 1);
      dat[i] = y;
      dat[i + 1] = seg.merge(dat[i + 1], x);
    }
  }

  pair<int, int> query() {
    int res = INF, pos = -1;
    for (int i = 0; i < (int)dat.size(); i++) {
      auto [val, idx] = seg.sum(dat[i]);
      val += i + 1;
      if (val < res) res = val, pos = idx;
    }
    return {res, pos};
  }
};

int min_period(string S) {
  int N = sz(S);
  vi z = z_algorithm(S);
  rep1(i, N - 1) {
    if (N % i != 0) continue;
    if (z[i] == N - i) return i;
  }
  return N;
}
int num_len(int x) { return to_string(x).size(); }

string naive(string S) {
  int N = sz(S);
  vector<int> dp(N + 1, inf);
  vector<int> prev(N + 1, -1);
  dp[0] = 0;
  rep(i, N) reg(j, i + 1, N + 1) {
    int p = min_period(S.substr(i, j - i));
    int val = dp[i] + p + num_len((j - i) / p);
    if (amin(dp[j], val)) prev[j] = i;
  }
  string ans;
  for (int j = N; j != 0;) {
    int i = prev[j];
    int p = min_period(S.substr(i, j - i));
    string cur = S.substr(i, p) + to_string((j - i) / p);
    reverse(all(cur));
    ans += cur;
    j = i;
  }
  reverse(all(ans));
  assert(sz(ans) == dp[N]);
  return ans;
}

string calc(string S) {
  int N = sz(S);
  auto run = run_enumerate(S);

  VV<pi> rundata(N + 1);
  for (auto &[p, l, r] : run) {
    rep(i, p) if (l + i + 2 * p <= r) rundata[l + i + 2 * p].emplace_back(r, p);
  }
  vector<int> dp(N + 1, inf);
  vector<int> prev(N + 1, -1);
  dp[0] = 0;
  // dp[i] - i を保持する
  int prev_best = inf, prev_pos = -1;

  struct Data2 {
    int p, r;
    Data dat;
  };
  VV<Data2> datas(N + 1);

  rep(i, N + 1) {
    // dp[j] (j<i) からの遷移
    if (amin(dp[i], prev_best + i + 1)) prev[i] = prev_pos;
    // 新規 run の追加
    for (auto &[r, p] : rundata[i]) {
      Data2 dat;
      dat.r = r, dat.p = p;
      dat.dat.push(dp[i - 2 * p], i - 2 * p);
      dat.dat.push(dp[i - 1 * p], i - 1 * p);
      datas[i].push_back(dat);
    }
    // run からの遷移
    each(dat, datas[i]) {
      auto [val, pos] = dat.dat.query();
      // trc(i, dat.p, val, pos);
      if (amin(dp[i], val + dat.p)) prev[i] = pos;
    }
    // dp[i] の値, 決定

    // segtree の更新
    if (amin(prev_best, dp[i] - i)) prev_pos = i;
    // run の更新
    each(dat, datas[i]) {
      if (i + dat.p <= dat.r) {
        dat.dat.push(dp[i], i);
        int nxt = i + dat.p;
        datas[nxt].push_back(std::move(dat));
      }
    }
  }

  string ans;
  for (int j = N; j != 0;) {
    int i = prev[j];
    int p = min_period(S.substr(i, j - i));
    string cur = S.substr(i, p) + to_string((j - i) / p);
    reverse(all(cur));
    ans += cur;
    j = i;
  }
  reverse(all(ans));
  assert(sz(ans) == dp[N]);
  return ans;
}

string restore(string T, int limit) {
  string res;
  for (int i = 0; i < (int)T.size();) {
    int j = i;
    while (j < (int)T.size() and 'a' <= T[j] and T[j] <= 'z') j++;
    int k = j;
    while (k < (int)T.size() and '0' <= T[k] and T[k] <= '9') k++;
    if (i == j or j == k) return {};
    if (k - j > 15) return {};
    string sub = T.substr(i, j - i);
    int num = stoll(T.substr(j, k - j));
    while (num--) {
      res += sub;
      if ((int)res.size() > limit) return res;
    }
    i = k;
  }
  return res;
}

void check(string S) {
  auto an = naive(S);
  auto ac = calc(S);
  assert(restore(an, sz(S)) == S);
  assert(restore(ac, sz(S)) == S);
  if (sz(an) != sz(ac)) {
    exit(1);
  }
}

void q() {
  /*
  check("aaaaaaaaaa");
  check("baaaaaaaaa");
  check("aabababc");
  check("aaaaaaaaaa");
  rep1(len, 11) {
    rep(b, Power(3, len)) {
      string S;
      for (int x = b; sz(S) < len; x /= 3) S.push_back(x % 3 + 'a');
      check(S);
    }
  }
  rep1(len, 18) {
    rep(b, PW(len)) {
      string S;
      rep(i, len) S.push_back('a' + gbit(b, i));
      check(S);
    }
  }
  */

  ins(S);
  auto ans = calc(S);
  assert(restore(ans, sz(S)) == S);
  out(ans);
}

void Nyaan::solve() {
  int t = 1;
  in(t);
  while (t--) q();
}

yukicoder

結果

テストケース

ソースコード