ac-library-rb 0.5.0

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

@@ -0,0 +1,130 @@
+module AcLibraryRb
+  # induce sort (internal method)
+  def sa_is_induce(s, ls, sum_l, sum_s, lms)
+    n = s.size
+    sa = [-1] * n
+
+    buf = sum_s.dup
+    lms.each{ |lms|
+      if lms != n
+        sa[buf[s[lms]]] = lms
+        buf[s[lms]] += 1
+      end
+    }
+
+    buf = sum_l.dup
+    sa[buf[s[-1]]] = n - 1
+    buf[s[-1]] += 1
+    sa.each{ |v|
+      if v >= 1 && !ls[v - 1]
+        sa[buf[s[v - 1]]] = v - 1
+        buf[s[v - 1]] += 1
+      end
+    }
+
+    buf = sum_l.dup
+    sa.reverse_each{ |v|
+      if v >= 1 && ls[v - 1]
+        buf[s[v - 1] + 1] -= 1
+        sa[buf[s[v - 1] + 1]] = v - 1
+      end
+    }
+
+    return sa
+  end
+
+  # SA-IS (internal method)
+  def sa_is(s, upper)
+    n = s.size
+
+    return [] if n == 0
+    return [0] if n == 1
+
+    ls = [false] * n
+    (n - 2).downto(0){ |i|
+      ls[i] = (s[i] == s[i + 1] ? ls[i + 1] : s[i] < s[i + 1])
+    }
+
+    sum_l = [0] * (upper + 1)
+    sum_s = [0] * (upper + 1)
+    n.times{ |i|
+      if ls[i]
+        sum_l[s[i] + 1] += 1
+      else
+        sum_s[s[i]] += 1
+      end
+    }
+    0.upto(upper){ |i|
+      sum_s[i] += sum_l[i]
+      sum_l[i + 1] += sum_s[i] if i < upper
+    }
+
+    lms = (1 ... n).select{ |i| !ls[i - 1] && ls[i] }
+    m = lms.size
+    lms_map = [-1] * (n + 1)
+    lms.each_with_index{ |lms, id| lms_map[lms] = id }
+
+    sa = sa_is_induce(s, ls, sum_l, sum_s, lms)
+
+    return sa if m == 0
+
+    sorted_lms = sa.select{ |sa| lms_map[sa] != -1 }
+    rec_s = [0] * m
+    rec_upper = 0
+    rec_s[lms_map[sorted_lms[0]]] = 0
+    1.upto(m - 1) do |i|
+      l, r = sorted_lms[i - 1, 2]
+      end_l = lms[lms_map[l] + 1] || n
+      end_r = lms[lms_map[r] + 1] || n
+      same = true
+      if end_l - l != end_r - r
+        same = false
+      else
+        while l < end_l
+          break if s[l] != s[r]
+
+          l += 1
+          r += 1
+        end
+        same = false if l == n || s[l] != s[r]
+      end
+      rec_upper += 1 if not same
+      rec_s[lms_map[sorted_lms[i]]] = rec_upper
+    end
+
+    sa_is(rec_s, rec_upper).each_with_index{ |rec_sa, id|
+      sorted_lms[id] = lms[rec_sa]
+    }
+
+    return sa_is_induce(s, ls, sum_l, sum_s, sorted_lms)
+  end
+
+  # suffix array for array of integers or string
+  def suffix_array(s, upper = nil)
+    if not upper
+      case s
+      when Array
+        # compression
+        n = s.size
+        idx = (0 ... n).sort_by{ |i| s[i] }
+        t = [0] * n
+        upper = 0
+        t[idx[0]] = 0
+        1.upto(n - 1){ |i|
+          upper += 1 if s[idx[i - 1]] != s[idx[i]]
+          t[idx[i]] = upper
+        }
+        s = t
+      when String
+        upper = 255
+        s = s.bytes
+      end
+    else
+      s.each{ |s|
+        raise ArgumentError if s < 0 || upper < s
+      }
+    end
+
+    return sa_is(s, upper)
+  end
+end

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

@@ -0,0 +1,36 @@
+module AcLibraryRb
+  require_relative './scc.rb'
+
+  # TwoSAT
+  # Reference: https://github.com/atcoder/ac-library/blob/master/atcoder/twosat.hpp
+  class TwoSAT
+    def initialize(n = 0)
+      @n = n
+      @answer = Array.new(n)
+      @scc = SCCGraph.new(2 * n)
+    end
+
+    attr_reader :answer
+
+    def add_clause(i, f, j, g)
+      raise RangeError unless (0...@n).cover?(i) && (0...@n).cover?(j)
+
+      @scc.add_edge(2 * i + (f ? 0 : 1), 2 * j + (g ? 1 : 0))
+      @scc.add_edge(2 * j + (g ? 0 : 1), 2 * i + (f ? 1 : 0))
+      nil
+    end
+
+    def satisfiable
+      id = @scc.send(:scc_ids)[1]
+      @n.times do |i|
+        return false if id[2 * i] == id[2 * i + 1]
+
+        @answer[i] = id[2 * i] < id[2 * i + 1]
+      end
+      true
+    end
+    alias satisfiable? satisfiable
+  end
+
+  TwoSat = TwoSAT
+end

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

