ac-library-rb 0.6.1 → 1.0.0

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

@@ -37,39 +37,40 @@ module AcLibraryRb
 
     # return edge = [from, to, cap, flow]
     def [](i)
-      _e  = @g[@pos[i][0]][@pos[i][1]]
-      _re = @g[_e[0]][_e[1]]
-      [@pos[i][0], _e[0], _e[-1] + _re[-1], _re[-1]]
+      from, from_id = @pos[i]
+
+      to, to_id, cap = @g[from][from_id]    # edge
+      _from, _from_id, flow = @g[to][to_id] # reverse edge
+
+      [from, to, cap + flow, flow]
     end
     alias get_edge []
     alias edge []
 
     def edges
-      @pos.map do |(from, id)|
-        _e  = @g[from][id]
-        _re = @g[_e[0]][_e[1]]
-        [from, _e[0], _e[-1] + _re[-1], _re[-1]]
+      @pos.map do |(from, from_id)|
+        to, to_id, cap = @g[from][from_id]
+        _from, _from_id, flow = @g[to][to_id]
+        [from, to, cap + flow, flow]
       end
     end
 
     def change_edge(i, new_cap, new_flow)
-      _e  = @g[@pos[i][0]][@pos[i][1]]
-      _re = @g[_e[0]][_e[1]]
-      _e[2]  = new_cap - new_flow
-      _re[2] = new_flow
+      from, from_id = @pos[i]
+
+      e = @g[from][from_id]
+      re = @g[e[0]][e[1]]
+      e[2]  = new_cap - new_flow
+      re[2] = new_flow
     end
 
     def flow(s, t, flow_limit = 1 << 64)
-      level = Array.new(@n)
-      iter  = Array.new(@n)
-      que   = []
-
       flow = 0
       while flow < flow_limit
-        bfs(s, t, level, que)
+        level = bfs(s, t)
         break if level[t] == -1
 
-        iter.fill(0)
+        iter = [0] * @n
         while flow < flow_limit
           f = dfs(t, flow_limit - flow, s, level, iter)
           break if f == 0
@@ -99,22 +100,22 @@ module AcLibraryRb
 
     private
 
-    def bfs(s, t, level, que)
-      level.fill(-1)
+    def bfs(s, t)
+      level = Array.new(@n, -1)
       level[s] = 0
-      que.clear
-      que << s
+      que = [s]
 
       while (v = que.shift)
-        @g[v].each do |e|
-          next if e[2] == 0 || level[e[0]] >= 0
+        @g[v].each do |u, _, cap|
+          next if cap == 0 || level[u] >= 0
 
-          level[e[0]] = level[v] + 1
-          return nil if e[0] == t
+          level[u] = level[v] + 1
+          return level if u == t
 
-          que << e[0]
+          que << u
         end
       end
+      level
     end
 
     def dfs(v, up, s, level, iter)

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

@@ -5,7 +5,7 @@ module AcLibraryRb
   class ModInt < Numeric
     class << self
       def set_mod(mod)
-        raise ArgumentError unless mod.is_a? Integer and 1 <= mod
+        raise ArgumentError unless mod.is_a?(Integer) && (1 <= mod)
 
         $_mod = mod
         $_mod_is_prime = ModInt.prime?(mod)
@@ -27,7 +27,7 @@ module AcLibraryRb
 
       def prime?(n)
         return false if n <= 1
-        return true if n == 2 or n == 7 or n == 61
+        return true if (n == 2) || (n == 7) || (n == 61)
         return false if (n & 1) == 0
 
         d = n - 1
@@ -35,11 +35,11 @@ module AcLibraryRb
         [2, 7, 61].each do |a|
           t = d
           y = a.pow(t, n)
-          while t != n - 1 and y != 1 and y != n - 1
+          while (t != n - 1) && (y != 1) && (y != n - 1)
             y = y * y % n
             t <<= 1
           end
-          return false if y != n - 1 and (t & 1) == 0
+          return false if (y != n - 1) && ((t & 1) == 0)
         end
         true
       end

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

@@ -14,11 +14,17 @@ module AcLibraryRb
       heapify
     end
 
+    def self.[](*array, &comp)
+      new(array, &comp)
+    end
+
     attr_reader :heap
+    alias to_a heap
 
     # Push new element to the heap.
     def push(item)
       shift_down(0, @heap.push(item).size - 1)
+      self
     end
 
     alias << push
@@ -47,6 +53,14 @@ module AcLibraryRb
       @heap.empty?
     end
 
+    def size
+      @heap.size
+    end
+
+    def to_s
+      "<#{self.class}: @heap:(#{heap.join(', ')}), @comp:<#{@comp.class} #{@comp.source_location.join(':')}>>"
+    end
+
     private
 
     def heapify

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

@@ -4,17 +4,17 @@ module AcLibraryRb
     # initialize graph with n vertices
     def initialize(n)
       @n = n
