tests/Run_Enumerate.test.cpp

View this file on GitHub
Last update: 2025-11-28 02:09:51+07:00
Problem: https://judge.yosupo.jp/problem/runenumerate

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/runenumerate"

#include "../misc/macros.h"
#include "../ds/RMQ.h"
#include "../strings/SuffixArray.h"

struct Run {
  int t, l, r;
  // So sánh để sort candidates: ưu tiên l, r, rồi đến t nhỏ nhất
  bool operator<(const Run& other) const {
    if (l != other.l) return l < other.l;
    if (r != other.r) return r < other.r;
    return t < other.t;
  }
  // So sánh để sort output cuối cùng (theo yêu cầu đề bài: thường là t, l, r)
  static bool compareOutput(const Run& a, const Run& b) {
    if (a.t != b.t) return a.t < b.t;
    if (a.l != b.l) return a.l < b.l;
    return a.r < b.r;
  }
};

template <class R>
int get_lcp(const SuffixArray& sa, R& rmq, int i, int j) {
  if (i == j) return sz(sa.sa) - 1 - i;
  int l = sa.rank[i], r = sa.rank[j];
  if (l > r) swap(l, r);
  return rmq.query(l + 1, r + 1);
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  string s;
  cin >> s;
  int n = sz(s);

  auto min_func = [](int a, int b) { return min(a, b); };

  SuffixArray sa(s);
  RMQ rmq(sa.lcp, min_func);

  string s_rev = s;
  reverse(all(s_rev));
  SuffixArray sa_rev(s_rev);
  RMQ rmq_rev(sa_rev.lcp, min_func);

  vector<Run> candidates;

  for (int t = 1; t <= n / 2; ++t) {
    for (int i = 0; i + t < n; i += t) {
      int j = i + t;
      int l1 = get_lcp(sa, rmq, i, j);
      int l2 = 0;
      if (i > 0) l2 = get_lcp(sa_rev, rmq_rev, n - i, n - j);

      if (l1 + l2 >= t && l2 < t) {
        // Lưu lại ứng viên (t, l, r)
        candidates.push_back({t, i - l2, i - l2 + t + l1 + l2});
      }
    }
  }

  // BƯỚC 1: Sort candidates theo (l, r, t)
  sort(all(candidates));

  // BƯỚC 2: Lọc trùng (giữ t nhỏ nhất cho cùng l, r)
  vector<Run> result;
  for (auto& run : candidates) {
    if (!result.empty()) {
      Run& last = result.back();
      if (last.l == run.l && last.r == run.r) continue;  // Đã có run cùng l,r với t nhỏ hơn -> Bỏ qua
    }
    result.push_back(run);
  }

  // BƯỚC 3: Sort kết quả theo (t, l, r) để in ra
  sort(all(result), Run::compareOutput);

  cout << sz(result) << "\n";
  for (auto& run : result) {
    cout << run.t << " " << run.l << " " << run.r << "\n";
  }
}

#line 1 "tests/Run_Enumerate.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/runenumerate"

#line 1 "misc/macros.h"
// #pragma GCC optimize("Ofast,unroll-loops")       // unroll long, simple loops
// #pragma GCC target("avx2,fma")                   // vectorizing code
// #pragma GCC target("lzcnt,popcnt,abm,bmi,bmi2")  // for fast bitset operation

#include <bits/extc++.h>
#include <tr2/dynamic_bitset>

using namespace std;
using namespace __gnu_pbds;  // ordered_set, gp_hash_table
// using namespace __gnu_cxx; // rope

// for templates to work
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define pb push_back
#define eb emplace_back
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using ld = long double;
using pii = pair<i32, i32>;
using vi = vector<i32>;

// fast map
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {  // customize hash function for gp_hash_table
  int operator()(int x) const { return x ^ RANDOM; }
};
gp_hash_table<int, int, chash> table;

/* ordered set
    find_by_order(k): returns an iterator to the k-th element (0-based)
    order_of_key(k): returns the number of elements in the set that are strictly less than k
*/
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

