From 571f8cb385a0888d6a3c195040d33bb4be891c02 Mon Sep 17 00:00:00 2001 From: DJ O'Leary Date: Thu, 4 Dec 2025 01:48:06 +0100 Subject: feat(2025d2p2): solve 2025 day 2 part 2 --- 2025/ocaml/lib/application/d02p02.ml | 70 +++++++++++++++++++++++++++--------- 1 file changed, 53 insertions(+), 17 deletions(-) (limited to '2025/ocaml/lib/application/d02p02.ml') diff --git a/2025/ocaml/lib/application/d02p02.ml b/2025/ocaml/lib/application/d02p02.ml index c936b28..29e3877 100644 --- a/2025/ocaml/lib/application/d02p02.ml +++ b/2025/ocaml/lib/application/d02p02.ml @@ -1,41 +1,77 @@ open Domain.D02p02 +(* Logging *) + +(** [passthrough_with_logs logger lst] is [lst] with the side-effects caused by calling [logger] on [lst]. *) +let passthrough_with_logs logger lst = logger lst ; lst + (** [input_to_lines input] is a list of strings that have been split on ','. Example: [input_to_lines "12-34,56-78,90-100"] becomes the list \[ "12-34"; "56-78"; "90-100" \]. Requires: [input] to be a string in the format "12-34,56-78,90-100". *) let input_to_lines input = input |> String.trim |> String.split_on_char ',' -let pp_lines = List.iter (fun l -> Logs.debug (fun m -> m "line=%s" l)) +let pp_lines = Seq.iter (fun l -> Logs.debug (fun m -> m "line=%s" l)) + +let pp_ranges = Seq.iter (fun r -> Logs.debug (fun m -> m "%s" (Range.pp r))) + +let pp_collection = Seq.iter (fun c -> Logs.debug (fun m -> m "%s" (ID.pp c))) + +(* Core Logic *) (** [lines_to_ranges line] is a list of [Range]s found on [line]. *) let lines_to_ranges = - List.map (fun line -> + Seq.map (fun line -> Scanf.sscanf line "%d-%d" (fun id1 id2 -> Range.create (id1, id2)) ) -let pp_ranges = List.iter (fun r -> Logs.debug (fun m -> m "%s" (Range.pp r))) - (** [collect_all ranges] is an unsorted list of [ID]s within the [ranges] (inclusive). *) -let collect_all = List.concat_map (fun range -> Range.collect range) +let collect_all = + Seq.concat_map (fun range -> List.to_seq (Range.collect range)) -let pp_collection = List.iter (fun c -> Logs.debug (fun m -> m "%s" (ID.pp c))) +(** [string_to_segments count string] is a list containing [count] string segments with of equal length. + Requires: length of [string] to be divisible by [count] + and [count] to be greater than or equal to zero *) +let rec string_to_segments s = + let segment_lengths = possible_segment_lengths s in + List.map (fun c -> string_to_segments_aux [] c s |> List.rev) segment_lengths -(** [rules] is a list of rules that denotes any ID returning true from ANY as invalid. *) -let rules = [ - (** a subset of the digits of the whole number up to len/2 is equal to segments of equal length of the remaining string *) -] +(** [possible_segment_lengths s] is a list of segment sizes that fit within [s] + that must be checked to rule out a repeating pattern. *) +and possible_segment_lengths s = + List.init (String.length s) (fun x -> x + 1) + |> List.filter (fun x -> x != 1 && String.length s mod x = 0) -(** [is_invalid id] is [true] for an [id] that passes all of the rules and is considered invalid. *) -let is_invalid = ID.validate rules +and string_to_segments_aux segments count string = + match List.length segments = count with + | true -> + segments + | false -> + let segment_start = String.length string / count * List.length segments in + let segment_len = String.length string / count in + string_to_segments_aux + (String.sub string segment_start segment_len :: segments) + count string -(** [passthrough_with_logs logger lst] is [lst] with the side-effects caused by calling [logger] on [lst]. *) -let passthrough_with_logs logger lst = logger lst ; lst +(** [cmp_segments segments] is true is all segments are equal *) +let cmp_segments segments = + List.length (List.sort_uniq String.compare segments) = 1 + +(** [is_invalid id] is [true] for an [id] that is considered invalid. *) +let is_invalid id = + Logs.debug (fun m -> m "CHECKING ID=%s" id) ; + let repeating_patterns = + id |> string_to_segments |> List.filter cmp_segments + in + List.iter + (fun l -> Logs.debug (fun m -> m "HAS SUBPATTERN=%s" (List.hd l))) + repeating_patterns ; + List.length repeating_patterns > 0 let solve input () = - input |> input_to_lines + input |> input_to_lines |> List.to_seq |> passthrough_with_logs pp_lines |> lines_to_ranges |> passthrough_with_logs pp_ranges |> collect_all |> passthrough_with_logs pp_collection - |> List.filter is_invalid - |> List.fold_left (fun acc id -> acc + ID.to_int id) 0 + |> Seq.map ID.to_string |> Seq.filter is_invalid + |> Seq.fold_left (fun acc id -> acc + int_of_string id) 0 -- cgit v1.2.3