|
| 1 | +import gleam/int |
| 2 | +import gleam/io |
| 3 | +import gleam/list |
| 4 | +import gleam/result |
| 5 | +import gleam/string |
| 6 | +import internal/aoc_utils |
| 7 | + |
| 8 | +pub fn main() { |
| 9 | + let filename = "inputs/day05.txt" |
| 10 | + |
| 11 | + let lines_result = aoc_utils.read_lines(from: filename) |
| 12 | + case lines_result { |
| 13 | + Ok(lines) -> { |
| 14 | + // If the file was converting into a list of lines |
| 15 | + // successfully then run each part of the problem |
| 16 | + aoc_utils.run_part_and_print("Part 1", fn() { solve_p1(lines) }) |
| 17 | + aoc_utils.run_part_and_print("Part 2", fn() { solve_p2(lines) }) |
| 18 | + } |
| 19 | + Error(_) -> io.println("Error reading file") |
| 20 | + } |
| 21 | +} |
| 22 | + |
| 23 | +// Part 1 |
| 24 | +pub fn solve_p1(lines: List(String)) -> Result(String, String) { |
| 25 | + let #(ranges, values) = parse_input(lines) |
| 26 | + |
| 27 | + values |
| 28 | + |> list.filter(fn(val) { |
| 29 | + list.fold_until(ranges, False, fn(_, range) { |
| 30 | + case val >= range.0 && val <= range.1 { |
| 31 | + True -> list.Stop(True) |
| 32 | + False -> list.Continue(False) |
| 33 | + } |
| 34 | + }) |
| 35 | + }) |
| 36 | + |> list.length |
| 37 | + |> int.to_string |
| 38 | + |> Ok |
| 39 | +} |
| 40 | + |
| 41 | +// Part 2 |
| 42 | +pub fn solve_p2(lines: List(String)) -> Result(String, String) { |
| 43 | + let #(ranges, _) = parse_input(lines) |
| 44 | + |
| 45 | + merge_overlaps(ranges) |
| 46 | + |> list.map(fn(range) { range.1 - range.0 + 1 }) |
| 47 | + |> int.sum |
| 48 | + |> int.to_string |
| 49 | + |> Ok |
| 50 | +} |
| 51 | + |
| 52 | +fn parse_range(line: String) -> Result(#(Int, Int), Nil) { |
| 53 | + use string_vals <- result.try(string.split_once(line, "-")) |
| 54 | + |
| 55 | + use first <- result.try(int.parse(string_vals.0)) |
| 56 | + use second <- result.try(int.parse(string_vals.1)) |
| 57 | + |
| 58 | + Ok(#(first, second)) |
| 59 | +} |
| 60 | + |
| 61 | +fn parse_input(lines: List(String)) -> #(List(#(Int, Int)), List(Int)) { |
| 62 | + let #(range_part, rest) = list.split_while(lines, fn(l) { l != "" }) |
| 63 | + |
| 64 | + let value_part = list.drop(rest, 1) |
| 65 | + |
| 66 | + let assert Ok(ranges) = |
| 67 | + range_part |
| 68 | + |> list.map(parse_range) |
| 69 | + |> result.all |
| 70 | + |
| 71 | + let assert Ok(values) = value_part |> list.map(int.parse) |> result.all |
| 72 | + |
| 73 | + #(ranges, values) |
| 74 | +} |
| 75 | + |
| 76 | +fn merge_overlaps(ranges: List(#(Int, Int))) -> List(#(Int, Int)) { |
| 77 | + ranges |
| 78 | + |> list.sort(fn(ra, rb) { int.compare(ra.0, rb.0) }) |
| 79 | + |> merge_sorted_overlaps([]) |
| 80 | +} |
| 81 | + |
| 82 | +fn merge_sorted_overlaps( |
| 83 | + remain: List(#(Int, Int)), |
| 84 | + complete: List(#(Int, Int)), |
| 85 | +) -> List(#(Int, Int)) { |
| 86 | + case remain { |
| 87 | + [] -> complete |
| 88 | + [range] -> [range, ..complete] |
| 89 | + [current, next, ..rest] -> { |
| 90 | + let #(current_start, current_end) = current |
| 91 | + let #(next_start, next_end) = next |
| 92 | + |
| 93 | + case next_start <= current_end, next_end <= current_end { |
| 94 | + True, True -> merge_sorted_overlaps([current, ..rest], complete) |
| 95 | + True, False -> |
| 96 | + merge_sorted_overlaps([#(current_start, next_end), ..rest], complete) |
| 97 | + False, True -> panic as "ranges are not in order" |
| 98 | + False, False -> |
| 99 | + merge_sorted_overlaps([next, ..rest], [current, ..complete]) |
| 100 | + } |
| 101 | + } |
| 102 | + } |
| 103 | +} |
0 commit comments