Mercurial > repos > other > adventofcode2023
view day6b.rb @ 33:676461cc3a70
Day 23 - track segments, not each space
This allows us to explore the branches once then do quicker calculations
for valid route lengths. But still requires exploring 1,262,816 routes
to find the longest!
author | IBBoard <dev@ibboard.co.uk> |
---|---|
date | Thu, 04 Jan 2024 14:52:24 +0000 |
parents | 6e0615e54e71 |
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] time, distance = File.open(file, "r").each_line(chomp: true).map {|v| v.split(":")[1].split(" ").join("").to_i} events = [[time, distance]] product = events.map do |event| mid = (event[0].to_f / 2).floor first_success = (1..mid).bsearch {|i| (event[0] - i) * i > event[1]} num_success = (mid - first_success + 1) * 2 event[0].odd? ? num_success : num_success - 1 end.reduce(:*) puts product