advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/gchan/2019/05_2.yml

@@ -0,0 +1,70 @@
+---
+- :name: day-05-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-05
+  :solution: |-
+    codes = input.split(",").map(&:to_i)
+    inp = 5
+
+    i = 0
+
+    loop do
+      opcode = codes[i] % 100
+
+      modes = (codes[i] / 100).digits
+      3.times { modes << 0 }
+
+      refs = modes.map.with_index do |m, idx|
+        address = i + idx + 1
+
+        if m == 1
+          address
+        else
+          codes[address]
+        end
+      end
+
+      case opcode
+      when 1
+        op = :+
+      when 2
+        op = :*
+      when 3
+        codes[codes[i + 1]] = inp
+      when 4
+        puts codes[refs[0]]
+      when 5
+        if codes[refs[0]] != 0
+          i = codes[refs[1]]
+          next
+        end
+      when 6
+        if codes[refs[0]] == 0
+          i = codes[refs[1]]
+          next
+        end
+      when 7
+        if codes[refs[0]] < codes[refs[1]]
+          codes[refs[2]] = 1
+        else
+          codes[refs[2]] = 0
+        end
+      when 8
+        if codes[refs[0]] == codes[refs[1]]
+          codes[refs[2]] = 1
+        else
+          codes[refs[2]] = 0
+        end
+      when 99
+        exit
+      end
+
+      codes[refs[2]] = codes[refs[0]].send(op, codes[refs[1]]) if op
+
+      if [1, 2, 7, 8].include?(opcode)
+        i += 4
+      elsif [5, 6].include?(opcode)
+        i += 3
+      else
+        i += 2
+      end
+    end

data/data/solutions/github/gchan/2019/06_1.yml

@@ -0,0 +1,22 @@
+---
+- :name: day-06-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-06
+  :solution: |-
+    orbits = {}
+
+    input.split("\n").each do |orbit|
+      a, b = orbit.split(")")
+
+      orbits[b] = a
+    end
+
+    count = 0
+
+    orbits.each do |obj, _|
+      while orbits[obj]
+        obj = orbits[obj]
+        count += 1
+      end
+    end
+
+    puts count

data/data/solutions/github/gchan/2019/06_2.yml

@@ -0,0 +1,31 @@
+---
+- :name: day-06-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-06
+  :solution: |-
+    orbits = {}
+
+    input.split("\n").each do |orbit|
+      a, b = orbit.split(")")
+
+      orbits[b] = a
+    end
+
+    def path(orbits, from)
+      path = []
+
+      while orbits[from]
+        from = orbits[from]
+        path << from
+      end
+
+      path
+    end
+
+    you_path = path(orbits, "YOU")
+    santa_path = path(orbits, "SAN")
+
+    intersect = you_path.find do |obj|
+      santa_path.include?(obj)
+    end
+
+    puts you_path.index(intersect) + santa_path.index(intersect)

data/data/solutions/github/gchan/2019/07_1.yml

@@ -0,0 +1,87 @@
+---
+- :name: day-07-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-07
+  :solution: |-
+    def run(codes, inp, phase)
+      i = 0
+      out = nil
+
+      loop do
+        opcode = codes[i] % 100
+
+        modes = (codes[i] / 100).digits
+        3.times { modes << 0 }
+
+        refs = modes.map.with_index do |m, idx|
+          address = i + idx + 1
+
+          if m == 1
+            address
+          else
+            codes[address]
+          end
+        end
+
+        case opcode
+        when 1
+          op = :+
+        when 2
+          op = :*
+        when 3
+          codes[refs[0]] = phase || inp
+          phase = nil
+        when 4
+          out = codes[refs[0]]
+        when 5
+          if codes[refs[0]] != 0
+            i = codes[refs[1]]
+            next
+          end
+        when 6
+          if codes[refs[0]] == 0
+            i = codes[refs[1]]
+            next
+          end
+        when 7
+          if codes[refs[0]] < codes[refs[1]]
+            codes[refs[2]] = 1
+          else
+            codes[refs[2]] = 0
+          end
+        when 8
+          if codes[refs[0]] == codes[refs[1]]
+            codes[refs[2]] = 1
+          else
+            codes[refs[2]] = 0
+          end
+        when 99
+          return out
+        end
+
+        codes[refs[2]] = codes[refs[0]].send(op, codes[refs[1]]) if op
+
+        if [1, 2, 7, 8].include?(opcode)
+          i += 4
+        elsif [5, 6].include?(opcode)
+          i += 3
+        else
+          i += 2
+        end
+      end
+    end
+
+    codes = input.split(",").map(&:to_i)
+
+    best = 0
+
+    (0..4).to_a.permutation.each do |phases|
+      inp = 0
+
+      phases.each do |phase|
+        inp = run(codes.clone, inp, phase)
+      end
+
+      best = [inp, best].max
+    end
+
+    puts best

