ac-library-rb 0.6.1 → 1.0.0

data/document_en/segtree.md

@@ -147,10 +147,10 @@ It returns an index l that satisfies both of the following.
 
 ## Verified
 
-- [ALPC: J \- Segment Tree](https://atcoder.jp/contests/practice2/tasks/practice2_j)
+- [ALPC: J - Segment Tree](https://atcoder.jp/contests/practice2/tasks/practice2_j)
   - [AC Code(884ms) max_right](https://atcoder.jp/contests/practice2/submissions/23196480)
   - [AC Code(914ms) min_left](https://atcoder.jp/contests/practice2/submissions/23197311)
-- [F \- Range Xor Query](https://atcoder.jp/contests/abc185/tasks/abc185_f)
+- [F - Range Xor Query](https://atcoder.jp/contests/abc185/tasks/abc185_f)
   - [AC Code(1538ms)](https://atcoder.jp/contests/abc185/submissions/18746817): Segtree(xor)
   - [AC Code(821ms)](https://atcoder.jp/contests/abc185/submissions/18769200): FenwickTree(BIT) xor
 

data/document_ja/dsu.md

@@ -131,7 +131,7 @@ d.groups
 
 ## Verified
 
-- [A \- Disjoint Set Union](https://atcoder.jp/contests/practice2/tasks/practice2_a)
+- [A - Disjoint Set Union](https://atcoder.jp/contests/practice2/tasks/practice2_a)
 
 ## 参考リンク
 

data/document_ja/fenwick_tree.md

@@ -69,9 +69,9 @@ fw._sum(pos)
 
 ## Verified
 
-- [AtCoder ALPC B \- Fenwick Tree](https://atcoder.jp/contests/practice2/tasks/practice2_b)
+- [AtCoder ALPC B - Fenwick Tree](https://atcoder.jp/contests/practice2/tasks/practice2_b)
   [ACコード(17074108)]https://atcoder.jp/contests/practice2/submissions/17074108 (1272ms)
-- [F \- Range Xor Query](https://atcoder.jp/contests/abc185/tasks/abc185_f)
+- [F - Range Xor Query](https://atcoder.jp/contests/abc185/tasks/abc185_f)
   FenwickTree(BIT)をxorに改造するだけでも解けます。
   [ACコード(821ms)](https://atcoder.jp/contests/abc185/submissions/18769200)。FenwickTree(BIT)のxor改造版です。
 

data/document_ja/lazy_segtree.md

@@ -138,8 +138,8 @@ LazySegtree上で、二分探索をします。
 - [AIZU ONLINE JUDGE DSL\_2\_I RSQ and RUQ](https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_I) ([旧DSL_2_I](http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_I))
 
 以下の問題は、Rubyでは実行時間が厳しくTLEになりACできてないです。
-- [ALPC: K \- Range Affine Range Sum](https://atcoder.jp/contests/practice2/tasks/practice2_k)
-- [ALPC: L \- Lazy Segment Tree](https://atcoder.jp/contests/practice2/tasks/practice2_l)
+- [ALPC: K - Range Affine Range Sum](https://atcoder.jp/contests/practice2/tasks/practice2_k)
+- [ALPC: L - Lazy Segment Tree](https://atcoder.jp/contests/practice2/tasks/practice2_l)
 
 下記は、ジャッジにだしてないが、サンプルに正解。`max_right`, `min_left`を使う問題。
 - [Quora Programming Challenge 2021: Skyscraper](https://jonathanirvin.gs/files/division2_3d16774b0423.pdf#page=5)

data/document_ja/math.md

@@ -70,7 +70,7 @@ Chinese remainder theorem
 ### Verified
 
 問題
-- [No\.187 中華風 \(Hard\) \- yukicoder](https://yukicoder.me/problems/no/187)
+- [No\.187 中華風 \(Hard\) - yukicoder](https://yukicoder.me/problems/no/187)
 
 ## floor_sum(n, m, a, b)
 
@@ -86,7 +86,7 @@ $\sum_{i = 0}^{n - 1} \mathrm{floor}(\frac{a \times i + b}{m})$
 
 ### Verified
 
-[ALPC: C \- Floor Sum](https://atcoder.jp/contests/practice2/tasks/practice2_c)
+[ALPC: C - Floor Sum](https://atcoder.jp/contests/practice2/tasks/practice2_c)
  - [ACコード 426ms 2020/9/14](https://atcoder.jp/contests/practice2/submissions/16735215)
 
 ## 参考リンク
@@ -107,7 +107,7 @@ $\sum_{i = 0}^{n - 1} \mathrm{floor}(\frac{a \times i + b}{m})$
   - [本家ライブラリの実装コード internal_math.hpp](https://github.com/atcoder/ac-library/blob/master/atcoder/internal_math.hpp)
   - [本家ライブラリのテストコード math_test.cpp](https://github.com/atcoder/ac-library/blob/master/test/unittest/math_test.cpp)
   - [本家ライブラリのドキュメント math.md](https://github.com/atcoder/ac-library/blob/master/document_ja/math.md)
-  - [Relax the constraints of floor\_sum? · Issue \#33 · atcoder/ac\-library](https://github.com/atcoder/ac-library/issues/33)
+  - [Relax the constraints of floor\_sum? · Issue \#33 · atcoder/ac-library](https://github.com/atcoder/ac-library/issues/33)
 
 ## Q&A
 

data/document_ja/max_flow.md

@@ -87,9 +87,9 @@ graph.edges
 
 ## Verified
 
-[ALPC: D \- Maxflow](https://atcoder.jp/contests/practice2/tasks/practice2_d)
+[ALPC: D - Maxflow](https://atcoder.jp/contests/practice2/tasks/practice2_d)
 - [ACコード 211ms 2020/9/17](https://atcoder.jp/contests/practice2/submissions/16789801)
-- [ALPC: D解説 \- Qiita](https://qiita.com/magurofly/items/bfaf6724418bfde86bd0)
+- [ALPC: D解説 - Qiita](https://qiita.com/magurofly/items/bfaf6724418bfde86bd0)
 
 ## 参考リンク
 
@@ -108,7 +108,7 @@ graph.edges
 
 ### `flow`メソッドの`flow_limit`のデフォルトは 何故`1 << 64`
 
-記憶になく、深い意味はないです。
+意味はないです。
 `Float::MAX`や`Float::INFINITY`でも良さそうですが、遅くならないでしょうか。
 
 ### 辺にStructは使わないの
@@ -119,10 +119,7 @@ Structを使った方がコードがスリムになって上級者ぽくもあ
 
 ### `_`始まりの変数の意図は
 
-ちょっと紛らわしいのですが、別々に2種類の意図があります。
-
-1. `_e`や`_re`は、本家ACLコードと一緒に読みやすいように、変数名を合わせています。
-2.  `_rev`は、`each`で回す都合上吐き出すけれど使わないので、「使わない」という意図で`_`始まりにしています。
+`_rev`は、`each`で回す都合上吐き出すけれど使わないので、「使わない」という意図で`_`始まりにしています。
 
 ```ruby
 @g[q].each do |(to, _rev, cap)|

data/document_ja/min_cost_flow.md

@@ -73,7 +73,7 @@ graph.edges
 
 ## Verified
 
-[ALPC: E \- MinCostFlow](https://atcoder.jp/contests/practice2/tasks/practice2_e)
+[ALPC: E - MinCostFlow](https://atcoder.jp/contests/practice2/tasks/practice2_e)
 - [1213ms 2020/9/17](https://atcoder.jp/contests/practice2/submissions/16792967)
 
 ## 参考リンク
@@ -86,17 +86,18 @@ graph.edges
   - [本家ライブラリの実装コード mincostflow.hpp(GitHub)](https://github.com/atcoder/ac-library/blob/master/atcoder/mincostflow.hpp)
   - [本家ライブラリのテストコード mincostflow_test.cpp(GitHub)](https://github.com/atcoder/ac-library/blob/master/test/unittest/mincostflow_test.cpp)
 
-## Q&A
+## 備考
 
 ### エイリアスの意図は
 
-本家ライブラリの最小費用流の方のメソッド名が長いので、エイリアスを持たせています。本家ライブラリの最大流の方のメソッド名は短いので、不思議です。
+本家ライブラリの最小費用流の方のメソッド名が長いので、エイリアスを持たせています。  
+本家ライブラリの最大流の方のメソッド名は短いので、不思議です。
 
 ### `Float::INFINITY`ではなく、`Float::MAX`を使う意図とは
 
 特に検証してないので、何の数値がいいのか検証したいです。
 
-`Integer`クラスでも良いよいな気がしました。
+`Integer`クラスでも良いような気がしました。
 
 ### 辺にStructは使わないの
 

data/document_ja/modint.md

@@ -199,9 +199,9 @@ p 12.to_m == 1 #=> true
 
 ## Verified
 
-- [ABC156: D \- Bouquet](https://atcoder.jp/contests/abc156/tasks/abc156_d) 2020/2/22開催
+- [ABC156: D - Bouquet](https://atcoder.jp/contests/abc156/tasks/abc156_d) 2020/2/22開催
   - [ACコード 138ms 2020/10/5](https://atcoder.jp/contests/abc156/submissions/17205940)
-- [ARC009: C \- 高橋君、24歳](https://atcoder.jp/contests/arc009/tasks/arc009_3) 2012/10/20開催
+- [ARC009: C - 高橋君、24歳](https://atcoder.jp/contests/arc009/tasks/arc009_3) 2012/10/20開催
   - [ACコード 1075ms 2020/10/5](https://atcoder.jp/contests/arc009/submissions/17206081)
   - [ACコード 901ms 2020/10/5](https://atcoder.jp/contests/arc009/submissions/17208378)
 
@@ -221,8 +221,8 @@ p 12.to_m == 1 #=> true
 - Rubyリファレンスマニュアル
   - [class Numeric \(Ruby 2\.7\.0 リファレンスマニュアル\)](https://docs.ruby-lang.org/ja/latest/class/Numeric.html)
 - その他
-  - [modint 構造体を使ってみませんか？ \(C\+\+\) \- noshi91のメモ](https://noshi91.hatenablog.com/entry/2019/03/31/174006)(2019/3/31)
-  - [Pythonでmodintを実装してみた \- Qiita](https://qiita.com/wotsushi/items/c936838df992b706084c)(2019/4/1)
+  - [modint 構造体を使ってみませんか？ \(C\+\+\) - noshi91のメモ](https://noshi91.hatenablog.com/entry/2019/03/31/174006)(2019/3/31)
+  - [Pythonでmodintを実装してみた - Qiita](https://qiita.com/wotsushi/items/c936838df992b706084c)(2019/4/1)
   - [C#版のModIntのドキュメント](https://github.com/key-moon/ac-library-cs/blob/master/document_ja/modint.md)
   
 

data/document_ja/scc.md

@@ -50,17 +50,18 @@ graph.scc
 
 ## Verified
 
-- [ALPC: G \- SCC](https://atcoder.jp/contests/practice2/tasks/practice2_g)  
-  - [2538ms 2020/9/8](https://atcoder.jp/contests/practice2/submissions/16569175)  
-- [競プロ典型 90 問: 021 - Come Back in One Piece][https://atcoder.jp/contests/typical90/tasks/typical90_u]
+- [ALPC: G - SCC](https://atcoder.jp/contests/practice2/tasks/practice2_g)  
+  - [Ruby2.7 1848ms 2022/11/22](https://atcoder.jp/contests/practice2/submissions/36708506)
+- [競プロ典型 90 問: 021 - Come Back in One Piece](https://atcoder.jp/contests/typical90/tasks/typical90_u)
+  - [Ruby2.7 471ms 2021/6/15](https://atcoder.jp/contests/typical90/submissions/23487102)
 
 # 参考リンク
 
 - 当ライブラリ
-  - [当ライブラリの実装コード scc\.rb](https://github.com/universato/ac-library-rb/blob/master/lib/scc.rb)
-  - [当ライブラリの実装コード scc_test\.rb](https://github.com/universato/ac-library-rb/blob/master/test/scc_test.rb)
+  - [当ライブラリの実装コード scc.rb](https://github.com/universato/ac-library-rb/blob/master/lib/scc.rb)
+  - [当ライブラリの実装コード scc_test.rb](https://github.com/universato/ac-library-rb/blob/master/test/scc_test.rb)
 - 本家ライブラリ
-  - [本家ライブラリの実装コード scc\.hpp](https://github.com/atcoder/ac-library/blob/master/atcoder/scc.hpp)
-  - [本家ライブラリのドキュメント scc\.md](https://github.com/atcoder/ac-library/blob/master/document_ja/scc.md)
+  - [本家ライブラリの実装コード scc.hpp](https://github.com/atcoder/ac-library/blob/master/atcoder/scc.hpp)
+  - [本家ライブラリのドキュメント scc.md](https://github.com/atcoder/ac-library/blob/master/document_ja/scc.md)
 - その他
-  - [強連結成分分解の意味とアルゴリズム \| 高校数学の美しい物語](https://mathtrain.jp/kyorenketsu)
+  - [強連結成分分解の意味とアルゴリズム | 高校数学の美しい物語](https://mathtrain.jp/kyorenketsu)

data/document_ja/segtree.md

@@ -141,11 +141,11 @@ Segtree上で`0 <= l <= r`の範囲で、`f(prod(l, r))`の結果を二分探索
 
 ## Verified
 
-- [ALPC: J \- Segment Tree](https://atcoder.jp/contests/practice2/tasks/practice2_j)
+- [ALPC: J - Segment Tree](https://atcoder.jp/contests/practice2/tasks/practice2_j)
   - [AC Code(884ms) max_right](https://atcoder.jp/contests/practice2/submissions/23196480)
   - [AC Code(914ms) min_left](https://atcoder.jp/contests/practice2/submissions/23197311)
 
-- [ABC185: F \- Range Xor Query](https://atcoder.jp/contests/abc185/tasks/abc185_f)
+- [ABC185: F - Range Xor Query](https://atcoder.jp/contests/abc185/tasks/abc185_f)
   - xorのセグメントツリーの基本的な典型問題です。FenwickTree(BIT)をxorに改造するだけでも解けます。
   - [ACコード(1538ms)](https://atcoder.jp/contests/abc185/submissions/18746817): 通常のSegtree解。
   - [ACコード(821ms)](https://atcoder.jp/contests/abc185/submissions/18769200): FenwickTree(BIT)のxor改造版。

data/lib/ac-library-rb/version.rb

@@ -1,3 +1,3 @@
 module AcLibraryRb
-  VERSION = "0.6.1".freeze
+  VERSION = "1.0.0".freeze
 end

data/lib/convolution.rb

@@ -124,7 +124,7 @@ class Convolution
 end
 
 # [EXPERIMENTAL]
-def convolution(a, b, mod: 998244353, k: 35, z: 99)
+def convolution(a, b, mod: 998_244_353, k: 35, z: 99)
   n = a.size
   m = b.size
   return [] if n == 0 || m == 0

data/lib/dsu.rb

@@ -1,6 +1,6 @@
 # Disjoint Set Union
 class DSU
-  def initialize(n)
+  def initialize(n = 0)
     @n = n
     @parent_or_size = Array.new(n, -1)
     # root node: -1 * component size
@@ -35,6 +35,15 @@ class DSU
   alias root leader
   alias find leader
 
+  def [](a)
+    if @n <= a
+      @parent_or_size.concat([-1] * (a - @n + 1))
+      @n = @parent_or_size.size
+    end
+
+    @parent_or_size[a] < 0 ? a : (@parent_or_size[a] = self[@parent_or_size[a]])
+  end
+
   def size(a)
     -@parent_or_size[leader(a)]
   end
@@ -42,6 +51,10 @@ class DSU
   def groups
     (0 ... @parent_or_size.size).group_by{ |i| leader(i) }.values
   end
+
+  def to_s
+    "<#{self.class}: @n=#{@n}, #{@parent_or_size}>"
+  end
 end
 
 UnionFind = DSU

data/lib/fenwick_tree.rb

@@ -59,4 +59,8 @@ class FenwickTree
     res
   end
   alias left_sum _sum
+
+  def to_s
+    "<#{self.class}: @size=#{@size}, (#{@data[1..].join(', ')})>"
+  end
 end

data/lib/lazy_segtree.rb

@@ -153,9 +153,7 @@ class LazySegtree
     sm = @e
 
     loop do
-      while l.even?
-        l >>= 1
-      end
+      l >>= 1 while l.even?
       unless g.call(@op.call(sm, @d[l]))
         while l < @size
           push(l)
@@ -183,9 +181,7 @@ class LazySegtree
 
     loop do
       r -= 1
-      while r > 1 && r.odd?
-        r /= 2
-      end
+      r /= 2 while r > 1 && r.odd?
       unless g.call(@op.call(@d[r], sm))
         while r < @size
           push(r)

data/lib/max_flow.rb

@@ -36,39 +36,40 @@ class MaxFlow
 
   # return edge = [from, to, cap, flow]
   def [](i)
-    _e  = @g[@pos[i][0]][@pos[i][1]]
-    _re = @g[_e[0]][_e[1]]
-    [@pos[i][0], _e[0], _e[-1] + _re[-1], _re[-1]]
+    from, from_id = @pos[i]
+
+    to, to_id, cap = @g[from][from_id]    # edge
+    _from, _from_id, flow = @g[to][to_id] # reverse edge
+
+    [from, to, cap + flow, flow]
   end
   alias get_edge []
   alias edge []
 
   def edges
-    @pos.map do |(from, id)|
-      _e  = @g[from][id]
-      _re = @g[_e[0]][_e[1]]
-      [from, _e[0], _e[-1] + _re[-1], _re[-1]]
+    @pos.map do |(from, from_id)|
+      to, to_id, cap = @g[from][from_id]
+      _from, _from_id, flow = @g[to][to_id]
+      [from, to, cap + flow, flow]
     end
   end
 
   def change_edge(i, new_cap, new_flow)
-    _e  = @g[@pos[i][0]][@pos[i][1]]
-    _re = @g[_e[0]][_e[1]]
-    _e[2]  = new_cap - new_flow
-    _re[2] = new_flow
+    from, from_id = @pos[i]
+
+    e = @g[from][from_id]
+    re = @g[e[0]][e[1]]
+    e[2]  = new_cap - new_flow
+    re[2] = new_flow
   end
 
   def flow(s, t, flow_limit = 1 << 64)
-    level = Array.new(@n)
-    iter  = Array.new(@n)
-    que   = []
-
     flow = 0
     while flow < flow_limit
-      bfs(s, t, level, que)
+      level = bfs(s, t)
       break if level[t] == -1
 
-      iter.fill(0)
+      iter = [0] * @n
       while flow < flow_limit
         f = dfs(t, flow_limit - flow, s, level, iter)
         break if f == 0
@@ -98,22 +99,22 @@ class MaxFlow
 
   private
 
-  def bfs(s, t, level, que)
-    level.fill(-1)
+  def bfs(s, t)
+    level = Array.new(@n, -1)
     level[s] = 0
-    que.clear
-    que << s
+    que = [s]
 
     while (v = que.shift)
-      @g[v].each do |e|
-        next if e[2] == 0 || level[e[0]] >= 0
+      @g[v].each do |u, _, cap|
+        next if cap == 0 || level[u] >= 0
 
-        level[e[0]] = level[v] + 1
-        return nil if e[0] == t
+        level[u] = level[v] + 1
+        return level if u == t
 
-        que << e[0]
+        que << u
       end
     end
+    level
   end
 
   def dfs(v, up, s, level, iter)

data/lib/modint.rb

@@ -4,7 +4,7 @@ require_relative './core_ext/modint.rb'
 class ModInt < Numeric
   class << self
     def set_mod(mod)
-      raise ArgumentError unless mod.is_a? Integer and 1 <= mod
+      raise ArgumentError unless mod.is_a?(Integer) && (1 <= mod)
 
       $_mod = mod
       $_mod_is_prime = ModInt.prime?(mod)
@@ -26,7 +26,7 @@ class ModInt < Numeric
 
     def prime?(n)
       return false if n <= 1
-      return true if n == 2 or n == 7 or n == 61
+      return true if (n == 2) || (n == 7) || (n == 61)
       return false if (n & 1) == 0
 
       d = n - 1
@@ -34,11 +34,11 @@ class ModInt < Numeric
       [2, 7, 61].each do |a|
         t = d
         y = a.pow(t, n)
-        while t != n - 1 and y != 1 and y != n - 1
+        while (t != n - 1) && (y != 1) && (y != n - 1)
           y = y * y % n
           t <<= 1
         end
-        return false if y != n - 1 and (t & 1) == 0
+        return false if (y != n - 1) && ((t & 1) == 0)
       end
       true
     end

data/lib/priority_queue.rb

@@ -13,11 +13,17 @@ class PriorityQueue
     heapify
   end
 
+  def self.[](*array, &comp)
+    new(array, &comp)
+  end
+
   attr_reader :heap
+  alias to_a heap
 
   # Push new element to the heap.
   def push(item)
     shift_down(0, @heap.push(item).size - 1)
+    self
   end
 
   alias << push
@@ -46,6 +52,14 @@ class PriorityQueue
     @heap.empty?
   end
 
+  def size
+    @heap.size
+  end
+
+  def to_s
+    "<#{self.class}: @heap:(#{heap.join(', ')}), @comp:<#{@comp.class} #{@comp.source_location.join(':')}>>"
+  end
+
   private
 
   def heapify

data/lib/scc.rb

@@ -3,17 +3,17 @@ class SCC
   # initialize graph with n vertices
   def initialize(n)
     @n = n
-    @edges = []
+    @edges = Array.new(n) { [] }
   end
 
   # add directed edge
   def add_edge(from, to)
-    unless 0 <= from && from < @n and 0 <= to && to < @n
+    unless 0 <= from && from < @n && 0 <= to && to < @n
       msg = "Wrong params: from=#{from} and to=#{to} must be in 0...#{@n}"
       raise ArgumentError.new(msg)
     end
 
-    @edges << [from, to]
+    @edges[from] << to
     self
   end
 
@@ -28,7 +28,7 @@ class SCC
 
   # returns list of strongly connected components
   # the components are sorted in topological order
-  # O(@n + @edges.size)
+  # O(@n + @edges.sum(&:size))
   def scc
     group_num, ids = scc_ids
     groups = Array.new(group_num) { [] }
@@ -39,47 +39,49 @@ class SCC
   private
 
   def scc_ids
-    start, elist = csr
-    now_ord = group_num = 0
-    visited, low, ord, ids = [], [], [-1] * @n, []
-    dfs = ->(v) {
-      low[v] = ord[v] = now_ord
-      now_ord += 1
-      visited << v
-      (start[v]...start[v + 1]).each do |i|
-        to = elist[i]
-        low[v] = if ord[to] == -1
-                   dfs.(to)
-                   [low[v], low[to]].min
-                 else
-                   [low[v], ord[to]].min
-                 end
-      end
-      if low[v] == ord[v]
-        loop do
-          u = visited.pop
-          ord[u] = @n
-          ids[u] = group_num
+    now_ord = 0
+
+    visited = []
+    low = Array.new(@n, 1 << 60)
+    ord = Array.new(@n, -1)
+    group_num = 0
+
+    (0...@n).each do |v|
+      next if ord[v] != -1
+
+      stack = [[v, 0]]
+
+      while (v, i = stack.pop)
+        if i == 0
+          visited << v
+          low[v] = ord[v] = now_ord
+          now_ord += 1
+        end
+
+        while i < @edges[v].size
+          u = @edges[v][i]
+          i += 1
+
+          if ord[u] == -1
+            stack << [v, i] << [u, 0]
+            break 1
+          end
+        end and next
+
+        low[v] = [low[v], @edges[v].map { |e| low[e] }.min || @n].min
+        next if low[v] != ord[v]
+
+        while (u = visited.pop)
+          low[u] = @n
+          ord[u] = group_num
           break if u == v
         end
         group_num += 1
-      end
-    }
-    @n.times { |i| dfs.(i) if ord[i] == -1 }
-    ids = ids.map { |x| group_num - 1 - x }
-    [group_num, ids]
-  end
 
-  def csr
-    start = [0] * (@n + 1)
-    elist = [nil] * @edges.size
-    @edges.each { |(i, _)| start[i + 1] += 1 }
-    @n.times { |i| start[i + 1] += start[i] }
-    counter = start.dup
-    @edges.each do |(i, j)|
-      elist[counter[i]] = j
-      counter[i] += 1
+      end
     end
-    [start, elist]
+
+    ord.map! { |e| group_num - e - 1 }
+    [group_num, ord]
   end
 end

data/lib/two_sat.rb

@@ -12,7 +12,7 @@ class TwoSAT
   attr_reader :answer
 
   def add_clause(i, f, j, g)
-    unless 0 <= i && i < @n and 0 <= j && j < @n
+    unless 0 <= i && i < @n && 0 <= j && j < @n
       raise ArgumentError.new("i:#{i} and j:#{j} must be in (0...#{@n})")
     end
 

data/lib_lock/ac-library-rb/convolution.rb

@@ -125,7 +125,7 @@ module AcLibraryRb
   end
 
   # [EXPERIMENTAL]
-  def convolution(a, b, mod: 998244353, k: 35, z: 99)
+  def convolution(a, b, mod: 998_244_353, k: 35, z: 99)
     n = a.size
     m = b.size
     return [] if n == 0 || m == 0

data/lib_lock/ac-library-rb/dsu.rb

@@ -1,7 +1,7 @@
 module AcLibraryRb
   # Disjoint Set Union
   class DSU
-    def initialize(n)
+    def initialize(n = 0)
       @n = n
       @parent_or_size = Array.new(n, -1)
       # root node: -1 * component size
@@ -36,6 +36,15 @@ module AcLibraryRb
     alias root leader
     alias find leader
 
+    def [](a)
+      if @n <= a
+        @parent_or_size.concat([-1] * (a - @n + 1))
+        @n = @parent_or_size.size
+      end
+
+      @parent_or_size[a] < 0 ? a : (@parent_or_size[a] = self[@parent_or_size[a]])
+    end
+
     def size(a)
       -@parent_or_size[leader(a)]
     end
@@ -43,6 +52,10 @@ module AcLibraryRb
     def groups
       (0 ... @parent_or_size.size).group_by{ |i| leader(i) }.values
     end
+
+    def to_s
+      "<#{self.class}: @n=#{@n}, #{@parent_or_size}>"
+    end
   end
 
   UnionFind = DSU

data/lib_lock/ac-library-rb/fenwick_tree.rb

@@ -60,5 +60,9 @@ module AcLibraryRb
       res
     end
     alias left_sum _sum
+
+    def to_s
+      "<#{self.class}: @size=#{@size}, (#{@data[1..].join(', ')})>"
+    end
   end
 end

data/lib_lock/ac-library-rb/lazy_segtree.rb

@@ -154,9 +154,7 @@ module AcLibraryRb
       sm = @e
 
       loop do
-        while l.even?
-          l >>= 1
-        end
+        l >>= 1 while l.even?
         unless g.call(@op.call(sm, @d[l]))
           while l < @size
             push(l)
@@ -184,9 +182,7 @@ module AcLibraryRb
 
       loop do
         r -= 1
-        while r > 1 && r.odd?
-          r /= 2
-        end
+        r /= 2 while r > 1 && r.odd?
         unless g.call(@op.call(@d[r], sm))
           while r < @size
             push(r)