ac-library-rb 0.5.2 → 0.6.1

data/lib_helpers/ac-library-rb.rb

@@ -0,0 +1,24 @@
+module AcLibraryRb
+end
+include AcLibraryRb
+
+require_relative '../lib_lock/ac-library-rb/core_ext/all.rb'
+
+require_relative '../lib_lock/ac-library-rb/convolution'
+require_relative '../lib_lock/ac-library-rb/crt'
+require_relative '../lib_lock/ac-library-rb/dsu'
+require_relative '../lib_lock/ac-library-rb/fenwick_tree'
+require_relative '../lib_lock/ac-library-rb/floor_sum'
+require_relative '../lib_lock/ac-library-rb/inv_mod'
+require_relative '../lib_lock/ac-library-rb/lazy_segtree'
+require_relative '../lib_lock/ac-library-rb/lcp_array'
+require_relative '../lib_lock/ac-library-rb/max_flow'
+require_relative '../lib_lock/ac-library-rb/min_cost_flow'
+require_relative '../lib_lock/ac-library-rb/modint'
+require_relative '../lib_lock/ac-library-rb/pow_mod'
+require_relative '../lib_lock/ac-library-rb/priority_queue'
+require_relative '../lib_lock/ac-library-rb/scc'
+require_relative '../lib_lock/ac-library-rb/segtree'
+require_relative '../lib_lock/ac-library-rb/suffix_array'
+require_relative '../lib_lock/ac-library-rb/two_sat'
+require_relative '../lib_lock/ac-library-rb/z_algorithm'

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

@@ -123,4 +123,25 @@ module AcLibraryRb
 
     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
 end

data/lib_lock/ac-library-rb/core_ext/all.rb

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

data/lib_lock/ac-library-rb/core_ext/modint.rb

@@ -1,11 +1,11 @@
 def ModInt(val)
-  ModInt.new(val)
+  AcLibraryRb::ModInt.new(val)
 end
 
 # Integer
 class Integer
   def to_modint
-    ModInt.new(self)
+    AcLibraryRb::ModInt.new(self)
   end
   alias to_m to_modint
 end
@@ -13,7 +13,7 @@ end
 # String
 class String
   def to_modint
-    ModInt.new(to_i)
+    AcLibraryRb::ModInt.new(to_i)
   end
   alias to_m to_modint
 end

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

@@ -1,7 +1,9 @@
 module AcLibraryRb
   # return [rem, mod] or [0, 0] (if no solution)
   def crt(r, m)
-    raise ArgumentError if r.size != m.size
+    unless r.size == m.size
+      raise ArgumentError.new("size of r and m must be equal for crt(r, m)")
+    end
 
     n = r.size
     r0, m0 = 0, 1

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

@@ -1,13 +1,14 @@
 module AcLibraryRb
   # Disjoint Set Union
   class DSU
-    def initialize(n = 0)
+    def initialize(n)
+      @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
+    attr_reader :parent_or_size, :n
 
     def merge(a, b)
       x = leader(a)
@@ -20,12 +21,16 @@ module AcLibraryRb
     end
     alias unite merge
 
-    def same(a, b)
+    def same?(a, b)
       leader(a) == leader(b)
     end
-    alias same? same
+    alias same same?
 
     def leader(a)
+      unless 0 <= a && a < @n
+        raise ArgumentError.new, "#{a} is out of range (0...#{@n})"
+      end
+
       @parent_or_size[a] < 0 ? a : (@parent_or_size[a] = leader(@parent_or_size[a]))
     end
     alias root leader
@@ -40,7 +45,5 @@ module AcLibraryRb
     end
   end
 
-  UnionFind        = DSU
-  UnionFindTree    = DSU
-  DisjointSetUnion = DSU
+  UnionFind = DSU
 end

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

@@ -3,7 +3,7 @@ module AcLibraryRb
   class FenwickTree
     attr_reader :data, :size
 
-    def initialize(arg = 0)
+    def initialize(arg)
       case arg
       when Array
         @size = arg.size
@@ -18,7 +18,7 @@ module AcLibraryRb
         @size = arg
         @data = Array.new(@size + 1, 0)
       else
-        raise ArgumentError
+        raise ArgumentError.new("wrong argument. type is Array or Integer")
       end
     end
 
@@ -30,8 +30,25 @@ module AcLibraryRb
       end
     end
 
-    def sum(l, r)
-      _sum(r) - _sum(l)
+    # .sum(l, r)  # [l, r)  <- Original
+    # .sum(r)     # [0, r)  <- [Experimental]
+    # .sum(l..r)  # [l, r]  <- [Experimental]
+    def sum(a, b = nil)
+      if b
+        _sum(b) - _sum(a)
+      elsif a.is_a?(Range)
+        l = a.begin
+        l += @size if l < 0
+        if r = a.end
+          r += @size if r < 0
+          r += 1 unless a.exclude_end?
+        else
+          r = @size
+        end
+        _sum(r) - _sum(l)
+      else
+        _sum(a)
+      end
     end
 
     def _sum(i)
@@ -42,9 +59,6 @@ module AcLibraryRb
       end
       res
     end
+    alias left_sum _sum
   end
-
-  FeTree            = FenwickTree
-  Fetree            = FenwickTree
-  BinaryIndexedTree = FenwickTree
 end

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

@@ -1,23 +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 * (a / m) / 2
-      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) / 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
 