data/data/solutions/github/gchan/2019/07_2.yml

@@ -0,0 +1,111 @@
+---
+- :name: day-07-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-07
+  :solution: |-
+    class Amp
+      attr_reader :codes, :phase, :i, :halted
+
+      def initialize(codes, phase)
+        @codes  = codes
+        @phase  = phase
+        @halted = false
+        @i      = 0
+      end
+
+      def run(inp)
+        out = nil
+
+        loop do
+          opcode = codes[i] % 100
+
+          modes = (codes[i] / 100).digits
+          3.times { modes << 0 }
+
+          refs = modes.map.with_index do |m, idx|
+            address = i + idx + 1
+
+            if m == 1
+              address
+            else
+              codes[address]
+            end
+          end
+
+          case opcode
+          when 1
+            op = :+
+          when 2
+            op = :*
+          when 3
+            if phase
+              codes[refs[0]] = phase
+              @phase = nil
+            elsif inp
+              codes[refs[0]] = inp
+              inp = nil
+            else
+              return out
+            end
+          when 4
+            out = codes[refs[0]]
+          when 5
+            if codes[refs[0]] != 0
+              @i = codes[refs[1]]
+              next
+            end
+          when 6
+            if codes[refs[0]] == 0
+              @i = codes[refs[1]]
+              next
+            end
+          when 7
+            if codes[refs[0]] < codes[refs[1]]
+              codes[refs[2]] = 1
+            else
+              codes[refs[2]] = 0
+            end
+          when 8
+            if codes[refs[0]] == codes[refs[1]]
+              codes[refs[2]] = 1
+            else
+              codes[refs[2]] = 0
+            end
+          when 99
+            @halted = true
+            return out
+          end
+
+          codes[refs[2]] = codes[refs[0]].send(op, codes[refs[1]]) if op
+
+          if [1, 2, 7, 8].include?(opcode)
+            @i += 4
+          elsif [5, 6].include?(opcode)
+            @i += 3
+          else
+            @i += 2
+          end
+        end
+      end
+    end
+
+    codes = input.split(",").map(&:to_i)
+
+    best = 0
+
+    (5..9).to_a.permutation.each do |phases|
+      amps = phases.map do |phase|
+        Amp.new(codes.clone, phase)
+      end
+
+      inp = 0
+
+      while amps.none?(&:halted)
+        amps.each do |amp|
+          inp = amp.run(inp)
+        end
+      end
+
+      best = [inp, best].max
+    end
+
+    puts best

data/data/solutions/github/gchan/2019/08_1.yml

@@ -0,0 +1,17 @@
+---
+- :name: day-08-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-08
+  :solution: |-
+    height = 6
+    width = 25
+
+    area = height * width
+
+    layers = input.chars.map(&:to_i).each_slice(area)
+
+    layer = layers.min_by do |layer|
+      layer.count { |pixel| pixel.zero? }
+    end
+
+    puts layer.count { |pixel| pixel == 1 } *
+      layer.count { |pixel| pixel == 2 }

data/data/solutions/github/gchan/2019/08_2.yml

