Mercurial > repos > other > adventofcode2023
view day4b.rb @ 21:46fb65f2cb94
Add Day 14 part 1 implementation
If you look at columns and see "how far can this go" then the
weight is just the sum of the partial triangle numbers of
highest_weight to highest_weight minus number of rocks that
can roll up to there.
Part 2 seems to involve actually moving the rocks, though!
author | IBBoard <dev@ibboard.co.uk> |
---|---|
date | Sat, 16 Dec 2023 10:29:36 +0000 |
parents | 9da7a71b313d |
children |
line wrap: on
line source
#! /usr/bin/env ruby require 'set' 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] # Ruby arrays auto-magically grow when you set any index! card_counts = Array.new def add(array, index, value) array[index].nil? ? value : array[index] + value end sum = 0 File.open(file, "r").each_line(chomp: true).with_index do |line, index| card_counts[index] = add(card_counts, index, 1) card_count = card_counts[index] winning_number_str, our_number_str = line.split(":")[1].split("|").map(&:chomp) winning_numbers = Set.new(winning_number_str.split(" ").map(&:to_i)) our_numbers = Set.new(our_number_str.split(" ").map(&:to_i)) our_winning_numbers = winning_numbers & our_numbers if our_winning_numbers.length > 0 # puts "Increase #{index + 1} to #{index + our_winning_numbers.length} by #{card_count}" # puts (1..our_winning_numbers.length) (1..our_winning_numbers.length).each {|v| card_counts[index + v] = add(card_counts, index + v, card_count)} end end #puts card_counts puts card_counts.sum puts sum