ac-library-rb 0.5.0

data/Rakefile

@@ -0,0 +1,11 @@
+require "bundler/gem_tasks"
+require "rake/testtask"
+
+Rake::TestTask.new(:test) do |t|
+  require_relative "./bin/lock_lib.rb"
+  t.libs << "test"
+  t.libs << "lib"
+  t.test_files = FileList["test/**/*_test.rb"]
+end
+
+task :default => :test

data/ac-library-rb.gemspec

@@ -0,0 +1,32 @@
+require_relative 'lib/ac-library-rb/version'
+
+gem_description = "ac-library-rb is a ruby port of AtCoder Library (ACL).
+DSU(UnionFind), FenwickTree, PriorityQueue, Segtree, SCC, 2-SAT, suffix_array, lcp_array, z_algorithm, crt, inv_mod, floor_sum, max_flow, min_cost_flow......"
+
+Gem::Specification.new do |spec|
+  spec.name          = "ac-library-rb"
+  spec.version       = AcLibraryRb::VERSION
+  spec.authors       = ["universato"]
+  spec.email         = ["universato@gmail.com"]
+
+  spec.summary       = "ac-library-rb is a ruby port of AtCoder Library (ACL)."
+  spec.description   = gem_description
+  spec.homepage      = "https://github.com/universato/ac-library-rb"
+  spec.license       = "CC0"
+  spec.required_ruby_version = Gem::Requirement.new(">= 2.3.0")
+
+  spec.metadata["homepage_uri"] = spec.homepage
+  spec.metadata["source_code_uri"] = "https://github.com/universato/ac-library-rb"
+
+  spec.add_development_dependency "minitest"
+  spec.add_development_dependency "rake"
+
+  # 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.
+  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib_lock", "lib_helpers"]
+end

data/bin/console

@@ -0,0 +1,8 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+
+require "ac-library-rb"
+
+require "irb"
+IRB.start(__FILE__)

data/bin/lock_lib.rb

@@ -0,0 +1,27 @@
+require 'pathname'
+
+# copy libraries from `lib` to `lib_lock/ac-library` and add `module AcLibraryRb`
+lib_path = File.expand_path('../../lib/**', __FILE__)
+lock_dir = File.expand_path('../../lib_lock/ac-library-rb', __FILE__)
+Dir.glob(lib_path) do |file|
+  next unless FileTest.file?(file)
+
+  path = Pathname.new(lock_dir) + Pathname.new(file).basename
+  File.open(path, "w") do |f|
+    f.puts "module AcLibraryRb"
+    f.puts File.readlines(file).map{ |line| line == "\n" ? "\n" : '  ' + line }
+    f.puts "end"
+  end
+end
+
+# cope library from `lib/core_ext` to `lib_lock/ac-library-rb/core_ext`
+lib_path = File.expand_path('../../lib/core_ext/**', __FILE__)
+lock_dir = File.expand_path('../../lib_lock/ac-library-rb/core_ext', __FILE__)
+Dir.glob(lib_path) do |file|
+  next unless FileTest.file?(file)
+
+  path = Pathname.new(lock_dir) + Pathname.new(file).basename
+  File.open(path, "w") do |f|
+    f.puts File.readlines(file)
+  end
+end

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/document_en/binary_index_tree.md

