-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathday_20.ex
56 lines (46 loc) · 1.5 KB
/
day_20.ex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
defmodule AdventOfCode.Y2020.Day20 do
@moduledoc """
--- Day 20: Jurassic Jigsaw ---
Problem Link: https://adventofcode.com/2020/day/20
"""
alias AdventOfCode.Helpers.{InputReader, Transformers}
def input, do: InputReader.read_from_file(2020, 20)
def run(input \\ input()) do
input = parse(input)
{product(corners(input)), {:todo, 2}}
end
def parse(input), do: input |> String.split(~r{(\r\n\r\n|\r\r|\n\n)}) |> Map.new(&parse_tiles/1)
defp parse_tiles(tile) do
[id | tiles] = tile |> Transformers.lines()
{extract_id(id), edges(Enum.map(tiles, &String.graphemes/1))}
end
@regex ~r/Tile (?<id>\d+):/
defp extract_id(id), do: Regex.named_captures(@regex, id)["id"]
defp product(ids), do: Enum.reduce(Enum.map(ids, &String.to_integer/1), &(&1 * &2))
defp edges(tiles) do
transposed = Transformers.transpose(tiles)
Enum.map(
[hd(tiles), List.last(tiles), hd(transposed), List.last(transposed)],
fn edge -> MapSet.new([Enum.join(edge), Enum.join(Enum.reverse(edge))]) end
)
end
defp corners(data), do: Enum.reject(find_unique(all_edges(data), data), &is_nil/1)
defp all_edges(data) do
data
|> Map.values()
|> Enum.flat_map(& &1)
|> Enum.frequencies()
|> Map.filter(fn {_, c} -> c == 1 end)
|> Map.keys()
|> MapSet.new()
end
defp find_unique(edges, tiles) do
tiles
|> Enum.map(fn {k, v} ->
case Enum.count(MapSet.intersection(MapSet.new(v), edges)) do
2 -> k
_ -> nil
end
end)
end
end