bjorng

Erlang Core Team

Advent of Code 2021 - Day 9

This topic is about Day 9 of the Advent of Code 2021 .

We have a private leaderboard (shared with users of Erlang Forums):

https://adventofcode.com/2021/leaderboard/private/view/370884

The entry code is:
370884-a6a71927

13 comments

#advent-of-code

7 2193 13

2021-12-19 06:57:34 UTC

Most Liked

bjorng

Erlang Core Team

I solved part two with a simple union-find algorithm. Since it finished in less than two seconds on my computer, I didn’t need to do any further optimizations.

github.com

bjorng/advent-of-code-2021/blob/49f0d8eff0110e6e5d823bf314236c6bf7dcc991/day09/lib/day09.ex

defmodule Day09 do
  def part1(input) do
    map = parse(input)
    Enum.reduce(map, 0, fn {coord, h}, acc ->
      nh = neighbors(map, coord)
      |> Enum.map(&(Map.fetch!(map, &1)))
      |> Enum.min
      if h < nh do
        acc + 1 + h
      else
        acc
      end
    end)
  end

  # Find the largest basin using a simple union-find algorithm.
  # The run time on my computer is less than 2 seconds.
  def part2(input) do
    map = parse(input)
    |> Enum.reject(fn {_key, value} -> value === 9 end)

This file has been truncated. show original

Post #2

deadbeef

For part two I did a sort-of breadth-first search (I think?). Feels a bit messy, but got the job done.
Also, felt my file’s a bit cruft-y with how many small functions I made, but was trying to make things reusable between parts.

github.com

ed-flanagan/advent-of-code-solutions-elixir/blob/main/lib/advent/y2021/d09.ex

defmodule Advent.Y2021.D09 do
  @moduledoc """
  https://adventofcode.com/2021/day/9
  """

  @typep point :: {non_neg_integer(), non_neg_integer()}
  @typep grid :: %{point() => non_neg_integer()}

  @doc """
  Find all of the low points on your heightmap. What is the sum of the risk
  levels of all low points on your heightmap?
  """
  @spec part_one(Enumerable.t()) :: non_neg_integer()
  def part_one(input) do
    grid = parse_input(input)

    grid
    |> find_low_points()
    |> Enum.map(&risk_level(grid, &1))
    |> Enum.sum()

This file has been truncated. show original

Post #3

wasi0013

Here’s my solution: y2021/day_09.ex
For part 2 used bfs

Post #4

Where Next?

View thread on forum (has 13 responses!)

advent-of-code

Home Learning Resources>Coding Challenges

#advent-of-code

7 2194 13

Last post

Advent of Code 2021 - Day 9

bjorng

Advent of Code 2021 - Day 9

Most Liked

bjorng

deadbeef

wasi0013

Where Next?

Popular in Challenges

Advent of Code 2020 - Day 8

Advent of Code 2021 - Day 8

Advent of Code 2021 - Day 12

Advent of Code 2020 - Day 14

Advent of Code 2020 - Day 1

Advent of Code 2023 - Day 14

Advent of Code 2023 - Day 5

Advent of Code 2024 - Day 5

Advent of Code 2024 - Day 6

Advent of Code 2020 - Day 10

Other popular topics

Dialyzer: suppress warning on a specific function

Elixir for Programmers (PragDave)

Phoenix v1.5.0 released!

Phoenix v1.3.0-rc.0 released

How do I kill a process ` #PID<0.186.0` in iex?

Surface - A component-based library for Phoenix LiveView

Mint vs Finch vs Gun vs Tesla vs HTTPoison etc

Updating structs: Map.put vs %Foo{oldfoo | new: value} vs put_in

Docker run Error loading shared library libstdc++.so.6 and libgcc_s.so.1

Starship (cross-shell prompt) error - (starship::utils): Executing command "elixir" timed out

Learning Resources>Coding Challenges

Latest on Elixir Forum

Sponsor Spotlight

Our Sponsors

Categories:

Sub Categories:

Forums

Our Sponsors

We're in Beta