advent_of_ruby 0.2.0 → 0.3.0

data/data/solutions/github/ZogStriP/2020/20_2.yml

@@ -0,0 +1,142 @@
+---
+- :name: 20_jurassic_jigsaw.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2020
+  :solution: |-
+    def top(tile)
+      tile[0]
+    end
+
+    def bottom(tile)
+      tile[-1]
+    end
+
+    def left(tile)
+      tile.map { _1[0] }.join
+    end
+
+    def right(tile)
+      tile.map { _1[-1] }.join
+    end
+
+    def borders(tile)
+      [
+        top(tile),
+        bottom(tile),
+        left(tile),
+        right(tile),
+      ]
+    end
+
+    def all_borders(tile)
+      b = borders(tile)
+      b + b.map(&:reverse)
+    end
+
+    def borderless(tile)
+      tile[1...-1].map { _1[1...-1] }
+    end
+
+    def rotate(tile)
+      transpose(tile).reverse
+    end
+
+    def flip_v(tile)
+      tile.reverse
+    end
+
+    def flip_h(tile)
+      tile.map(&:reverse)
+    end
+
+    def transpose(tile)
+      tile.map(&:chars).transpose.map(&:join)
+    end
+
+    def transformations(tile)
+      [
+        tile,
+        flip_v(tile),
+        flip_h(tile),
+        flip_h(flip_v(tile)),
+        transpose(tile),
+        transpose(flip_v(tile)),
+        transpose(flip_h(tile)),
+        transpose(flip_h(flip_v(tile))),
+      ]
+    end
+
+    @tiles = DATA.read.split("\n\n").to_h { |lines|
+      id, *tile = lines.split(?\n)
+      [id[/\d+/].to_i, tile]
+    }
+
+    @borders_match = Hash.new { |h, k| h[k] = [] }
+
+    @tiles.each { |id, tile|
+      all_borders(tile).each { |border|
+        @borders_match[border] << id
+      }
+    }
+
+    corners = @tiles.select { |_, tile| borders(tile).sum { @borders_match[_1].size - 1 } == 2 }
+    p corners.keys.reduce(:*)
+
+    top_left_id   = corners.keys[0]
+    top_left_tile = @tiles[top_left_id]
+    top_left_tile = rotate(top_left_tile) until @borders_match[left(top_left_tile)].size == 1 && @borders_match[top(top_left_tile)].size == 1
+
+    N = Integer.sqrt(@tiles.size)
+
+    grid = Array.new(N) { Array.new(N) }
+    grid[0][0] = [top_left_id, top_left_tile]
+
+    def match(id, border, other_border)
+      m_id   = @borders_match[border].find { _1 != id }
+      m_tile = transformations(@tiles[m_id]).find { border == send(other_border, _1) }
+      [m_id, m_tile]
+    end
+
+    N.times { |r|
+      if r > 0
+        top_id, top_tile = grid[r - 1][0]
+        grid[r][0] = match(top_id, bottom(top_tile), :top)
+      end
+
+      (1...N).each { |c|
+        left_id, left_tile = grid[r][c - 1]
+        grid[r][c] = match(left_id, right(left_tile), :left)
+      }
+    }
+
+    img = grid.flat_map { |r| r.map { borderless(_2) }.transpose.map(&:join) }
+
+    MONSTER = [
+      [0, 18],
+      [1, 0],
+      [1, 5],
+      [1, 6],
+      [1, 11],
+      [1, 12],
+      [1, 17],
+      [1, 18],
+      [1, 19],
+      [2, 1],
+      [2, 4],
+      [2, 7],
+      [2, 10],
+      [2, 13],
+      [2, 16],
+    ]
+
+    Y = img.size - MONSTER.map(&:first).max
+    X = img[0].size - MONSTER.map(&:last).max
+
+    p transformations(img).each { |img|
+      monsters = Y.times.sum { |y|
+        X.times.count { |x|
+          MONSTER.all? { |yy, xx| img[y + yy][x + xx][?#] }
+        }
+      }
+
+      break img.join.count(?#) - MONSTER.size * monsters if monsters > 0
+    }

data/data/solutions/github/ZogStriP/2020/21_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2020/21_2.yml

@@ -0,0 +1,24 @@
+---
+- :name: 21_allergen_assessment.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2020
+  :solution: |-
+    require "set"
+
+    foods = DATA.read.split(?\n).map { |line|
+      line =~ /(.+) \(contains (.+)\)/
+      [$1.split, $2.split(", ")].map(&:to_set)
+    }
+
+    ingredients = foods.map(&:first).reduce(:|)
+    allergens   = foods.map(&:last).reduce(:|)
+    unsafe      = allergens.to_h { |a| [a, foods.select { _1[1] === a }.map(&:first).reduce(:&)] }
+    safe        = ingredients - unsafe.values.reduce(:|)
+
+    p foods.sum { (_1[0] & safe).size }
+
+    while unsafe.any? { _2.size > 1 }
+      known = unsafe.values.select { _1.size == 1 }.reduce(:|)
+      unsafe.transform_values! { _1.size > 1 ? _1 - known : _1 }
+    end
+
+    puts unsafe.sort_by(&:first).map { _2.first }.join(?,)

data/data/solutions/github/ZogStriP/2020/22_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2020/22_2.yml

@@ -0,0 +1,49 @@
+---
+- :name: 22_crab_combat.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2020
+  :solution: |-
+    require "set"
+
+    decks = DATA.read.split("\n\n").map { _1.lines[1..].map(&:to_i) }
+
+    def combat(one, two)
+      until one.empty? || two.empty?
+        o, t = one.shift, two.shift
+        o > t ? one << o << t : two << t << o
+      end
+
+      one.empty? ? two : one
+    end
+
+    def recursive_combat(one, two, first: false)
+      return -1 if !first && one.max > two.max
+
+      seen = Set.new
+
+      loop {
+        return first ? one : -1 unless seen.add?((one + [0] + two).pack("c*"))
+
+        o, t = one.shift, two.shift
+
+        winner = if one.size >= o && two.size >= t
+          recursive_combat(one[...o], two[...t])
+        else
+          t <=> o
+        end
+
+        if winner < 0
+          one << o << t
+          return first ? one : -1 if two.empty?
+        else
+          two << t << o
+          return first ? two :  1 if one.empty?
+        end
+      }
+    end
+
+    def score(deck)
+      deck.reverse_each.with_index(1).sum { _1 * _2 }
+    end
+
+    p score combat(*decks.map(&:dup))
+    p score recursive_combat(*decks.map(&:dup), first: true)

data/data/solutions/github/ZogStriP/2020/23_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2020/23_2.yml

@@ -0,0 +1,43 @@
+---
+- :name: 23_crab_cups.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2020
+  :solution: |-
+    def game(cups, total, rounds, result)
+      after = *(1..total + 1)
+      cups.each_cons(2) { after[_1] = _2 }
+
+      if total > cups.size
+        after[cups[-1]] = cups.size + 1
+        after[total] = cups[0]
+      else
+        after[cups[-1]] = cups[0]
+      end
+
+      current = cups[0]
+
+      rounds.times { |r|
+        a = after[current]
+        b = after[a]
+        c = after[b]
+        d = after[c]
+
+        dest = current == 1 ? total : current - 1
+        dest = dest == 1 ? total : dest - 1 while dest == a || dest == b || dest == c
+
+        e = after[dest]
+
+        after[current] = d
+        after[dest] = a
+        after[c] = e
+
+        current = d
+      }
+
+      current = 1
+      result.times.map { current = after[current] }
+    end
+
+    cups = 962713854.digits.reverse
+
+    puts game(cups, cups.size, 100, cups.size - 1).join
+    puts game(cups, 1_000_000, 10_000_000, 2).reduce(:*)

data/data/solutions/github/ZogStriP/2020/24_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2020/24_2.yml

@@ -0,0 +1,44 @@
+---
+- :name: 24_lobby_layout.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2020
+  :solution: |-
+    tiles = {}
+
+    DATA.each_line { |l|
+      x, y = 0, 0
+
+      l.scan(/[ns]?[ew]/) { |d|
+        case d
+        when  "e"; x += 1
+        when "se"; y += 1
+        when "sw"; x -= 1; y += 1
+        when  "w"; x -= 1
+        when "nw"; y -= 1
+        when "ne"; x += 1; y -= 1
+        end
+      }
+
+      tiles[[x, y]] = !tiles[[x, y]]
+    }
+
+    blacks = tiles.filter_map { |pos, black| pos if black }
+
+    p blacks.size
+
+    100.times {
+      count = Hash.new(0)
+
+      blacks.each { |x, y|
+        count[[x, y]] += 1
+        count[[x + 1, y]] += 2
+        count[[x - 1, y]] += 2
+        count[[x, y + 1]] += 2
+        count[[x, y - 1]] += 2
+        count[[x + 1, y - 1]] += 2
+        count[[x - 1, y + 1]] += 2
+      }
+
+      blacks = count.filter_map { |pos, n| pos if (3..5) === n }
+    }
+
+    p blacks.size

data/data/solutions/github/ZogStriP/2020/25_1.yml

@@ -0,0 +1,9 @@
+---
+- :name: 25_combo_breaker.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2020
+  :solution: |-
+    i, n, card, door = 0, 1, *DATA.read.split.map(&:to_i)
+
+    (i += 1; n = (n * 7) % 20201227) while n != card
+
+    p door.pow(i, 20201227)

data/data/solutions/github/ZogStriP/2021/01_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/01_2.yml

@@ -0,0 +1,7 @@
+---
+- :name: 01_sonar_sweep.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    d = DATA.map &:to_i
+
+    p [2, 4].map { d.each_cons(_1).count { |a, *, b| b > a } }

data/data/solutions/github/ZogStriP/2021/02_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/02_2.yml

@@ -0,0 +1,12 @@
+---
+- :name: 02_dive.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    h = d = a = 0
+
+    DATA.each {
+      x = _1[-2].to_i
+      _1[?f] ? (h += x; d += a * x) : a += x * (?e <=> _1)
+    }
+
+    p h * a, h * d

data/data/solutions/github/ZogStriP/2021/03_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/03_2.yml

@@ -0,0 +1,18 @@
+---
+- :name: 03_binary_diagnostic.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    N = DATA.map { _1.chop.chars }
+
+    f = -> n, d { n.transpose.map { |b| b.tally.sort_by{[_2, _1]}[d][0] } }
+
+    g = -> n, d {
+      0.step { |i|
+        bits = f[n, d]
+        n = n.filter { _1[i] == bits[i] }
+        return n[0] if n.size == 1
+      }
+    }
+
+    p [0, -1].map { |d| f[N, d].join.to_i 2 }.reduce :*
+    p [0, -1].map { |d| g[N, d].join.to_i 2 }.reduce :*

data/data/solutions/github/ZogStriP/2021/04_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/04_2.yml

@@ -0,0 +1,20 @@
+---
+- :name: 04_giant_squid.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    numbers, *boards = DATA.read.split("\n\n")
+
+    numbers = numbers.split(?,).map &:to_i
+    boards.map! { |b| b.split("\n").map { _1.split.map &:to_i } }
+
+    scores = []
+
+    numbers.each { |n|
+      boards.reject! { |b|
+        b.each { |r| r.map! { _1 == n ? 0 : _1 } }
+        scores << n * b.flatten.sum if won = [b, b.transpose].any? { |r| r.any? { _1.sum == 0 } }
+        won
+      }
+    }
+
+    p scores[0], scores[-1]

data/data/solutions/github/ZogStriP/2021/05_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/05_2.yml

@@ -0,0 +1,24 @@
+---
+- :name: 05_hydrothermal_venture.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    lines = DATA.map { _1.scan(/\d+/).map &:to_i }
+
+    _90 = Hash.new(0)
+    _45 = Hash.new(0)
+
+    lines.each { |x1, y1, x2, y2|
+      dx = x2 <=> x1
+      dy = y2 <=> y1
+
+      if x1 == x2
+        y1.step(y2, dy).each { _90[x1 + _1 * 1000] += 1 }
+      elsif y1 == y2
+        x1.step(x2, dx).each { _90[_1 + y1 * 1000] += 1 }
+      else
+        x1.step(x2, dx).each_with_index { |x, i| _45[x + (y1 + i * dy) * 1000] += 1 }
+      end
+    }
+
+    p _90.count { _2 > 1 }
+    p _90.merge(_45) { _2 + _3 }.count { _2 > 1 }

data/data/solutions/github/ZogStriP/2021/06_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/06_2.yml

@@ -0,0 +1,11 @@
+---
+- :name: 06_lanternfish.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    F = DATA.read
+
+    [80, 256].map { |i|
+      f = (?0..?8).map { F.count _1 }
+      i.times { f[7] += f[0]; f.rotate! }
+      p f.sum
+    }

data/data/solutions/github/ZogStriP/2021/07_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/07_2.yml

@@ -0,0 +1,9 @@
+---
+- :name: 07_the_treachery_of_whales.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    C = DATA.read.split(?,).map &:to_i
+
+    a, b = C.minmax
+    p (a..b).map { |x| C.sum { (_1 - x).abs } }.min
+    p (a..b).map { |x| C.sum { (_1 - x).abs * (1 + (_1 - x).abs) } }.min

data/data/solutions/github/ZogStriP/2021/08_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/08_2.yml

@@ -0,0 +1,26 @@
+---
+- :name: '08_seven_segment_search.rb'
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    INPUT = DATA.map { |l| l.split(?|).map { |i| i.split.map { _1.chars.sort } } }
+
+    p INPUT.sum { |s, v| v.count { [2, 3, 4, 7].include? _1.size } }
+
+    p INPUT.sum { |s, v|
+      s = s.group_by &:size
+
+      one   = s[2][0]
+      seven = s[3][0]
+      four  = s[4][0]
+      eight = s[7][0]
+      nine  = s[6].delete s[6].find { four & _1 == four }
+      zero  = s[6].delete s[6].find { one & _1 == one }
+      six   = s[6][0]
+      three = s[5].delete s[5].find { one & _1 == one }
+      five  = s[5].delete s[5].find { (six - _1).size == 1 }
+      two   = s[5][0]
+
+      segments = [zero, one, two, three, four, five, six, seven, eight, nine].map.with_index { |s, i| [s.join, i] }.to_h
+
+      v.map { segments[_1.join] }.join.to_i
+    }

data/data/solutions/github/ZogStriP/2021/09_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/09_2.yml

@@ -0,0 +1,36 @@
+---
+- :name: '09_smoke_basin.rb'
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    require "set"
+
+    N = [[-1,0],[1,0],[0,-1],[0,1]]
+
+    G = DATA.read.split.map &:chars
+    Y = (0...G.size)
+    X = (0...G[0].size)
+
+    l = []
+
+    Y.each { |y|
+      X.each { |x|
+        l << [y, x] if N.map { |dy, dx| [y + dy, x + dx] }
+                        .select { |yy, xx| Y === yy && X === xx }
+                        .all? { |yy, xx| G[y][x] < G[yy][xx] }
+      }
+    }
+
+    p l.sum { 1 + G[_1][_2].to_i }
+
+    p l.map { |y, x|
+      q = [[y, x]]
+      v = Set.new q
+
+      while c = q.shift
+        y, x = c
+        N.map { |dy, dx| [y + dy, x + dx] }
+         .each { |yy, xx| Y === yy && X === xx && G[yy][xx] < ?9 && v.add?([yy, xx]) && q << [yy, xx] }
+      end
+
+      v.size
+    }.max(3).reduce :*

data/data/solutions/github/ZogStriP/2021/10_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/10_2.yml

@@ -0,0 +1,27 @@
+---
+- :name: 10_syntax_scoring.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    OPPOSITES = { ?) => ?(, ?] => ?[, ?} =>   ?{, ?> =>    ?< }
+    CORRUPTED = { ?) =>  3, ?] => 57, ?} => 1197, ?> => 25137 }
+    COMPLETES = { ?( =>  1, ?[ =>  2, ?{ =>    3, ?< =>     4 }
+
+    corrupted = 0
+    completes = []
+
+    DATA.each { |l|
+      s = []
+
+      next if !l.chomp.chars { |c|
+        if COMPLETES[c]
+          s << c
+        elsif OPPOSITES[c] != s.pop
+          corrupted += CORRUPTED[c]
+          break
+        end
+      }
+
+      completes << s.reverse.reduce(0) { |a, c| a * 5 + COMPLETES[c] }
+    }
+
+    p corrupted, completes.sort[completes.size / 2]

data/data/solutions/github/ZogStriP/2021/11_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/11_2.yml

@@ -0,0 +1,36 @@
+---
+- :name: 11_dumbo_octopus.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    N = [-1,0,1].product([-1,0,1]) - [[0,0]]
+    Y = X = (0..9)
+
+    def step(energy)
+      flashed = {}
+
+      Y.each { |y| X.each { |x| energy[y][x] += 1 } }
+
+      loop {
+        changed = false
+        Y.each { |y|
+          X.each { |x|
+            next if energy[y][x] < 10 || flashed[[y, x]]
+
+            energy[y][x] = 0
+            flashed[[y, x]] = true
+            changed = true
+
+            N.map { |dy, dx| [y + dy, x + dx] }
+             .each { |yy, xx| Y === yy && X === xx && !flashed[[yy, xx]] && energy[yy][xx] += 1 }
+          }
+        }
+        break if !changed
+      }
+
+      [energy, flashed.size]
+    end
+
+    energy = DATA.map { _1.chomp.chars.map &:to_i }
+
+    p 100.times.sum { energy, flashes = step(energy); flashes }
+    p 101.step.find { energy, flashes = step(energy); flashes == 100 }

data/data/solutions/github/ZogStriP/2021/12_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/12_2.yml

@@ -0,0 +1,20 @@
+---
+- :name: 12_passage_pathing.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    N = Hash.new { |h, k| h[k] = [] }
+
+    DATA.each {
+      a, b = _1.chomp.split ?-
+      N[a] << b if b != "start"
+      N[b] << a if a != "start"
+    }
+
+    N.transform_values! { |v| v.partition { _1[/[A-Z]/] }}
+
+    def explore(path, max)
+      path[-1]["end"] ? 1 : N[path[-1]][0].sum { explore(path + [_1], max) || 0 } + N[path[-1]][1].sum { path.count(_1) < max && explore(path + [_1], path.include?(_1) ? 1 : max) || 0 }
+    end
+
+    p explore(["start"], 1)
+    p explore(["start"], 2)

data/data/solutions/github/ZogStriP/2021/13_1.yml

@@ -0,0 +1 @@
+--- []

data/data/solutions/github/ZogStriP/2021/13_2.yml

@@ -0,0 +1,30 @@
+---
+- :name: 13_transparent_origami.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2021
+  :solution: |-
+    require "set"
+
+    dots = Set.new
+    fold = -> v, a { v > a ? a * 2 - v : v }
+    folded = false
+
+    DATA.each { |l|
+      if l[?,]
+        dots << l.scan(/\d+/).map(&:to_i)
+      elsif l[?=]
+        axis, a = l.scan(/([xy])=(\d+)/)[0]
+        a = a.to_i
+        axis[?x] ? dots.map! { [fold[_1, a], _2] } : dots.map! { [_1, fold[_2, a]] }
+        (p dots.size; folded = true) unless folded
+      end
+    }
+
+    X = dots.map(&:first).max + 1
+    Y = dots.map(&:last).max + 1
+
+    Y.times { |y|
+      X.times { |x|
+        putc dots === [x, y] ? ?█ : " "
+      }
+      puts
+    }

data/data/solutions/github/ZogStriP/2021/14_1.yml

@@ -0,0 +1 @@
+--- []