advent_of_ruby 0.2.0 → 0.3.0

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

@@ -0,0 +1,21 @@
+---
+- :name: 03_gear_ratios.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    parts = {}
+    gears = Hash.new { _1[_2] = [] }
+
+    DATA.each { _1.scan(/\d+|[^.\n]/) { parts[[$., $~.begin(0)]] = $& } }
+
+    p parts.sum { |(y, x), c|
+      next 0 if (n = c.to_i) == 0
+
+      (y - 1 .. y + 1).any? { |yy|
+        (x - 1 .. x + c.size).any? { |xx|
+          parts[[yy, xx]] == ?* && gears[[yy, xx]] << n
+          (yy != y || xx != x) && parts[[yy, xx]]&.size == 1
+        }
+      } ? n : 0
+    }
+
+    p gears.sum { _2.size == 2 ? _2.reduce(:*) : 0 }

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

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

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

@@ -0,0 +1,10 @@
+---
+- :name: 04_scratchcards.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    I = DATA.map { _1.split(/[:|]/)[1..].map(&:split).reduce(&:&).size }
+    p I.sum { 1 << _1 - 1 }
+
+    c = I.map { 1 }
+    I.each.with_index { |v, i| (i+1).upto(i+v) { c[_1] += c[i] } }
+    p c.sum

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

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

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