-      @edges = []
+      @edges = Array.new(n) { [] }
     end
 
     # add directed edge
     def add_edge(from, to)
-      unless 0 <= from && from < @n and 0 <= to && to < @n
+      unless 0 <= from && from < @n && 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]
+      @edges[from] << to
       self
     end
 
@@ -29,7 +29,7 @@ module AcLibraryRb
 
     # returns list of strongly connected components
     # the components are sorted in topological order
-    # O(@n + @edges.size)
+    # O(@n + @edges.sum(&:size))
     def scc
       group_num, ids = scc_ids
       groups = Array.new(group_num) { [] }
@@ -40,48 +40,50 @@ module AcLibraryRb
     private
 
     def scc_ids
-      start, elist = csr
-      now_ord = group_num = 0
-      visited, low, ord, ids = [], [], [-1] * @n, []
-      dfs = ->(v) {
-        low[v] = ord[v] = now_ord
-        now_ord += 1
-        visited << v
-        (start[v]...start[v + 1]).each do |i|
-          to = elist[i]
-          low[v] = if ord[to] == -1
-                     dfs.(to)
-                     [low[v], low[to]].min
-                   else
-                     [low[v], ord[to]].min
-                   end
-        end
-        if low[v] == ord[v]
-          loop do
-            u = visited.pop
-            ord[u] = @n
-            ids[u] = group_num
+      now_ord = 0
+
+      visited = []
+      low = Array.new(@n, 1 << 60)
+      ord = Array.new(@n, -1)
+      group_num = 0
+
+      (0...@n).each do |v|
+        next if ord[v] != -1
+
+        stack = [[v, 0]]
+
+        while (v, i = stack.pop)
+          if i == 0
+            visited << v
+            low[v] = ord[v] = now_ord
+            now_ord += 1
+          end
+
+          while i < @edges[v].size
+            u = @edges[v][i]
+            i += 1
+
+            if ord[u] == -1
+              stack << [v, i] << [u, 0]
+              break 1
+            end
+          end and next
+
+          low[v] = [low[v], @edges[v].map { |e| low[e] }.min || @n].min
+          next if low[v] != ord[v]
+
+          while (u = visited.pop)
+            low[u] = @n
+            ord[u] = group_num
             break if u == v
           end
           group_num += 1
-        end
-      }
-      @n.times { |i| dfs.(i) if ord[i] == -1 }
-      ids = ids.map { |x| group_num - 1 - x }
-      [group_num, ids]
-    end
 
-    def csr
-      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
-      @edges.each do |(i, j)|
-        elist[counter[i]] = j
-        counter[i] += 1
+        end
       end
-      [start, elist]
+
+      ord.map! { |e| group_num - e - 1 }
+      [group_num, ord]
     end
   end
 end

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

@@ -13,7 +13,7 @@ module AcLibraryRb
     attr_reader :answer
 
     def add_clause(i, f, j, g)
-      unless 0 <= i && i < @n and 0 <= j && j < @n
+      unless 0 <= i && i < @n && 0 <= j && j < @n
         raise ArgumentError.new("i:#{i} and j:#{j} must be in (0...#{@n})")
       end
 

metadata

@@ -1,15 +1,29 @@
 --- !ruby/object:Gem::Specification
 name: ac-library-rb
 version: !ruby/object:Gem::Version
-  version: 0.6.1
+  version: 1.0.0
 platform: ruby
 authors:
 - universato
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2021-08-09 00:00:00.000000000 Z
+date: 2023-03-06 00:00:00.000000000 Z
 dependencies:
+- !ruby/object:Gem::Dependency
+  name: prime
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: minitest
   requirement: !ruby/object:Gem::Requirement
@@ -52,9 +66,24 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
-description: |-
+- !ruby/object:Gem::Dependency
+  name: simplecov-cobertura
+  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......
+  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: []
@@ -70,6 +99,7 @@ files:
 - README.md
 - Rakefile
 - ac-library-rb.gemspec
+- ac-library-rb_header.jpg
 - bin/console
 - bin/lock_lib.rb
 - bin/setup
@@ -84,6 +114,7 @@ files:
 - document_en/min_cost_flow.md
 - document_en/modint.md
 - document_en/priority_queue.md
+- document_en/scc.md
 - document_en/segtree.md
 - document_en/string.md
 - document_en/two_sat.md
@@ -151,23 +182,24 @@ licenses:
 metadata:
   homepage_uri: https://github.com/universato/ac-library-rb
   source_code_uri: https://github.com/universato/ac-library-rb
+  rubygems_mfa_required: 'true'
 post_install_message:
 rdoc_options: []
 require_paths:
 - lib_lock
-- lib_helpers
+- lib_helpers"
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: 2.5.0
+      version: 2.7.0
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.2.22
+rubygems_version: 3.3.3
 signing_key:
 specification_version: 4
 summary: ac-library-rb is a ruby port of AtCoder Library (ACL).