/*  rope
    rope <int> cur = v.substr(l, r - l + 1);
    v.erase(l, r - l + 1);
    v.insert(v.mutable_begin(), cur);
*/
#line 1 "ds/RMQ.h"
template <class T, class F>
struct RMQ {
  vector<vector<T>> jmp;
  const F f;
  RMQ(const vector<T>& V, F f) : jmp(1, V), f(f) {
    for (int pw = 1, k = 1; pw * 2 <= sz(V); pw *= 2, ++k) {
      jmp.eb(sz(V) - pw * 2 + 1);
      for (int j = 0; j < sz(jmp[k]); ++j) jmp[k][j] = f(jmp[k - 1][j], jmp[k - 1][j + pw]);
    }
  }
  // [a, b)
  T query(int a, int b) {
    assert(a < b);
    int dep = 31 - __builtin_clz(b - a);
    return f(jmp[dep][a], jmp[dep][b - (1 << dep)]);
  }
};
#line 1 "strings/SuffixArray.h"
struct SuffixArray {
  vector<int> sa, lcp, rank;
  SuffixArray(string s, int lim = 256) {
    int n = s.size() + 1, k = 0, a, b;
    s.push_back(0);
    vector<int> y(n), cnt(max(n, lim));
    sa.resize(n), lcp.resize(n), rank.resize(n);
    for (int i = 0; i < n; ++i) rank[i] = s[i];
    iota(sa.begin(), sa.end(), 0);
    
    for (int j = 0, p = 0; p < n; j = max(1, j * 2), lim = p) {
      p = j;
      iota(all(y), n - j);
      for (int i = 0; i < n; ++i)
        if (sa[i] >= j) y[p++] = sa[i] - j;
      fill(all(cnt), 0);
      for (int i = 0; i < n; ++i) cnt[rank[i]]++;
      for (int i = 1; i < lim; ++i) cnt[i] += cnt[i - 1];
      for (int i = n; i--;) sa[--cnt[rank[y[i]]]] = y[i];
      swap(rank, y), p = 1, rank[sa[0]] = 0;
      for (int i = 1; i < n; ++i) {
        a = sa[i - 1], b = sa[i];
        int val_a = (a + j < n) ? y[a + j] : -1;
        int val_b = (b + j < n) ? y[b + j] : -1;
        rank[b] = (y[a] == y[b] && val_a == val_b) ? p - 1 : p++;
      }
    }
    
    for (int i = 0; i < n; ++i) rank[sa[i]] = i;
    for (int i = 0, j; i < n - 1; lcp[rank[i++]] = k)
      for (k && k--, j = sa[rank[i] - 1]; s[i + k] == s[j + k]; k++);
  }
};
#line 6 "tests/Run_Enumerate.test.cpp"

struct Run {
  int t, l, r;
  // So sánh để sort candidates: ưu tiên l, r, rồi đến t nhỏ nhất
  bool operator<(const Run& other) const {
    if (l != other.l) return l < other.l;
    if (r != other.r) return r < other.r;
    return t < other.t;
  }
  // So sánh để sort output cuối cùng (theo yêu cầu đề bài: thường là t, l, r)
  static bool compareOutput(const Run& a, const Run& b) {
    if (a.t != b.t) return a.t < b.t;
    if (a.l != b.l) return a.l < b.l;
    return a.r < b.r;
  }
};

template <class R>
int get_lcp(const SuffixArray& sa, R& rmq, int i, int j) {
  if (i == j) return sz(sa.sa) - 1 - i;
  int l = sa.rank[i], r = sa.rank[j];
  if (l > r) swap(l, r);
  return rmq.query(l + 1, r + 1);
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  string s;
  cin >> s;
  int n = sz(s);

  auto min_func = [](int a, int b) { return min(a, b); };

  SuffixArray sa(s);
  RMQ rmq(sa.lcp, min_func);

  string s_rev = s;
  reverse(all(s_rev));
  SuffixArray sa_rev(s_rev);
  RMQ rmq_rev(sa_rev.lcp, min_func);

  vector<Run> candidates;

  for (int t = 1; t <= n / 2; ++t) {
    for (int i = 0; i + t < n; i += t) {
      int j = i + t;
      int l1 = get_lcp(sa, rmq, i, j);
      int l2 = 0;
      if (i > 0) l2 = get_lcp(sa_rev, rmq_rev, n - i, n - j);

      if (l1 + l2 >= t && l2 < t) {
        // Lưu lại ứng viên (t, l, r)
        candidates.push_back({t, i - l2, i - l2 + t + l1 + l2});
      }
    }
  }

  // BƯỚC 1: Sort candidates theo (l, r, t)
  sort(all(candidates));

  // BƯỚC 2: Lọc trùng (giữ t nhỏ nhất cho cùng l, r)
  vector<Run> result;
  for (auto& run : candidates) {
    if (!result.empty()) {
      Run& last = result.back();
      if (last.l == run.l && last.r == run.r) continue;  // Đã có run cùng l,r với t nhỏ hơn -> Bỏ qua
    }
    result.push_back(run);
  }

  // BƯỚC 3: Sort kết quả theo (t, l, r) để in ra
  sort(all(result), Run::compareOutput);

  cout << sz(result) << "\n";
  for (auto& run : result) {
    cout << run.t << " " << run.l << " " << run.r << "\n";
  }
}