ac-library-rb 0.5.2 → 0.6.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: dc333b7ea588fedc3aaf0379408bb5cfa0cbe78ce78286375233e296ee687338
-  data.tar.gz: 8b22febe194ced2ce838d6c5c59316e813acb1d3835988981bcd8ee48512a460
+  metadata.gz: 7f7674ea5a0a95f6cad7945415632a06bf91a515cde31d1c08320d5e9561fc0e
+  data.tar.gz: d6bb650ec23b99f6180f5e8413644863dae78c7923d79249bcadcb9a8a1fcaa0
 SHA512:
-  metadata.gz: '09aae15824b338694ba75027deea63c5955e9056fb5af8ea3d382d0218fa6278ef8af2e9d281315ef45e01a4296e6b15688f221ea39ca03153a1799d7770cc7e'
-  data.tar.gz: db447beabc1e50f306a26a34128394e0c424d5291cb9df4b616bcadc3956a5acd90b6344fc80eaedadfa88efba96ee3918a622e582b8957c3b21be12f44b3636
+  metadata.gz: d549b2be1fa15a519b8e1d692bbbd03ccd6c0f0b2d94787dbdc48c44ce9274c92ed5e7d6148c195ef73a545ba9951a64f74e84f39eed62e6c12a2eaaf386fcb9
+  data.tar.gz: 5f2b39beb3aacb21ac0fec142b550baf20b6343ed4fabce3ca303d8466bd632af71ce33d911b6a0494425234afa928949d33a670d490a91f9f5441c535586ae4

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

@@ -37,7 +37,7 @@ This is not limited to ac-library-rb, but I will show you how to install the two
 - By `gem` command, `gem install ac-library-rb`.
 - By using the gem bundler's commands.
 
-By #### gem command, `gem install ac-library-rb`
+#### By gem command, `gem install ac-library-rb`
 
 Execute `gem install ac-library-rb` by using the gem command included in Ruby itself.
 
@@ -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/ac-library-rb.gemspec

@@ -20,6 +20,7 @@ Gem::Specification.new do |spec|
 
   spec.add_development_dependency "minitest"
   spec.add_development_dependency "rake"
+  spec.add_development_dependency "simplecov"
 
   # Specify which files should be added to the gem when it is released.
   # The `git ls-files -z` loads the files in the RubyGem that have been added into git.

data/bin/lock_lib.rb

@@ -17,6 +17,10 @@ Dir.glob(lib_path) do |file|
 end
 
 # copy library from `lib/core_ext` to `lib_lock/ac-library-rb/core_ext`
+ac_library_rb_classes = %w[ModInt FenwickTree PriorityQueue]
+replaces = ac_library_rb_classes.to_h{ |cls| ["#{cls}.new", "AcLibraryRb::#{cls}.new"] }
+pattern = Regexp.new(replaces.keys.join('|'))
+
 lib_path = File.expand_path('../lib/core_ext/**', __dir__)
 lock_dir = File.expand_path('../lib_lock/ac-library-rb/core_ext', __dir__)
 Dir.glob(lib_path) do |file|
@@ -24,6 +28,6 @@ Dir.glob(lib_path) do |file|
 
   path = Pathname.new(lock_dir) + Pathname.new(file).basename
   File.open(path, "w") do |f|
-    f.puts File.readlines(file)
+    f.puts File.readlines(file).map{ |text| text.gsub(pattern, replaces) }
   end
 end

data/document_en/dsu.md

@@ -27,7 +27,7 @@ p d.size(2)     # => 2
 
 ## Class Method
 
-### new(n = 0) -> DSU
+### new(n) -> DSU
 
 ```rb
 d = DSU.new(n)
@@ -41,7 +41,7 @@ It creates an undirected graph with `n` vertices and `0` edges.
 
 **alias**
 
-- `DSU`, `DisjointSetUnion`, `UnionFind`, `UnionFindTree`
+- `DSU`, `UnionFind`
 
 ## Instance Methods
 

data/document_en/max_flow.md

@@ -5,7 +5,7 @@ Library for solving [Maximum flow problem](https://en.wikipedia.org/wiki/Maximum
 
 ## Class Methods.
 
-### new(n = 0) -> MaxFlow
+### new(n) -> MaxFlow
 
 ```ruby
 graph = Maxflow.new(10)

data/document_en/min_cost_flow.md

