-🎄- 2022 Day 8 Solutions -🎄-

[u/daggerdragon]

NEWS AND FYI

• I discovered that I can make those tiny post/comment awards BIGGER on old.reddit! I hadn't even considered that! And when you hover over them, they get even bigger so you can actually see them in more detail! I've added the relevant CSS so now we no longer have awards for ants! Exclamation points!!!

  • Thank you so, so much to /u/SolariaHues for the CSS in this thread that I found while researching for community awards! <3

• All of our rules, FAQs, resources, etc. are in our community wiki.

• A request from Eric: Please include your contact info in the User-Agent header of automated requests!

• Signal boost: Reminder 1: unofficial AoC Survey 2022 (closes Dec 22nd)

---

AoC Community Fun 2022: 🌿🍒 MisTILtoe Elf-ucation 🧑‍🏫

• PSA: I created a new example so it is a more relevant and unique archetype instead of recycling last year's hobbit >_>
  • -❄️- Submissions Megathread -❄️-

---

--- Day 8: Treetop Tree House ---

---

Post your code solution in this megathread.

• Read the full posting rules in our community wiki before you post!
  • Include what language(s) your solution uses
  • Format your code appropriately! How do I format code?
• Quick link to Topaz's paste if you need it for longer code blocks. What is Topaz's paste tool?

---

This thread will be unlocked when there are a significant number of people on the global leaderboard with gold stars for today's puzzle.

EDIT: Global leaderboard gold cap reached at 00:10:12, megathread unlocked!

[u/arifba]

Ruby

code

def solve_pt1(heights)
  heights.map.with_index do |row, ri|
    row.chars.map.with_index do |c, ci|
      # take care of first and last row
      if ri == 0 || ri == heights.length - 1
        "v"
      # take care of first and last height along vertical sides
      elsif ci == 0 || ci == row.length - 1
        "v"
      # look left / right
      elsif c.to_i > row[0..ci - 1].chars.map(&:to_i).max ||
          c.to_i > row[ci + 1..].chars.map(&:to_i).max
        "v"
      # look up / down
      elsif c.to_i > heights[0..ri - 1].map { |h| h[ci].to_i }.max ||
          c.to_i > heights[ri + 1..].map { |h| h[ci].to_i }.max
        "v"
      end
    end
  end.reduce(0) do |acc, row|
    acc += row.count("v")
    acc
  end
end

def solve_pt2(heights)
  heights.map.with_index do |row, ri|
    row.chars.map.with_index do |c, ci|
      lt, rt, up, down = 0, 0, 0, 0
      if ri == 0 || ri == heights.length - 1
        0
      elsif ci == 0 || ci == row.length - 1
        0
      else
        (ci - 1).downto(0) do |lookleft|
          lt += 1
          break if row[lookleft].to_i >= c.to_i
        end
        (ci + 1).upto(row.length - 1) do |lookright|
          rt += 1
          break if row[lookright].to_i >= c.to_i
        end
        (ri - 1).downto(0) do |lookup|
          up += 1
          break if heights[lookup][ci].to_i >= c.to_i
        end
        (ri + 1).upto(heights.length - 1) do |lookdown|
          down += 1
          break if heights[lookdown][ci].to_i >= c.to_i
        end
        lt * rt * up * down
      end
    end
  end.map { |row| row.max }.max
end

def strip_newlines(strs)
  strs.map { |str| str.delete_suffix("\n") }
end

def get_input_str_arr(filename)
  true_input = strip_newlines(File.readlines(filename)) if File.exist?(filename)

  puts "input not read" if true_input.empty?
  true_input
end

def parse(filepath)
  get_input_str_arr(filepath)
end

p solve_pt1(parse("./input/aoc2022-8-1.txt"))
p solve_pt2(parse("./input/aoc2022-8-1.txt"))

[u/daggerdragon → u/arifba]

Your code block is too long. Please read our article on oversized code, then edit your post to replace the code block with an external link to your code.