-    return res if y_max == 0
+      y_max = a * n + b
+      break if y_max < m
+
+      n = y_max / m
+      b = y_max % m
+      m, a = a, m
+    end
 
-    x_max = (m * y_max - b + a - 1) / a
-    res += (n - x_max) * y_max + floor_sum(y_max, a, m, a * x_max - m * y_max + b)
     res
   end
 end

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

@@ -50,7 +50,18 @@ module AcLibraryRb
     end
     alias [] get
 
-    def prod(l, r)
+    def prod(l, r = nil)
+      if r.nil? # if 1st argument l is Range
+        if r = l.end
+          r += @n if r < 0
+          r += 1 unless l.exclude_end?
+        else
+          r = @n
+        end
+        l = l.begin
+        l += @n if l < 0
+      end
+
       return @e if l == r
 
       l += @size
@@ -84,9 +95,22 @@ module AcLibraryRb
     end
 
     # apply(pos, f)
-    # apply(l, r, f) -> range_apply(l, r, f)
+    # apply(l, r, f)  -> range_apply(l, r, f)
+    # apply(l...r, f) -> range_apply(l, r, f)  ... [Experimental]
     def apply(pos, f, fr = nil)
-      return range_apply(pos, f, fr) if fr
+      if fr
+        return range_apply(pos, f, fr)
+      elsif pos.is_a?(Range)
+        l = pos.begin
+        l += @n if l < 0
+        if r = pos.end
+          r += @n if r < 0
+          r += 1 unless pos.exclude_end?
+        else
+          r = @n
+        end
+        return range_apply(l, r, f)
+      end
 
       pos += @size
       @log.downto(1) { |i| push(pos >> i) }
@@ -195,4 +219,6 @@ module AcLibraryRb
       @lz[k] = @id
     end
   end
+
+  LazySegTree = LazySegtree
 end

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

@@ -1,7 +1,7 @@
 module AcLibraryRb
   # MaxFlowGraph
   class MaxFlow
-    def initialize(n = 0)
+    def initialize(n)
       @n   = n
       @pos = []
       @g   = Array.new(n) { [] }
@@ -21,6 +21,15 @@ module AcLibraryRb
       edge_number
     end
 
+    def add_edges(edges)
+      edges.each{ |from, to, cap| add_edge(from, to, cap) }
+      self
+    end
+
+    def add(x, to = nil, cap = nil)
+      cap ? add_edge(x, to, cap) : add_edges(x)
+    end
+
     def push(edge)
       add_edge(*edge)
     end
@@ -133,7 +142,4 @@ module AcLibraryRb
       res
     end
   end
-
-  MaxFlowGraph = MaxFlow
-  MFGraph      = MaxFlow
 end

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

@@ -12,7 +12,7 @@ module AcLibraryRb
       @g_cost = Array.new(n) { [] }
       @pv     = Array.new(n)
       @pe     = Array.new(n)
-      @dual   = Array.new(n) { 0 }
+      @dual   = Array.new(n, 0)
     end
 
     def add_edge(from, to, cap, cost)
@@ -37,6 +37,15 @@ module AcLibraryRb
       edge_number
     end
 
+    def add_edges(edges)
+      edges.each{ |from, to, cap, cost| add_edge(from, to, cap, cost) }
+      self
+    end
+
+    def add(x, to = nil, cap = nil, cost = nil)
+      cost ? add_edge(x, to, cap, cost) : add_edges(x)
+    end
+
     def get_edge(i)
       from, id = @pos[i]
       to = @g_to[from][id]
@@ -105,7 +114,7 @@ module AcLibraryRb
     def slope(s, t, flow_limit = Float::MAX)
       flow = 0
       cost = 0
-      prev_cost = -1
+      prev_cost_per_flow = -1
       result = [[flow, cost]]
 
       while flow < flow_limit
@@ -130,16 +139,13 @@ module AcLibraryRb
         d = -@dual[s]
         flow += c
         cost += c * d
-        result.pop if prev_cost == d
+        result.pop if prev_cost_per_flow == d
         result << [flow, cost]
-        prev_cost = d
+        prev_cost_per_flow = d
       end
 
       result
     end
     alias min_cost_slop slope
   end
-
-  MCF      = MinCostFlow
-  MCFGraph = MinCostFlow
 end

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

@@ -1,16 +1,30 @@
 module AcLibraryRb
   # Strongly Connected Components
-  class SCCGraph
+  class SCC
     # initialize graph with n vertices
-    def initialize(n = 0)
-      @n, @edges = n, []
+    def initialize(n)
+      @n = n
+      @edges = []
     end
 
     # add directed edge
     def add_edge(from, to)
-      raise "invalid params" unless (0...@n).include? from and (0...@n).include? to
+      unless 0 <= from && from < @n and 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]
+      self
+    end
+
+    def add_edges(edges)
+      edges.each{ |from, to| add_edge(from, to) }
+      self
+    end
+
+    def add(x, to = nil)
+      to ? add_edge(x, to) : add_edges(x)
     end
 
     # returns list of strongly connected components
@@ -18,10 +32,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
 
@@ -60,7 +72,8 @@ module AcLibraryRb
     end
 
     def csr
-      start, elist = [0] * (@n + 1), [nil] * @edges.size
+      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
@@ -71,9 +84,4 @@ module AcLibraryRb
       [start, elist]
     end
   end
-
-  # class alias
-  StronglyConnectedComponents = SCCGraph
-  SCC  = SCCGraph
-  SCCG = SCCGraph
 end