@@ -0,0 +1,34 @@
+module AcLibraryRb
+  # this implementation is different from ACL because of calculation time
+  # ref : https://snuke.hatenablog.com/entry/2014/12/03/214243
+  # ACL  implementation : https://atcoder.jp/contests/abc135/submissions/18836384 (731ms)
+  # this implementation : https://atcoder.jp/contests/abc135/submissions/18836378 (525ms)
+
+  def z_algorithm(s)
+    n = s.size
+    return [] if n == 0
+
+    s = s.codepoints if s.is_a?(String)
+
+    z = [0] * n
+    z[0] = n
+    i, j = 1, 0
+    while i < n
+      j += 1 while i + j < n && s[j] == s[i + j]
+      z[i] = j
+      if j == 0
+        i += 1
+        next
+      end
+      k = 1
+      while i + k < n && k + z[k] < j
+        z[i + k] = z[k]
+        k += 1
+      end
+      i += k
+      j -= k
+    end
+
+    return z
+  end
+end

metadata

@@ -0,0 +1,158 @@
+--- !ruby/object:Gem::Specification
+name: ac-library-rb
+version: !ruby/object:Gem::Version
+  version: 0.5.0
+platform: ruby
+authors:
+- universato
+autorequire:
+bindir: exe
+cert_chain: []
+date: 2021-05-16 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+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......
+email:
+- universato@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".github/workflows/unittest.yml"
+- ".gitignore"
+- ".rubocop.yml"
+- Gemfile
+- LICENSE
+- README.ja.md
+- README.md
+- Rakefile
+- ac-library-rb.gemspec
+- bin/console
+- bin/lock_lib.rb
+- bin/setup
+- document_en/binary_index_tree.md
+- document_en/convolution.md
+- document_en/dsu.md
+- document_en/fenwick_tree.md
+- document_en/index.md
+- document_en/lazy_segtree.md
+- document_en/math.md
+- document_en/max_flow.md
+- document_en/min_cost_flow.md
+- document_en/modint.md
+- document_en/priority_queue.md
+- document_en/segtree.md
+- document_en/string.md
+- document_en/two_sat.md
+- document_en/union_find.md
+- document_ja/convolution.md
+- document_ja/dsu.md
+- document_ja/fenwick_tree.md
+- document_ja/index.md
+- document_ja/lazy_segtree.md
+- document_ja/math.md
+- document_ja/max_flow.md
+- document_ja/min_cost_flow.md
+- document_ja/modint.md
+- document_ja/priority_queue.md
+- document_ja/scc.md
+- document_ja/segtree.md
+- document_ja/string.md
+- document_ja/two_sat.md
+- lib/ac-library-rb/version.rb
+- lib/convolution.rb
+- lib/core_ext/modint.rb
+- lib/crt.rb
+- lib/dsu.rb
+- lib/fenwick_tree.rb
+- lib/floor_sum.rb
+- lib/inv_mod.rb
+- lib/lazy_segtree.rb
+- lib/lcp_array.rb
+- lib/max_flow.rb
+- lib/min_cost_flow.rb
+- lib/modint.rb
+- lib/pow_mod.rb
+- lib/priority_queue.rb
+- lib/scc.rb
+- lib/segtree.rb
+- lib/suffix_array.rb
+- lib/two_sat.rb
+- lib/z_algorithm.rb
+- lib_helpers/ac-library-rb/all.rb
+- lib_lock/ac-library-rb.rb
+- lib_lock/ac-library-rb/convolution.rb
+- lib_lock/ac-library-rb/core_ext/modint.rb
+- lib_lock/ac-library-rb/crt.rb
+- lib_lock/ac-library-rb/dsu.rb
+- lib_lock/ac-library-rb/fenwick_tree.rb
+- lib_lock/ac-library-rb/floor_sum.rb
+- lib_lock/ac-library-rb/inv_mod.rb
+- lib_lock/ac-library-rb/lazy_segtree.rb
+- lib_lock/ac-library-rb/lcp_array.rb
+- lib_lock/ac-library-rb/max_flow.rb
+- lib_lock/ac-library-rb/min_cost_flow.rb
+- lib_lock/ac-library-rb/modint.rb
+- lib_lock/ac-library-rb/pow_mod.rb
+- lib_lock/ac-library-rb/priority_queue.rb
+- lib_lock/ac-library-rb/scc.rb
+- lib_lock/ac-library-rb/segtree.rb
+- lib_lock/ac-library-rb/suffix_array.rb
+- lib_lock/ac-library-rb/two_sat.rb
+- lib_lock/ac-library-rb/z_algorithm.rb
+homepage: https://github.com/universato/ac-library-rb
+licenses:
+- CC0
+metadata:
+  homepage_uri: https://github.com/universato/ac-library-rb
+  source_code_uri: https://github.com/universato/ac-library-rb
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib_lock
+- lib_helpers
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.3.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.2.11
+signing_key:
+specification_version: 4
+summary: ac-library-rb is a ruby port of AtCoder Library (ACL).
+test_files: []