ac-library-rb 0.5.3 → 0.5.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: cb356bb0c8bcb397f6422ce68964cfc7cdb3bda6915b91e1c57a20045e789407
-  data.tar.gz: de638d458475278d7c34fe2a79633592e7c17325c27e6725b4a8a59f8049e7e9
+  metadata.gz: 7eb404ec2eab941e961da5a9cc0e19b87858a33101c791750a2e33d61781f8b8
+  data.tar.gz: a341ee2e478add1f3e611071213911dd919e7229ca3cc8cc9c19880e3e471467
 SHA512:
-  metadata.gz: c2802262ebc08af6b69cd20c7f756aea82c17b3e5ed242e94d1b2f7934ee36a519375ef0f4a1eb2e2188b740ee7669e63755996c74984a69e9bd0417de3141f7
-  data.tar.gz: 44dc88cad01600c5696b97230e332cf646a5d5c4e5cb2d73937eaae2d66008c43656284e702a523d152039ec7c53daf71ede355763bb9416339313cb356456ca
+  metadata.gz: 053064e9c40fe91e306a7695906bec15ef8752c3ddfa54f7954bf83f5954a626370f9390034f0777c0e403460f7ed650707a89be6a02d88c49cb52cdb0da5ffb
+  data.tar.gz: 910dd3b9d493efba69cfe458a41a82c28ba4b5dde013521f56b29fbe7f3737d7d82fd50424b205c98683f0691da843de6ffc3ec58dd5cdf75e7d7ed1d94f1185

data/.rubocop.yml

@@ -121,6 +121,9 @@ Style/BlockDelimiters:
     - 'test/z_algorithm_test.rb'
 Style/Documentation:
   Enabled: false
+tyle/EmptyElse:
+  Exclude:
+    - 'test/segtree_test.rb'
 Style/GlobalVars:
   AutoCorrect: false
   Exclude:
@@ -128,6 +131,9 @@ Style/GlobalVars:
     - 'test/lazy_segtree_test.rb'
 Style/FrozenStringLiteralComment:
   Enabled: false
+Style/InfiniteLoop:
+  Exclude:
+    - 'lib/floor_sum.rb'
 Style/InverseMethods:
   AutoCorrect: false
   Exclude:

data/README.md

@@ -100,7 +100,14 @@ $ rake
 $ ruby test/fenwick_tree_test.rb
 ```
 
-# Other language Japanese version
+# Other
+
+## Other languages's ac-library
+
+- [Unofficial Portings of AtCoder Library](https://docs.google.com/spreadsheets/d/19jMAqUbv98grVkLV_Lt54x5B8ILoTcvBzG8EbSvf5gY/edit#gid=0) (by [not522-san](https://github.com/not522))
+
+
+## Other language Japanese version
 
 [README 日本語バージョン(ver. Japanese)](README.ja.md)
 - [ライブラリ目次: index.md](https://github.com/universato/ac-library-rb/blob/master/document_ja/index.md)

data/document_en/segtree.md

@@ -104,26 +104,38 @@ It returns `op(a[0], ..., a[n - 1])`.
 seg.max_right(l, &f)
 ```
 
+It applies binary search on the segment tree.
+
+It returns an index `r` that satisfies both of the following.
+
+- `r = l` or `f(prod(l, r)) = true`
+- `r = n` or `f(prod(l, r + 1)) = false`
+
+
 **Constraints**
 
+- `f(e) = true`
 - `0 ≦ l ≦ n`
 
 **Complexity**
 
 - `O(log n)`
 
-It applies binary search on the segment tree.
-
 ### min_left(r, &f) -> Integer
 
 ```ruby
 seg.min_left(r, &f)
 ```
 
-It applies binary search on the segment tree.
+It applies binary search on the segment tree.   
+It returns an index l that satisfies both of the following.
+
+- `l = r` or `f(prod(l, r)) = true`
+- `l = 0` or `f(prod(l - 1, r)) = false`
 
 **Constraints**
 
+- `f(e) = true`
 - `0 ≦ r ≦ n`
 
 **Complexity**
