view day2b.rb @ 32:a1b748f2c416

Implement day 23 "longest route finding" Allows for "downhill only" and "can climb" approaches. But climbing still brute-forces the map and takes too long on the final input.
author IBBoard <dev@ibboard.co.uk>
date Thu, 04 Jan 2024 11:18:56 +0000
parents 49dd1ae93696
children
line wrap: on
line source

#! /usr/bin/env ruby

if ARGV.length != 1
        abort("Incorrect arguments - needs input file")
elsif not File.exist? (ARGV[0])
	abort("File #{ARGV[0]} did not exist")
end

file = ARGV[0]

sum = 0
File.open(file, "r").each_line do |line|
	_, all_picks = line.split(":")
	sum += all_picks.split(";").map do |pick|
		pick.split(",").to_h { |colour_pick| colour_pick.strip.split(" ").reverse }.transform_values(&:to_i)
	end.reduce(Hash.new) {|reduced,obj| reduced.merge(obj) { |key,val1,val2| val1 > val2 ? val1 : val2 }}.values.reduce(1, :*)
end

puts sum