@@ -0,0 +1,20 @@
+---
+- :name: day-08-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-08
+  :solution: |-
+    height = 6
+    width = 25
+
+    area = height * width
+
+    layers = input.chars.map(&:to_i).each_slice(area)
+
+    area.times do |i|
+      layer = layers.find do |layer|
+        pixel = layer[i]
+        pixel == 0 || pixel == 1
+      end
+
+      print (layer[i] == 0 ? " " : "#")
+      puts if (i + 1) % width == 0
+    end

data/data/solutions/github/gchan/2019/09_1.yml

@@ -0,0 +1,80 @@
+---
+- :name: day-09-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-09
+  :solution: |-
+    codes = Hash.new(0)
+
+    input.split(",").each_with_index do |code, i|
+      codes[i] = code.to_i
+    end
+
+    relative_base = 0
+    inp = 1
+
+    i = 0
+
+    loop do
+      opcode = codes[i] % 100
+
+      modes = (codes[i] / 100).digits
+      3.times { modes << 0 }
+
+      refs = modes.map.with_index do |m, idx|
+        address = i + idx + 1
+
+        if m == 1
+          address
+        elsif m == 2
+          relative_base + codes[address]
+        else
+          codes[address]
+        end
+      end
+
+      case opcode
+      when 1
+        op = :+
+      when 2
+        op = :*
+      when 3
+        codes[refs[0]] = inp
+      when 4
+        puts codes[refs[0]]
+      when 5
+        if codes[refs[0]] != 0
+          i = codes[refs[1]]
+          next
+        end
+      when 6
+        if codes[refs[0]] == 0
+          i = codes[refs[1]]
+          next
+        end
+      when 7
+        if codes[refs[0]] < codes[refs[1]]
+          codes[refs[2]] = 1
+        else
+          codes[refs[2]] = 0
+        end
+      when 8
+        if codes[refs[0]] == codes[refs[1]]
+          codes[refs[2]] = 1
+        else
+          codes[refs[2]] = 0
+        end
+      when 9
+        relative_base += codes[refs[0]]
+      when 99
+        exit
+      end
+
+      codes[refs[2]] = codes[refs[0]].send(op, codes[refs[1]]) if op
+
+      if [1, 2, 7, 8].include?(opcode)
+        i += 4
+      elsif [5, 6].include?(opcode)
+        i += 3
+      else
+        i += 2
+      end
+    end

data/data/solutions/github/gchan/2019/09_2.yml

@@ -0,0 +1,80 @@
+---
+- :name: day-09-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-09
+  :solution: |-
+    codes = Hash.new(0)
+
+    input.split(",").each_with_index do |code, i|
+      codes[i] = code.to_i
+    end
+
+    relative_base = 0
+    inp = 2
+
+    i = 0
+
+    loop do
+      opcode = codes[i] % 100
+
+      modes = (codes[i] / 100).digits
+      3.times { modes << 0 }
+
+      refs = modes.map.with_index do |m, idx|
+        address = i + idx + 1
+
+        if m == 1
+          address
+        elsif m == 2
+          relative_base + codes[address]
+        else
+          codes[address]
+        end
+      end
+
+      case opcode
+      when 1
+        op = :+
+      when 2
+        op = :*
+      when 3
+        codes[refs[0]] = inp
+      when 4
+        puts codes[refs[0]]
+      when 5
+        if codes[refs[0]] != 0
+          i = codes[refs[1]]
+          next
+        end
+      when 6
+        if codes[refs[0]] == 0
+          i = codes[refs[1]]
+          next
+        end
+      when 7
+        if codes[refs[0]] < codes[refs[1]]
+          codes[refs[2]] = 1
+        else
+          codes[refs[2]] = 0
+        end
+      when 8
+        if codes[refs[0]] == codes[refs[1]]
+          codes[refs[2]] = 1
+        else
+          codes[refs[2]] = 0
+        end
+      when 9
+        relative_base += codes[refs[0]]
+      when 99
+        exit
+      end
+
+      codes[refs[2]] = codes[refs[0]].send(op, codes[refs[1]]) if op
+
+      if [1, 2, 7, 8].include?(opcode)
+        i += 4
+      elsif [5, 6].include?(opcode)
+        i += 3
+      else
+        i += 2
+      end
+    end