@@ -133,6 +145,8 @@ It applies binary search on the segment tree.
 ## Verified
 
 - [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)
   - [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/segtree.md

@@ -94,11 +94,24 @@ seg.all_prod
 seg.max_right(l, &f)
 ```
 
-Segtree上で二分探索をします。
+Segtree上で`l <= r <= n`の範囲で、`f(prod(l, r))`の結果を二分探索をして条件に当てはまる`r`を返します。
 
-**制約**  `0 ≦ l ≦ n`
+以下の条件を両方満たす `r` (`l <= r <= n`)を(いずれか一つ)返します。
 
-**計算量** `O(log n)`
+- `r = l` もしくは `f(prod(l, r))`が`true`となる`r`
+- `r = n` もしくは `f(prod(l, r + 1))`が`false`となる`r`
+
+`prod(l, r)`は半開区間`[l, r)`であることに注意。
+
+**制約**
+
+- `f`を同じ引数で呼んだとき、返り値は同じ。
+- `f(e)`が`true`
+- `0 ≦ l ≦ n`
+
+**計算量** 
+
+- `O(log n)`
 
 ### min_left(r, &f) -> Integer
 
@@ -106,15 +119,30 @@ Segtree上で二分探索をします。
 seg.min_left(r, &f)
 ```
 
-Segtree上で二分探索をします。
+Segtree上で`0 <= l <= r`の範囲で、`f(prod(l, r))`の結果を二分探索をして条件に当てはまる`l`を返します。
+
+以下の条件を両方満たす `l` (`0 <= l <= r`)を(いずれか一つ)返します。
 
-**制約**  `0 ≦ r ≦ n`
+- `l = r` もしくは `f(prod(l, r))`が`true`となる`l`
+- `l = 0` もしくは `f(prod(l - 1, r))`が`false`となる`l`
+
+`prod(l, r)`は半開区間`[l, r)`であることに注意。
+
+**制約**
+
+- `f`を同じ引数で呼んだとき、返り値は同じ。
+- `f(e)`が`true`
+- `0 ≦ l ≦ n`
+
+**計算量**
 
-**計算量** `O(log n)`
+- `O(log n)`
 
 ## Verified
 
 - [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)
   - xorのセグメントツリーの基本的な典型問題です。FenwickTree(BIT)をxorに改造するだけでも解けます。

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

@@ -1,3 +1,3 @@
 module AcLibraryRb
-  VERSION = "0.5.3".freeze
+  VERSION = "0.5.4".freeze
 end

data/lib/dsu.rb

@@ -1,9 +1,10 @@
 # Disjoint Set Union
 class DSU
   def initialize(n = 0)
+    @n = n
+    @parent_or_size = Array.new(n, -1)
     # root node: -1 * component size
     # otherwise: parent
-    @parent_or_size = Array.new(n, -1)
   end
 
   attr_accessor :parent_or_size
@@ -25,6 +26,10 @@ class DSU
   alias same? same
 
   def leader(a)
+    unless 0 <= a && a < @n
+      raise ArgumentError.new, "#{a} is out of range 0 <= arg < size"
+    end
+
     @parent_or_size[a] < 0 ? a : (@parent_or_size[a] = leader(@parent_or_size[a]))
   end
   alias root leader

data/lib/fenwick_tree.rb

@@ -41,6 +41,7 @@ class FenwickTree
     end
     res
   end
+  alias left_sum _sum
 end
 
 FeTree            = FenwickTree

data/lib/floor_sum.rb

@@ -1,19 +1,44 @@
 def floor_sum(n, m, a, b)
+  raise ArgumentError if n < 0 || m < 1
+
   res = 0
 
-  if a >= m
-    res += (n - 1) * n / 2 * (a / m)
-    a %= m
+  if a < 0
+    a2 = a % m
+    res -= n * (n - 1) / 2 * ((a2 - a) / m)
+    a = a2
   end
 
-  if b >= m
-    res += n * (b / m)
-    b %= m
+  if b < 0
+    b2 = b % m
+    res -= n * ((b2 - b) / m)
+    b = b2
   end
 
-  y_max = a * n + b
-  return res if y_max < m
+  res + floor_sum_unsigned(n, m, a, b)
+end
+
+def floor_sum_unsigned(n, m, a, b)
+  res = 0
+
+  while true
+    if a >= m
+      res += n * (n - 1) / 2 * (a / m)
+      a %= m
+    end
+
+    if b >= m
+      res += n * (b / m)
+      b %= m
+    end
+
+    y_max = a * n + b
+    break if y_max < m
+
+    n = y_max / m
+    b = y_max % m
+    m, a = a, m
+  end
 
-  res += floor_sum(y_max / m, a, m, y_max % m)
   res
 end

data/lib/scc.rb

@@ -1,5 +1,5 @@
 # Strongly Connected Components
-class SCCGraph
+class SCC
   # initialize graph with n vertices
   def initialize(n = 0)
     @n, @edges = n, []
@@ -10,6 +10,7 @@ class SCCGraph
     raise "invalid params" unless (0...@n).include? from and (0...@n).include? to
 
     @edges << [from, to]
+    self
   end
 
   # returns list of strongly connected components
@@ -17,10 +18,8 @@ class SCCGraph
   # O(@n + @edges.size)
   def scc
     group_num, ids = scc_ids
-    counts = [0] * group_num
-    ids.each { |x| counts[x] += 1 }
     groups = Array.new(group_num) { [] }
-    ids.each_with_index { |x, i| groups[x] << i }
+    ids.each_with_index { |id, i| groups[id] << i }
     groups
   end
 
@@ -72,6 +71,6 @@ class SCCGraph
 end
 
 # class alias
-StronglyConnectedComponents = SCCGraph
-SCC  = SCCGraph
-SCCG = SCCGraph
+StronglyConnectedComponents = SCC
+SCCGraph = SCC
+SCCG = SCC

data/lib/segtree.rb

@@ -127,19 +127,19 @@ class Segtree
     @d[k] = @op.call(@d[2 * k], @d[2 * k + 1])
   end
 
-  def inspect
-    t = 0
-    res = "SegmentTree @e = #{@e}, @n = #{@n}, @leaf_size = #{@leaf_size} @op = #{@op}\n  "
-    a = @d[1, @d.size - 1]
-    a.each_with_index do |e, i|
-      res << e.to_s << ' '
-      if t == i && i < @leaf_size
-        res << "\n  "
-        t = t * 2 + 2
-      end
-    end
-    res
-  end
+  # def inspect # for debug
+  #   t = 0
+  #   res = "SegmentTree @e = #{@e}, @n = #{@n}, @leaf_size = #{@leaf_size} @op = #{@op}\n  "
+  #   a = @d[1, @d.size - 1]
+  #   a.each_with_index do |e, i|
+  #     res << e.to_s << ' '
+  #     if t == i && i < @leaf_size
+  #       res << "\n  "
+  #       t = t * 2 + 2
+  #     end
+  #   end
+  #   res
+  # end
 end
 
 SegTree     = Segtree

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

@@ -2,9 +2,10 @@ module AcLibraryRb
   # Disjoint Set Union
   class DSU
     def initialize(n = 0)
+      @n = n
+      @parent_or_size = Array.new(n, -1)
       # root node: -1 * component size
       # otherwise: parent
-      @parent_or_size = Array.new(n, -1)
     end
 
     attr_accessor :parent_or_size
@@ -26,6 +27,10 @@ module AcLibraryRb
     alias same? same
 
     def leader(a)
+      unless 0 <= a && a < @n
+        raise ArgumentError.new, "#{a} is out of range 0 <= arg < size"
+      end
+
       @parent_or_size[a] < 0 ? a : (@parent_or_size[a] = leader(@parent_or_size[a]))
     end
     alias root leader

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

@@ -42,6 +42,7 @@ module AcLibraryRb
       end
       res
     end
+    alias left_sum _sum
   end
 
   FeTree            = FenwickTree

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

@@ -1,21 +1,46 @@
 module AcLibraryRb
   def floor_sum(n, m, a, b)
+    raise ArgumentError if n < 0 || m < 1
+
     res = 0
 
-    if a >= m
-      res += (n - 1) * n / 2 * (a / m)
-      a %= m
+    if a < 0
+      a2 = a % m
+      res -= n * (n - 1) / 2 * ((a2 - a) / m)
+      a = a2
     end
 
-    if b >= m
-      res += n * (b / m)
-      b %= m
+    if b < 0
+      b2 = b % m
+      res -= n * ((b2 - b) / m)
+      b = b2
     end
 
-    y_max = a * n + b
-    return res if y_max < m
+    res + floor_sum_unsigned(n, m, a, b)
+  end
+
+  def floor_sum_unsigned(n, m, a, b)
+    res = 0
+
+    while true
+      if a >= m
+        res += n * (n - 1) / 2 * (a / m)
+        a %= m
+      end
+
+      if b >= m
+        res += n * (b / m)
+        b %= m
+      end
+
+      y_max = a * n + b
+      break if y_max < m
+
+      n = y_max / m
+      b = y_max % m
+      m, a = a, m
+    end
 
-    res += floor_sum(y_max / m, a, m, y_max % m)
     res
   end
 end

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

@@ -1,6 +1,6 @@
 module AcLibraryRb
   # Strongly Connected Components
-  class SCCGraph
+  class SCC
     # initialize graph with n vertices
     def initialize(n = 0)
       @n, @edges = n, []
@@ -11,6 +11,7 @@ module AcLibraryRb
       raise "invalid params" unless (0...@n).include? from and (0...@n).include? to
 
       @edges << [from, to]
+      self
     end
 
     # returns list of strongly connected components
@@ -18,10 +19,8 @@ module AcLibraryRb
     # O(@n + @edges.size)
     def scc
       group_num, ids = scc_ids
-      counts = [0] * group_num
-      ids.each { |x| counts[x] += 1 }
       groups = Array.new(group_num) { [] }
-      ids.each_with_index { |x, i| groups[x] << i }
+      ids.each_with_index { |id, i| groups[id] << i }
       groups
     end
 
@@ -73,7 +72,7 @@ module AcLibraryRb
   end
 
   # class alias
-  StronglyConnectedComponents = SCCGraph
-  SCC  = SCCGraph
-  SCCG = SCCGraph
+  StronglyConnectedComponents = SCC
+  SCCGraph = SCC
+  SCCG = SCC
 end

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

@@ -128,19 +128,19 @@ module AcLibraryRb
       @d[k] = @op.call(@d[2 * k], @d[2 * k + 1])
     end
 
-    def inspect
-      t = 0
-      res = "SegmentTree @e = #{@e}, @n = #{@n}, @leaf_size = #{@leaf_size} @op = #{@op}\n  "
-      a = @d[1, @d.size - 1]
-      a.each_with_index do |e, i|
-        res << e.to_s << ' '
-        if t == i && i < @leaf_size
-          res << "\n  "
-          t = t * 2 + 2
-        end
-      end
-      res
-    end
+    # def inspect # for debug
+    #   t = 0
+    #   res = "SegmentTree @e = #{@e}, @n = #{@n}, @leaf_size = #{@leaf_size} @op = #{@op}\n  "
+    #   a = @d[1, @d.size - 1]
+    #   a.each_with_index do |e, i|
+    #     res << e.to_s << ' '
+    #     if t == i && i < @leaf_size
+    #       res << "\n  "
+    #       t = t * 2 + 2
+    #     end
+    #   end
+    #   res
+    # end
   end
 
   SegTree     = Segtree

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ac-library-rb
 version: !ruby/object:Gem::Version
-  version: 0.5.3
+  version: 0.5.4
 platform: ruby
 authors:
 - universato
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2021-05-22 00:00:00.000000000 Z
+date: 2021-06-06 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: minitest
@@ -151,7 +151,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.2.15
+rubygems_version: 3.2.11
 signing_key:
 specification_version: 4
 summary: ac-library-rb is a ruby port of AtCoder Library (ACL).