@@ -0,0 +1,3 @@
+See [FenwickTree document (fenwick_tree.md)](https://github.com/universato/ac-library-rb/blob/main/document_en/fenwick_tree.md).
+
+Fenwick Tree is an alias of BIT(Binary Index Tree).

data/document_en/convolution.md

@@ -0,0 +1,67 @@
+# Convolution
+
+Performs convolution. An array of `Integer` of length `N`, `a[0],a[1],... ,a[N - 1]` and an array of `Integer` of length `M`, `b[0],b[1],... ,b[M - 1]`, and returns it as `c`, an array of `Integer` of length `N + M - 1`.
+
+## convolution
+
+``ruby
+(1) conv = Convolution.new(m = 998244353)
+(2) conv = Convolution.new(m, primitive_root)
+``
+
+It creates an object to compute the convolution with `mod m`.
+
+The `primitive_root` must be a primitive root for the method `m`. If it is not given, the minimal primitive root is computed internally.
+
+**constraints**.
+
+- `2 ≤ m`.
+
+- `m` is a prime number
+
+- ((2) only) `primitive_root` is the primitive root for law `m`.
+
+**computational complexity** 1.
+
+1.`O(sqrt m)` 2.
+
+2.`O(log m)`.
+
+### Usage
+
+The actual computation is done as follows, using the object `conv` created above.
+
+```ruby
+c = conv.convolution(a, b)
+```
+
+If at least one of `a` and `b` is an empty array, it returns an empty array.
+
+**constraints**.
+
+- There exists a `c` such that `2^c|(m-1)` and `|a|+|b|-1<=2^c`.
+
+**computational complexity**.
+
+- `O((|a|+|b|) log (|a|+|b|))`
+
+## convolution_ll
+
+This can be handled by using a sufficiently large prime number as `m` in `convolution`.
+
+An example of an `NTT-Friendly` prime over `1e15` is `1125900443713537 = 2^29×2097153+1`.
+
+# Verified
+
+- [C - Fast Fourier Transform](https://atcoder.jp/contests/atc001/tasks/fft_c)
+  - `m = 1012924417`
+    [1272ms](https://atcoder.jp/contests/atc001/submissions/17193829)
+  - `m = 1125900443713537`
+    [2448 ms](https://atcoder.jp/contests/atc001/submissions/17193739)
+
+# Reference.
+
+- [Main ACL documentation Convolution](https://atcoder.github.io/ac-library/master/document_ja/convolution.html)
+
+
+Translated with www.DeepL.com/Translator (free version)

data/document_en/dsu.md

@@ -0,0 +1,132 @@
+# DSU - Disjoint Set Union
+
+**alias: Union Find**
+
+Given an undirected graph, it processes the following queries in `O(α(n))` time (amortized).
+
+- Edge addition
+- Deciding whether given two vertices are in the same connected component
+
+Each connected component internally has a representative vertex.
+
+When two connected components are merged by edge addition, one of the two representatives of these connected components becomes the representative of the new connected component.
+
+## Usage
+
+```rb
+d = DSU.new(5)
+p d.groups      # => [[0], [1], [2], [3], [4]]
+p d.same?(2, 3) # => false
+p d.size(2)     # => 1
+
+d.merge(2, 3)
+p d.groups      # => [[0], [1], [2, 3], [4]]
+p d.same?(2, 3) # => true
+p d.size(2)     # => 2
+```
+
+## Class Method
+
+### new(n = 0) -> DSU
+
+```rb
+d = DSU.new(n)
+```
+
+It creates an undirected graph with `n` vertices and `0` edges.
+
+**complexity**
+
+- `O(n)`
+
+**alias**
+
+- `DSU`, `DisjointSetUnion`, `UnionFind`, `UnionFindTree`
+
+## Instance Methods
+
+### merge(a, b) -> Integer
+
+```rb
+d.merge(a, b)
+```
+
+It adds an edge $(a, b)$.
+
+If the vertices $a$ and $b$ were in the same connected component, it returns the representative of this connected component. Otherwise, it returns the representative of the new connected component.
+
+**complexity**
+
+- `O(α(n))`  amortized
+
+**alias**
+
+- `merge`, `unite`
+
+### same?(a, b) -> bool
+
+```rb
+d.same?(a, b)
+```
+
+It returns whether the vertices `a` and `b` are in the same connected component.
+
+**complexity**
+
+- `O(α(n))`  amortized
+
+**alias**
+
+- `same?`, `same`
+
+### leader(a) -> Integer
+
+```rb
+d.leader(a)
+```
+
+It returns the representative of the connected component that contains the vertex `a`.
+
+**complexity**
+
+- `O(α(n))`  amortized
+
+**alias**
+
+- `leader`, `root`, `find`
+
+### size(a) -> Integer
+
+It returns the size of the connected component that contains the vertex `a`.
+
+**complexity**
+
+- `O(α(n))`  amortized
+
+### groups -> Array(Array(Integer))
+
+```rb
+d.groups
+```
+
+It divides the graph into connected components and returns the list of them.
+
+More precisely, it returns the list of the "list of the vertices in a connected component". Both of the orders of the connected components and the vertices are undefined.
+
+
+**complexity**
+
+- `O(α(n))`  amortized
+
+## Verified
+
+[A \- Disjoint Set Union](https://atcoder.jp/contests/practice2/tasks/practice2_a)
+
+## Links & Reference
+
+- ac-library-rb
+  - [Code dsu.rb](https://github.com/universato/ac-library-rb/blob/master/lib/dsu.rb)
+  - [Test dsu_test.rb](https://github.com/universato/ac-library-rb/blob/master/test/dsu_test.rb)
+- AtCoder Library
+  - [Document](https://github.com/atcoder/ac-library/blob/master/document_en/dsu.md)
+  - [Code dsu.hpp](https://github.com/atcoder/ac-library/blob/master/atcoder/dsu.hpp)

data/document_en/fenwick_tree.md

@@ -0,0 +1,99 @@
+# Fenwick Tree
+
+**alias: BIT (Binary Indexed Tree)**
+
+Given an array of length `N`, it processes the following queries in `O(log N)` time.
+
+- Updating an element
+- Calculating the sum of the elements of an interval
+
+## Class Method
+
+### new(n) -> FenwickTree
+
+```rb
+fw = FenwickTree.new(5)
+```
+
+It creates an array `a_0, a_1, ...... a_{n-1}` of length `n`. All the elements are initialized to `0`.
+
+**complexity**
+
+- `O(n)`
+
+### new(ary) -> FenwickTree
+
+```rb
+fw = FenwickTree.new([1, 3, 2])
+```
+
+It creates an array `ary`.
+
+**complexity**
+
+- `O(n)`
+
+## add(pos, x)
+
+```rb
+fw.add(pos, x)
+```
+
+It processes `a[p] += x`.
+
+`pos` is zero-based index.
+
+**constraints**
+
+- `0 ≦　pos < n`
+
+**complexity**
+
+- `O(log n)`
+
+## sum(l, r) ->Integer
+
+```rb
+fw.sum(l, r)
+```
+
+It returns `a[l] + a[l + 1] + ... + a[r - 1]`.
+
+It equals `fw._sum(r) - fw._sum(l)`
+
+**constraints**
+
+-  `0 ≦　l ≦ r ≦ n`
+
+**complexity**
+
+- `O(log n)`
+
+## _sum(pos) -> Integer
+
+```rb
+fw._sum(pos)
+```
+
+It returns `a[0] + a[1] + ... + a[pos - 1]`.
+
+**complexity**
+
+- `O(logn)`
+
+## Verified
+
+- [AtCoder ALPC B \- Fenwick Tree](https://atcoder.jp/contests/practice2/tasks/practice2_b)
+  -  [AC Code(1272ms)](https://atcoder.jp/contests/practice2/submissions/17074108)
+- [F \- Range Xor Query](https://atcoder.jp/contests/abc185/tasks/abc185_f)
+  - [AC Code(821ms)](https://atcoder.jp/contests/abc185/submissions/18769200)
+
+
+## Link
+
+- ac-library-rb
+  - [Code dsu.rb](https://github.com/universato/ac-library-rb/blob/master/lib/dsu.rb)
+  - [Test dsu_test.rb](https://github.com/universato/ac-library-rb/blob/master/test/dsu_test.rb)
+- AtCoder
+  - [fenwicktree.html](https://atcoder.github.io/ac-library/document_en/fenwicktree.html)
+  - [Code fenwick.hpp](https://github.com/atcoder/ac-library/blob/master/atcoder/fenwick.hpp)

data/document_en/index.md

@@ -0,0 +1,79 @@
+# index
+
+| C  | D |   |
+| :--- | :--- | --- |
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/fenwick_tree.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/fenwick_tree.md)   |FenwickTree(BIT)|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/segtree.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/segtree.md) |Segtree|
+| [○](https://github.com/universato/ac-library-rb/blob/master/lib/lazy_segtree.rb) | [○G](https://github.com/universato/ac-library-rb/blob/master/document_ja/lazy_segtree.md)   |LazySegtree|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/priority_queue.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/priority_queue.md)  |PriorityQueue|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/suffix_array.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/string.md)  |suffix_array|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/lcp_array.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/string.md)  |lcp_array|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/z_algorithm.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/string.md)  |z_algorithm|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/pow_mod.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/math.md)  |pow_mod|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/inv_mod.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/math.md)  |inv_mod|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/crt.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/math.md)  |crt(Chinese remainder theorem)|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/floor_sum.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/math.md) |floor_sum|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/convolution.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/convolution.md) |convolution|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/modint.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/modint.md) |ModInt|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/dsu.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/dsu.md) |DSU(UnionFind)|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/max_flow.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/max_flow.md) |MaxFlow|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/min_cost_flow.rb) |[◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/min_cost_flow.md)  |MinCostFlow|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/scc.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/scc.md) |SCC (Strongly Connected Component)|
+| [◎](https://github.com/universato/ac-library-rb/blob/master/lib/two_sat.rb) | [◎G](https://github.com/universato/ac-library-rb/blob/master/document_ja/two_sat.md) |TwoSat|
+
+## Link to Code on GitHub
+
+### Data structure
+
+- [fenwick_tree.rb](https://github.com/universato/ac-library-rb/blob/master/lib/fenwick_tree.rb)
+- [segtree.rb](https://github.com/universato/ac-library-rb/blob/master/lib/segtree.rb)
+- [lazy_segtree.rb](https://github.com/universato/ac-library-rb/blob/master/lib/lazy_segtree.rb)
+- [priority_queue.rb](https://github.com/universato/ac-library-rb/blob/master/lib/priority_queue.rb)
+- String
+  - [suffix_array.rb](https://github.com/universato/ac-library-rb/blob/master/lib/suffix_array.rb)
+  - [lcp_array.rb](https://github.com/universato/ac-library-rb/blob/master/lib/lcp_array.rb)
+  - [z_algorithm.rb](https://github.com/universato/ac-library-rb/blob/master/lib/z_algorithm.rb)
+
+### Math
+
+- math
+  - [pow_mod.rb](https://github.com/universato/ac-library-rb/blob/master/lib/pow_mod.rb)
+  - [inv_mod.rb](https://github.com/universato/ac-library-rb/blob/master/lib/inv_mod.rb)
+  - [crt.rb](https://github.com/universato/ac-library-rb/blob/master/lib/crt.rb)
+  - [floor_sum.rb](https://github.com/universato/ac-library-rb/blob/master/lib/floor_sum.rb)
+- [convolution.rb](https://github.com/universato/ac-library-rb/blob/master/lib/convolution.rb)
+- [modint.rb](https://github.com/universato/ac-library-rb/blob/master/lib/modint.rb)
+
+### Graph
+
+- [dsu.rb](https://github.com/universato/ac-library-rb/blob/master/lib/dsu.rb)
+- [max_flow.rb](https://github.com/universato/ac-library-rb/blob/master/lib/max_flow.rb)
+- [min_cost_flow.rb](https://github.com/universato/ac-library-rb/blob/master/lib/min_cost_flow.rb)
+- [scc.rb](https://github.com/universato/ac-library-rb/blob/master/lib/scc.rb)
+- [two_sat.rb](https://github.com/universato/ac-library-rb/blob/master/lib/two_sat.rb)
+
+## Alphabet Order Index
+
+<details>
+<summary>Alphabet Order Index</summary>
+
+[convolution.rb](https://github.com/universato/ac-library-rb/blob/master/lib/convolution.rb)
+[crt.rb](https://github.com/universato/ac-library-rb/blob/master/lib/crt.rb)
+[dsu.rb](https://github.com/universato/ac-library-rb/blob/master/lib/dsu.rb)
+[fenwick_tree.rb](https://github.com/universato/ac-library-rb/blob/master/lib/fenwick_tree.rb)
+[floor_sum.rb](https://github.com/universato/ac-library-rb/blob/master/lib/floor_sum..rb)
+[inv_mod.rb](https://github.com/universato/ac-library-rb/blob/master/lib/inv_mod.rb)
+[lazy_segtree.rb](https://github.com/universato/ac-library-rb/blob/master/lib/lazy_segtree.rb)
+[lcp_array.rb](https://github.com/universato/ac-library-rb/blob/master/lib/lcp_array.rb)
+[max_flow.rb](https://github.com/universato/ac-library-rb/blob/master/lib/max_flow.rb)
+[min_cost_flow.rb](https://github.com/universato/ac-library-rb/blob/master/lib/min_cost_flow.rb)
+[modint.rb](https://github.com/universato/ac-library-rb/blob/master/lib/modint.rb)
+[pow_mod.rb](https://github.com/universato/ac-library-rb/blob/master/lib/pow_mod.rb)
+[priority_queue.rb](https://github.com/universato/ac-library-rb/blob/master/lib/priority_queue.rb)
+[scc.rb](https://github.com/universato/ac-library-rb/blob/master/lib/scc.rb)
+[segtree.rb](https://github.com/universato/ac-library-rb/blob/master/lib/segtree.rb)
+[suffix_array.rb](https://github.com/universato/ac-library-rb/blob/master/lib/suffix_array.rb)
+[two_sat.rb](https://github.com/universato/ac-library-rb/blob/master/lib/two_sat.rb)
+[z_algorithm.rb](https://github.com/universato/ac-library-rb/blob/master/lib/z_algorithm.rb)
+
+</details>