@@ -4,7 +4,7 @@ It solves [Minimum\-cost flow problem](https://en.wikipedia.org/wiki/Minimum-cos
 
 ## Class Methods.
 
-### new(n = 0) -> MinCostFlow
+### new(n) -> MinCostFlow
 
 ```ruby
 graph = MinCostFlow.new(10)

data/document_en/segtree.md

@@ -4,7 +4,8 @@ Segment Tree
 
 ## Class Methods
 
-### new(n, e, &op) -> Segtree
+### new(n, e){ |x, y| ... } -> Segtree
+### new(n, op, e) -> Segtree
 
 ```rb
 seg = Segtree.new(n, e) { |x, y| ... }
@@ -15,7 +16,9 @@ It creates an array `a` of length `n`. All the elements are initialized to `e`.
 - `block`: returns `op(x, y)`
 - `e`: identity element.
 
-### new(ary, e, &op) -> Segtree
+
+### new(ary, e){ |x, y| ... } -> Segtree
+### new(ary, op, e) -> Segtree
 
 ```rb
 seg = Segtree.new(ary, e) { |x, y| ... }
@@ -104,26 +107,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 +148,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_en/two_sat.md

@@ -17,7 +17,7 @@ it decides whether there is a truth assignment that satisfies all clauses.
 
 ## Class Methods
 
-### new(n = 0) -> TwoSAT
+### new(n) -> TwoSAT
 
 ```ruby
 ts = TwoSAT.new(n)

data/document_ja/dsu.md

@@ -30,7 +30,7 @@ p d.size(2)     # => 2
 
 ## 特異メソッド
 
-### new(n = 0) -> DSU
+### new(n) -> DSU
 
 ```rb
 d = DSU.new(n)
@@ -48,9 +48,7 @@ d = DSU.new(n)
 **エイリアス**
 
 - `DSU`
-- `DisjointSetUnion`
 - `UnionFind`
-- `UnionFindTree`
 
 ## インスタンスメソッド
 

data/document_ja/lazy_segtree.md

@@ -132,7 +132,7 @@ LazySegtree上で、二分探索をします。
 ## Verified
 
 問題のリンクです。Verified済みです。解答はテストコードをご参考ください。
-- [AIZU ONLINE JUDGE DSL\_2\_F RMQ and RUQ](ttps://onlinejudge.u-aizu.ac.jp/problems/DSL_2_F) ([旧DSL_2_F](http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_F))
+- [AIZU ONLINE JUDGE DSL\_2\_F RMQ and RUQ](https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_F) ([旧DSL_2_F](http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_F))
 - [AIZU ONLINE JUDGE DSL\_2\_G RSQ and RAQ](https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_G) ([旧DSL_2_G](http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_G))
 - [AIZU ONLINE JUDGE DSL\_2\_H RMQ and RAQ](https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_H) ([旧DSL_2_H](http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_H))
 - [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))
@@ -155,13 +155,15 @@ LazySegtree上で、二分探索をします。
   - [本家ライブラリの実装コード lazysegtree.hpp(GitHub)](https://github.com/atcoder/ac-library/blob/master/atcoder/lazysegtree.hpp)
   - [本家ライブラリのテストコード lazysegtree_test.cpp(GitHub)](https://github.com/atcoder/ac-library/blob/master/test/unittest/lazysegtree_test.cpp)
 - セグメントツリーについて
-  - [セグメント木をソラで書きたいあなたに \- hogecoder](https://tsutaj.hatenablog.com/entry/2017/03/29/204841)
-  - [遅延評価セグメント木をソラで書きたいあなたに \- hogecoder](https://tsutaj.hatenablog.com/entry/2017/03/30/224339)
+  - [2017/3 hogecoder: セグメント木をソラで書きたいあなたに](https://tsutaj.hatenablog.com/entry/2017/03/29/204841)
+  - [2017/3 hogecoder: 遅延評価セグメント木をソラで書きたいあなたに](https://tsutaj.hatenablog.com/entry/2017/03/30/224339)
+  - [2017/7 はまやんはまやんはまやん: 競技プログラミングにおけるセグメントツリー問題まとめ](https://blog.hamayanhamayan.com/entry/2017/07/08/173120)
+  - [2020/2 ageprocpp Qiita: Segment Treeことはじめ【後編】](https://qiita.com/ageprocpp/items/9ea58ac181d31cfdfe02)
 - AtCooderLibrary(ACL)のLazySegtreeについて
-  - [使い方 \- ARMERIA 2020/9/22](https://betrue12.hateblo.jp/entry/2020/09/22/194541)
-  - [チートシート \- ARMERIA 2020/9/23](https://betrue12.hateblo.jp/entry/2020/09/23/005940)
-  - [ACLPC: K–Range Affine Range Sumの解説 \|optのブログ 2020/9/27](https://opt-cp.com/cp/lazysegtree-aclpc-k/)
-  - [ACL 基礎実装例集 \- buyoh\.hateblo\.jp 2020/9/27](https://buyoh.hateblo.jp/entry/2020/09/27/190144)
+  - [2020/9/22 ARMERIA: 使い方](https://betrue12.hateblo.jp/entry/2020/09/22/194541)
+  - [2020/9/23 ARMERIA: チートシート](https://betrue12.hateblo.jp/entry/2020/09/23/005940)
+  - [2020/9/27 optのブログ: ACLPC: K–Range Affine Range Sumの解説](https://opt-cp.com/cp/lazysegtree-aclpc-k/)
+  - [2020/9/27 buyoh.hateblo.jp: ACL 基礎実装例集](https://buyoh.hateblo.jp/entry/2020/09/27/190144)
 
 ## 本家ライブラリとの違い
 

data/document_ja/max_flow.md

@@ -4,7 +4,7 @@
 
 ## 特異メソッド
 
-### new(n = 0) -> MaxFlow
+### new(n) -> MaxFlow
 
 ```ruby
 graph = Maxflow.new(10)

data/document_ja/min_cost_flow.md

@@ -4,7 +4,7 @@
 
 ## 特異メソッド
 
-### new(n = 0) -> MinCostFlow
+### new(n) -> MinCostFlow
 
 ```ruby
 graph = MinCostFlow.new(10)

data/document_ja/scc.md

@@ -6,7 +6,7 @@ Strongly Connected Components
 
 ## 特異メソッド
 
-### new(n = 0) -> SCC
+### new(n) -> SCC
 
 ```ruby
 graph = SCC.new(6)
@@ -50,8 +50,9 @@ 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)
+- [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]
 
 # 参考リンク
 