data/data/solutions/github/gchan/2019/10_1.yml

@@ -0,0 +1,65 @@
+---
+- :name: day-10-part-1.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-10
+  :solution: |-
+    input     = File.read(file_path).strip
+
+    map = input.split("\n").map do |line|
+      line.split("")
+    end
+
+    asteroids = []
+    width = map.first.length
+    height = map.length
+
+    map.each.with_index do |row, y|
+      row.each.with_index do |cell, x|
+        asteroids << [x, y] if cell == "#"
+      end
+    end
+
+    best = nil
+
+    asteroids.each do |x, y|
+      angles = Hash.new { |h,k| h[k] = Array.new }
+
+      asteroids.each do |x2, y2|
+        next if y2 == y && x2 == x
+
+        dx = x - x2
+        dy = y - y2
+
+        # atan2 returns angle in radians from the potisive x-axis plane
+        # We want 0 to be on the positive y-axis hence minus PI / 2 radians
+        # Modulo by PI * 2 radians to only deal with positive numbers
+        angle = Math.atan2(dy, dx) - Math::PI / 2
+        angle %= Math::PI * 2
+
+        angles[angle] << [x2, y2]
+      end
+
+      if best.nil? || angles.count > best.count
+        best = angles
+
+        # Manhattan distance - vaporize closest first
+        best.values.each do |asteroids|
+          asteroids.sort_by! do |x3, y3|
+            (x - x3).abs + (y - y3).abs
+          end
+        end
+      end
+    end
+
+    puts best.count
+
+    vaporized = []
+
+    best.keys.sort.each do |angle|
+      asteroid = best[angle].shift
+      vaporized << asteroid
+
+      if vaporized.count == 200
+        puts asteroid[0] * 100 + asteroid[1]
+        exit
+      end
+    end

data/data/solutions/github/gchan/2019/10_2.yml

@@ -0,0 +1,63 @@
+---
+- :name: day-10-part-2.rb
+  :url: https://github.com/gchan/advent-of-code-ruby/blob/main/2019/day-10
+  :solution: |-
+    map = input.split("\n").map do |line|
+      line.split("")
+    end
+
+    asteroids = []
+    width = map.first.length
+    height = map.length
+
+    map.each.with_index do |row, y|
+      row.each.with_index do |cell, x|
+        asteroids << [x, y] if cell == "#"
+      end
+    end
+
+    best = nil
+
+    asteroids.each do |x, y|
+      angles = Hash.new { |h,k| h[k] = Array.new }
+
+      asteroids.each do |x2, y2|
+        next if y2 == y && x2 == x
+
+        dx = x - x2
+        dy = y - y2
+
+        # atan2 returns angle in radians from the potisive x-axis plane
+        # We want 0 to be on the positive y-axis hence minus PI / 2 radians
+        # Modulo by PI * 2 radians to only deal with positive numbers
+        angle = Math.atan2(dy, dx) - Math::PI / 2
+        angle %= Math::PI * 2
+
+        angles[angle] << [x2, y2]
+      end
+
+      if best.nil? || angles.count > best.count
+        best = angles
+
+        # Manhattan distance - vaporize closest first
+        best.values.each do |asteroids|
+          asteroids.sort_by! do |x3, y3|
+            (x - x3).abs + (y - y3).abs
+          end
+        end
+      end
+    end
+
+    puts best.count
+
+    vaporized = []
+
+    best.keys.sort.each do |angle|
+      asteroid = best[angle].shift
+      vaporized << asteroid
+
+      if vaporized.count == 200
+        puts asteroid[0] * 100 + asteroid[1]
+        exit
+      end
+    end