@@ -0,0 +1,28 @@
+---
+- :name: 05_if_you_give_a_seed_a_fertilizer.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    seeds, *maps = DATA.read.split($/*2)
+
+    seeds = seeds.split[1..].map(&:to_i)
+    maps = maps.map { |m| m.split[2..].map(&:to_i).each_slice(3).map { [_2.._2 + _3 - 1, _1 - _2] } }
+
+    p maps.reduce(seeds) { |seeds, map| seeds.map { |s| s + map.find { |r, _| r === s }&.[](1).to_i } }.min
+
+    seeds = seeds.each_slice(2).map { _1.._1 + _2 - 1 }
+
+    p maps.reduce(seeds) { |seeds, map|
+      seeds.flat_map { |s|
+        m = map.filter_map { |r, d| [[s.min, r.min].max..[s.max, r.max].min, d] if s.min <= r.max && r.min <= s.max }
+        if m.empty?
+          s
+        else
+          a = m.map(&:first).map(&:min).min
+          b = m.map(&:first).map(&:max).max
+          r = m.map { |r, d| r.min + d .. r.max + d }
+          r << (s.min..a - 1) if s.min < a
+          r << (b + 1..s.max) if b < s.max
+          r
+        end
+      }
+    }.map(&:min).min

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

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

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

@@ -0,0 +1,11 @@
+---
+- :name: 06_wait_for_it.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    times, distances = DATA.map { _1.split[1..].map &:to_i }
+
+    p times.size.times.map { |i| (1...times[i]).count { _1 * (times[i] - _1) > distances[i] } }.reduce :*
+
+    time, distance = [times, distances].map { _1.join.to_i }
+
+    p (1..time).count { _1 * (time - _1) > distance }

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

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

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

@@ -0,0 +1,22 @@
+---
+- :name: 07_camel_cards.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    S = "23456789TJQKA"
+    J = S.index ?J
+
+    hjb = DATA.map { |l|
+      c, b = l.split
+      [c.chars.map { S.index _1 }, c.count(?J), b.to_i]
+    }
+
+    def s(r, j)
+      s = r.tally.values.sort.reverse + [0]
+      s[0] += j
+      s
+    end
+
+    def w(h) = h.each.with_index(1).sum { |(_, _, b), i| b * i }
+
+    p w hjb.sort_by { |h, _, _| [s(h, 0), h] }
+    p w hjb.sort_by { |h, j, _| [s(h - [J], j), h.map { _1 == J ? -1 : _1 }] }

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

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

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

@@ -0,0 +1,23 @@
+---
+- :name: '08_haunted_wasteland.rb'
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    directions, moves = DATA.read.split $/*2
+
+    moves = moves.split($/).to_h { a, l, r = _1.scan(/\w{3}/); [a, ?L => l, ?R => r] }
+
+    position = "AAA"
+
+    p 0.step { |s|
+      position = moves[position][directions[s % directions.size]]
+      break s + 1 if position == "ZZZ"
+    }
+
+    periods = []
+    positions = moves.keys.filter { _1.end_with? ?A }
+
+    p 0.step { |s|
+      positions.map! { moves[_1][directions[s % directions.size]] }
+      positions.delete_if { periods << s + 1 if _1.end_with? ?Z }
+      break periods if positions.empty?
+    }.reduce :lcm

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

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

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

@@ -0,0 +1,18 @@
+---
+- :name: '09_mirage_maintenance.rb'
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    puts DATA.map.with_object([0, 0]) { |l, s|
+      h = l.split.map &:to_i
+      l, r, m = 0, 0, 1
+
+      until h.all? 0
+        l += h[0] * m
+        r += h[-1]
+        m = -m
+        h = h.each_cons(2).map { _2 - _1 }
+      end
+
+      s[0] += r
+      s[1] += l
+    }

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

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

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

@@ -0,0 +1,54 @@
+---
+- :name: 10_pipe_maze.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    map = DATA.map { _1.chomp.chars }
+
+    sy = sx = 0
+
+    map.each_with_index { |row, y|
+      row.each_with_index { |cell, x|
+        (sy = y; sx = x) if cell[?S]
+      }
+    }
+
+    q = [[sy, sx]]
+    d = { [sy, sx] => 0 }
+    Y, X = map.size, map[0].size
+    N = [[-1, 0], [1, 0], [0, -1], [0, 1]]
+    M = {
+      ?- => { [0, -1] => "-LF", [0, 1] => "-J7" },
+      ?| => { [-1, 0] => "|F7", [1, 0] => "|LJ" },
+      ?L => { [0, 1] => "-J7", [-1, 0] => "|7F" },
+      ?J => { [0, -1] => "-LF", [-1, 0] => "|7F" },
+      ?F => { [0, 1] => "-J7", [1, 0] => "|LJ" },
+      ?7 => { [0, -1] => "-LF", [1, 0] => "|LJ" },
+    }
+
+    map[sy][sx] = ?J if sy > 0 && "|F7"[map[sy - 1][sx]] && sx > 0 && "-LF"[map[sy][sx - 1]]
+    map[sy][sx] = ?L if sy > 0 && "|F7"[map[sy - 1][sx]] && sx < X - 1 && "-J7"[map[sy][sx + 1]]
+    map[sy][sx] = ?7 if sy < Y - 1 && "|LJ"[map[sy + 1][sx]] && sx > 0 && "-LF"[map[sy][sx - 1]]
+    map[sy][sx] = ?F if sy < Y - 1 && "|LJ"[map[sy + 1][sx]] && sx < X - 1 && "-J7"[map[sy][sx + 1]]
+
+    while c = q.shift
+      y, x = c
+      N.each { |dy, dx|
+        yy, xx = y + dy, x + dx
+        n = yy, xx
+        (0...Y) === yy && (0...X) === xx && !d[n] && M[map[y][x]]&.[]([dy, dx])&.[](map[yy][xx]) && q << n && d[n] = d[c] + 1
+      }
+    end
+
+    p d.values.max
+
+    inside = -> y, x {
+      ys, xs = (y + 1...Y), (x + 1...X)
+      l = [ys.size, xs.size].min
+      ys.min(l).zip(xs.min(l)).count { d[[_1, _2]] && "-|FJ"[map[_1][_2]] }.odd?
+    }
+
+    p Y.times.sum { |y|
+      X.times.count { |x|
+        !d[[y, x]] && inside[y, x]
+      }
+    }

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

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

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

@@ -0,0 +1,20 @@
+---
+- :name: 11_cosmic_expansion.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    galaxies = DATA.flat_map.with_index { |row, y|
+      row.gsub(/#/).map { [y, $~.begin(0)] }
+    }
+
+    ys = galaxies.map &:first
+    xs = galaxies.map &:last
+
+    yy = (0..ys.max).filter { !ys.include? _1 }
+    xx = (0..xs.max).filter { !xs.include? _1 }
+
+    puts [2, 1_000_000].map { |t|
+      galaxies
+        .map { |y, x| [y + yy.count { _1 < y } * (t - 1), x + xx.count { _1 < x } * (t - 1)] }
+        .combination(2)
+        .sum { |(y1, x1), (y2, x2)| (y1 - y2).abs + (x1 - x2).abs }
+    }

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

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

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

@@ -0,0 +1,36 @@
+---
+- :name: 12_hot_springs.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    @cache = {}
+
+    arrangements = -> (springs, groups, g = -1) {
+      @cache[[springs, groups, g]] ||= begin
+        if springs.empty?
+          return groups.empty? && g <= 0 ? 1 : 0
+        end
+
+        case springs[0]
+        when ?.
+          return 0 if g > 0
+          arrangements[springs[1..], groups, -1]
+        when ?#
+          return 0 if g == 0
+          if g < 0
+            groups.empty? ? 0 : arrangements[springs[1..], groups[1..], groups[0] - 1]
+          else
+            arrangements[springs[1..], groups, g - 1]
+          end
+        when ??
+          arrangements[?. + springs[1..], groups, g] +
+          arrangements[?# + springs[1..], groups, g]
+        end
+      end
+    }
+
+    puts DATA.map.with_object([0, 0]) { |line, p|
+      a, b = line.split
+      b = b.split(?,).map &:to_i
+      p[0] += arrangements[a, b]
+      p[1] += arrangements[([a] * 5) * ??, b * 5]
+    }

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

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

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

@@ -0,0 +1,20 @@
+---
+- :name: 13_point_of_incidence.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    def diffs(m)
+      l, r = [m[0]], m[1..]
+      (1...m.size).map { |i|
+        d = l.zip(r).sum { |a, b| b ? a.zip(b).count { _1 != _2 } : 0 }
+        l.unshift r.shift
+        [d, i]
+      }
+    end
+
+    puts DATA.each_line($/*2).with_object([0, 0]) { |m, s|
+      h = m.split.map &:chars
+      v = h.transpose
+      d = diffs(h).each { _1[1] *= 100 } + diffs(v)
+      s[0] += d.find { _1[0] == 0 }[1]
+      s[1] += d.find { _1[0] == 1 }[1]
+    }

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

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

data/data/solutions/github/ZogStriP/2023/14_2.yml

@@ -0,0 +1,29 @@
+---
+- :name: 14_parabolic_reflector_dish.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    map = DATA.map { _1.chomp.chars.map &{ ?O => 0, ?# => 1 } }
+
+    def load(m) = m.sum { _1.each_with_index.sum { |c, i| c == 0 ? i + 1 : 0 } }
+    def rotate(m) = m.reverse.transpose
+
+    def tilt(m)
+      n = Array.new(m.size) { [nil] * m[0].size }
+      m.each_with_index { |row, r|
+        (b = row.size).downto(0) { |c|
+          case row[c]
+          when 1; n[r][b  = c] = 1
+          when 0; n[r][b -= 1] = 0
+          end
+        }
+      }
+      n
+    end
+
+    p load tilt rotate map
+
+    seen = []
+
+    4.times { map = tilt rotate map } until offset = (seen << map)[...-1].index(map)
+
+    p load rotate seen[offset + (1_000_000_000 - offset) % (seen.size - 1 - offset)]

data/data/solutions/github/ZogStriP/2023/15_1.yml

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

data/data/solutions/github/ZogStriP/2023/15_2.yml

@@ -0,0 +1,23 @@
+---
+- :name: 15_lens_library.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    steps = DATA.read.split ?,
+
+    def h(s) = s.chars.reduce(0) { (_1 + _2.ord) * 17 % 256 }
+
+    p steps.sum { h _1 }
+
+    boxes = Hash.new { _1[_2] = {} }
+
+    steps.each {
+      if _1[?=]
+        l, f = _1.split ?=
+        boxes[h l][l] = f.to_i
+      else
+        l = _1[...-1]
+        boxes[h l].delete l
+      end
+    }
+
+    p boxes.sum { |box, lenses| (box + 1) * lenses.each_value.with_index(1).sum { _1 * _2 } }

data/data/solutions/github/ZogStriP/2023/16_1.yml

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

data/data/solutions/github/ZogStriP/2023/16_2.yml

@@ -0,0 +1,4 @@
+---
+- :name: 16_the_floor_will_be_lava.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: "G = DATA.map &:chomp\nY, X = G.size, G[0].size\n\ndef \U0001F526(y, x, dy, dx)\n  beams = [[y, x, dy, dx]]\n  energized = Set.new\n  seen = Set.new\n\n  while b = beams.shift\n    next if !seen.add?(b)\n    y, x, dy, dx = b\n    ny, nx = y + dy, x + dx\n    next if ny < 0 || ny >= Y || nx < 0 || nx >= X\n    energized << [ny, nx]\n\n    case G[ny][nx]\n    when ?.\n      beams << [ny, nx, dy, dx]\n    when ?/\n      if dy > 0 # down\n        beams << [ny, nx, 0, -1]\n      elsif dy < 0 # up\n        beams << [ny, nx, 0, 1]\n      elsif dx > 0 # right\n        beams << [ny, nx, -1, 0]\n      elsif dx < 0 # left\n        beams << [ny, nx, 1, 0]\n      end\n    when ?\\\\\n      if dy > 0 # down\n        beams << [ny, nx, 0, 1]\n      elsif dy < 0 # up\n        beams << [ny, nx, 0, -1]\n      elsif dx > 0 # right\n        beams << [ny, nx, 1, 0]\n      elsif dx < 0 # left\n        beams << [ny, nx, -1, 0]\n      end\n    when ?-\n      if dy == 0\n        beams << [ny, nx, dy, dx]\n      else\n        beams << [ny, nx, -dx, dy]\n        beams << [ny, nx, dx, -dy]\n      end\n    when ?|\n      if dx == 0\n        beams << [ny, nx, dy, dx]\n      else\n        beams << [ny, nx, -dx, dy]\n        beams << [ny, nx, dx, -dy]\n      end\n    end\n  end\n\n  energized.size\nend\n\np \U0001F526(0, -1, 0, 1)\n\np [\n  *Y.times.map { \U0001F526(_1, -1, 0, 1) },\n  *Y.times.map { \U0001F526(_1, X, 0, -1) },\n  *X.times.map { \U0001F526(-1, _1, 1, 0) },\n  *X.times.map { \U0001F526(Y, _1, -1, 0) }\n].max"

data/data/solutions/github/ZogStriP/2023/17_1.yml

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

data/data/solutions/github/ZogStriP/2023/17_2.yml

@@ -0,0 +1,40 @@
+---
+- :name: 17_clumsy_crucible.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    require_relative "priority_queue"
+
+    M = DATA.map { _1.chomp.chars.map &:to_i }
+    Y, X = M.size, M[0].size
+    TY, TX = Y - 1, X - 1
+    N = [[-1, 0], [1, 0], [0, -1], [0, 1]]
+
+    heat_loss = -> (min, max) {
+      v = Set.new
+      q = PriorityQueue.new
+      q.push [0, 0, 0, 0, 0, 0], 0
+
+      while c = q.pop
+        h, y, x, dy, dx, t = c
+
+        return h if y == TY && x == TX
+
+        next unless v.add?([y, x, dy, dx, t])
+
+        if t < max && [dy, dx] != [0, 0]
+          ny, nx = y + dy, x + dx
+          q.push([h + M[ny][nx], ny, nx, dy, dx, t + 1], h + M[ny][nx]) if ny >= 0 && ny < Y && nx >= 0 && nx < X
+        end
+
+        if t >= min || [dy, dx] == [0, 0]
+          N.each { |ndy, ndx|
+            next if [ndy, ndx] == [dy, dx] || [-ndy, -ndx] == [dy, dx]
+            ny, nx = y + ndy, x + ndx
+            q.push([h + M[ny][nx], ny, nx, ndy, ndx, 1], h + M[ny][nx]) if ny >= 0 && ny < Y && nx >= 0 && nx < X
+          }
+        end
+      end
+    }
+
+    p heat_loss[1, 3]
+    p heat_loss[4, 10]

data/data/solutions/github/ZogStriP/2023/18_1.yml

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

data/data/solutions/github/ZogStriP/2023/18_2.yml

@@ -0,0 +1,19 @@
+---
+- :name: 18_lavaduct_lagoon.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    D = { ?R => 0, ?D => 1, ?L => 2, ?U => 3 }
+    N = [[0, 1], [1, 0], [0, -1], [-1, 0]]
+    I = DATA.map {
+      _1 =~ /(.) (\d+) \(#(\h{5})(\h)\)/
+      [[N[D[$1]], $2.to_i], [N[$4.to_i], $3.hex]]
+    }
+
+    def area(vs)
+      y = x = 0
+      v = vs.map { |(dy, dx), s| [y += dy * s, x += dx * s] }
+      (vs.sum { _2 } + v.each_cons(2).sum { |(y1, x1), (y2, x2)| x1 * y2 - y1 * x2 }) / 2 + 1
+    end
+
+    p area I.map &:first
+    p area I.map &:last

data/data/solutions/github/ZogStriP/2023/19_1.yml

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

data/data/solutions/github/ZogStriP/2023/19_2.yml

@@ -0,0 +1,48 @@
+---
+- :name: 19_aplenty.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    rules, parts = DATA.read.split($/*2).map &:lines
+
+    W = rules.to_h { _1[/(.+)\{(.+)\}/]; [$1, $2.split(?,)] }.merge(?A => [?A], ?R => [?R])
+    parts.map! { _1.scan(/\d+/).map &:to_i }
+
+    def p1(rules, values)
+      rules.each {
+        case _1
+        when ?A
+          return ?A
+        when ?R
+          return ?R
+        when /(.)(<|>)(\d+):(.+)/
+          i, v = "xmas".index($1), $3.to_i
+          return p1(W[$4], values) if $2[?<] ? values[i] < v : values[i] > v
+        else
+          return p1(W[_1], values)
+        end
+      }
+    end
+
+    def p2(rules, ranges)
+      current, *rest = rules
+
+      case current
+      when ?A
+        ranges.map(&:size).reduce :*
+      when ?R
+        0
+      when /(.)(<|>)(\d+):(.+)/
+        i, v = "xmas".index($1), $3.to_i
+
+        r, left, right = ranges[i], ranges.dup, ranges.dup
+        left[i] = $2[?<] ? r.begin..v-1 : v+1..r.end
+        right[i] = $2[?<] ? v..r.end : r.begin..v
+
+        p2(W[$4], left) + p2(rest, right)
+      else
+        p2(W[current], ranges)
+      end
+    end
+
+    p parts.sum { p1(W["in"], _1)[?A] ? _1.sum : 0 }
+    p p2(W["in"], [1..4000] * 4)

data/data/solutions/github/ZogStriP/2023/20_1.yml

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

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

@@ -0,0 +1,52 @@
+---
+- :name: 20_pulse_propagation.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    M, S, T = {}, {}, {}
+
+    DATA.each {
+      name, targets = _1.chomp.split(" -> ")
+      type = name[0].to_sym
+      name = name["broadcaster"] ? name : name[1..]
+
+      M[name] = type
+      T[name] = targets.split(", ")
+      S[name] = type == :& ? {} : false
+    }
+
+    T.each { |src, targets|
+      targets.each { M[_1] == :& && S[_1][src] = false }
+    }
+
+    rx_src = T.find { _2.include? "rx" }[0]
+    H = S[rx_src].keys.to_h { [_1, nil] }
+
+    P = { true => 0, false => 0 }
+
+    1.step { |pushes|
+      q = [["button", false, "broadcaster"]]
+
+      p P[true] * P[false] if pushes == 1000
+
+      while c = q.shift
+        src, pulse, dst = c
+
+        P[pulse] += 1
+
+        H[dst] ||= pushes if H.has_key?(dst) && !pulse
+        (p H.values.reduce &:lcm; exit) if H.values.all?
+
+        case M[dst]
+        when :b
+          T[dst].each { q << [dst, pulse, _1] }
+        when :%
+          next if pulse
+          S[dst] = !S[dst]
+          T[dst].each { q << [dst, S[dst], _1] }
+        when :&
+          S[dst][src] = pulse
+          pulse = !S[dst].values.all?
+          T[dst].each { q << [dst, pulse, _1] }
+        end
+      end
+    }

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

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

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

@@ -0,0 +1,40 @@
+---
+- :name: 21_step_counter.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    M = DATA.map &:chomp
+    Y, X = M.size, M[0].size
+    N = [[-1, 0], [0, -1], [0, 1], [1, 0]]
+
+    M.each_with_index { |l, y|
+      l.each_char.with_index { |c, x|
+        S = [y, x] if c[?S]
+      }
+    }
+
+    t, x0 = 26_501_365.divmod X
+    x1 = x0 + X
+    x2 = x1 + X
+
+    q = [S]
+    s = Set.new
+    r = Array.new(x2 + 1, 0)
+
+    (1..x2).each { |d|
+      q = q.flat_map { |y, x|
+        N.filter_map { |dy, dx|
+          n = ny = y + dy, nx = x + dx
+          s.add?(n) && !M[ny % Y][nx % X][?#] && n
+        }
+      }
+      r[d] = q.size + r[d - 2]
+    }
+
+    p r[64]
+
+    y0, y1, y2 = r[x0], r[x1], r[x2]
+
+    vel = y1 - y0
+    acc = y2 - 2 * y1 + y0
+
+    p y0 + (vel * t) + (acc * t * (t - 1) / 2)

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

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

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

@@ -0,0 +1,35 @@
+---
+- :name: 22_sand_slabs.rb
+  :url: https://github.com/ZogStriP/adventofcode-old/blob/master/2023
+  :solution: |-
+    bricks = DATA.map { _1.scan(/\d+/).map &:to_i }.sort_by { _1[2] }
+
+    def all(x1, y1, z1, x2, y2, z2) = [*x1..x2].product([*y1..y2], [*z1..z2])
+
+    grid = bricks.flat_map { |b| all(*b).map { |x, y, z| [[x, y, z], b] } }.to_h
+
+    bricks.each { |b|
+      while b[2] > 1
+        points = all(*b)
+        break if points.any? { |x, y, z| grid[[x, y, z - 1]] && grid[[x, y, z - 1]] != b }
+        points.each { |x, y, z| grid.delete([x, y, z]); grid[[x, y, z - 1]] = b }
+        b[2] -= 1
+        b[5] -= 1
+      end
+    }
+
+    above = bricks.to_h { |b| [b, all(*b).map { |x, y, z| grid[[x, y, z + 1]] if grid[[x, y, z + 1]] && grid[[x, y, z + 1]] != b }.compact.to_set] }
+    below = bricks.to_h { |b| [b, all(*b).map { |x, y, z| grid[[x, y, z - 1]] if grid[[x, y, z - 1]] && grid[[x, y, z - 1]] != b }.compact.to_set] }
+
+    p bricks.count { |b| above[b].all? { below[_1].size > 1 } }
+
+    p bricks.sum { |b|
+      fallen = [b].to_set
+      q = above[b].to_a
+
+      while c = q.shift
+        below[c].all? { fallen.include?(_1) } && fallen.add?(c) && q += above[c].to_a
+      end
+
+      fallen.size - 1
+    }

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

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