data/document_ja/segtree.md

@@ -4,7 +4,8 @@
 
 ## 特異メソッド
 
-### new(arg, e, &op) -> Segtree
+### new(arg, e){ |x, y| ... } -> Segtree
+### new(arg, op, e) -> Segtree
 
 ```rb
 seg = Segtree.new(arg, e) { |x, y| ... }
@@ -94,11 +95,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 +120,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に改造するだけでも解けます。
@@ -127,14 +156,18 @@ Segtree上で二分探索をします。
   - [当ライブラリの実装コード segtree.rb](https://github.com/universato/ac-library-rb/blob/master/lib/segtree.rb)
   - [当ライブラリのテストコード segtree.rb](https://github.com/universato/ac-library-rb/blob/master/test/segtree_test.rb)
     - テストコードも具体的な使い方として役に立つかもしれまん。
-- 本家
+- 本家ライブラリ
   - [本家ライブラリのドキュメント segtree.md(GitHub)](https://github.com/atcoder/ac-library/blob/master/document_ja/segtree.md)
   - [本家のドキュメント appendix.md(GitHub)](https://github.com/atcoder/ac-library/blob/master/document_ja/appendix.md)
   - [本家ライブラリの実装コード segtree.hpp(GitHub)](https://github.com/atcoder/ac-library/blob/master/atcoder/segtree.hpp)
   - [本家ライブラリのテストコード segtree_test.cpp(GitHub)](https://github.com/atcoder/ac-library/blob/master/test/unittest/segtree_test.cpp)
   - [本家ライブラリのサンプルコード segtree_practice.cpp(GitHub)](https://github.com/atcoder/ac-library/blob/master/test/example/segtree_practice.cpp)
 - セグメントツリーについて
-  - [セグメント木をソラで書きたいあなたに \- hogecoder](https://tsutaj.hatenablog.com/entry/2017/03/29/204841)
+  - [2017/3 hogecoder: セグメント木をソラで書きたいあなたに](https://tsutaj.hatenablog.com/entry/2017/03/29/204841)
+  - [2017/7 はまやんはまやんはまやん: 競技プログラミングにおけるセグメントツリー問題まとめ](https://blog.hamayanhamayan.com/entry/2017/07/08/173120)
+  - [2017/12 ei1333の日記: ちょっと変わったセグメント木の使い方](https://ei1333.hateblo.jp/entry/2017/12/14/000000)  
+    スライドが二分探索について詳しい
+  - [2020/2 ageprocpp@Qiita: Segment Treeことはじめ【前編](https://qiita.com/ageprocpp/items/f22040a57ad25d04d199)
 
 ## 本家ライブラリとの違い等
 

data/document_ja/two_sat.md

@@ -15,7 +15,7 @@
 
 ## 特異メソッド
 
-### new(n = 0) -> TwoSAT
+### new(n) -> TwoSAT
 
 ```ruby
 ts = TwoSAT.new(n)

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

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

data/lib/convolution.rb

@@ -122,3 +122,24 @@ class Convolution
 
   private :batterfly, :batterfly_inv, :bsf, :calc_primitive_root
 end
+
+# [EXPERIMENTAL]
+def convolution(a, b, mod: 998244353, k: 35, z: 99)
+  n = a.size
+  m = b.size
+  return [] if n == 0 || m == 0
+
+  raise ArgumentError if a.min < 0 || b.min < 0
+
+  format = "%0#{k}x" # "%024x"
+  sa = ""
+  sb = ""
+  a.each{ |x| sa << (format % x) }
+  b.each{ |x| sb << (format % x) }
+
+  zero = '0'
+  s = zero * z + ("%x" % (sa.hex * sb.hex))
+  i = -(n + m - 1) * k - 1
+
+  Array.new(n + m - 1){ (s[i + 1..i += k] || zero).hex % mod }
+end

data/lib/core_ext/all.rb

@@ -0,0 +1,11 @@
+class Array
+  def to_fenwick_tree
+    FenwickTree.new(self)
+  end
+  alias to_fetree to_fenwick_tree
+
+  def to_priority_queue
+    PriorityQueue.new(self)
+  end
+  alias to_pq to_priority_queue
+end