Day 5: If You Give a Seed a Fertilizer


Megathread guidelines

  • Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
  • Code block support is not fully rolled out yet but likely will be in the middle of the event. Try to share solutions as both code blocks and using something such as https://topaz.github.io/paste/ , pastebin, or github (code blocks to future proof it for when 0.19 comes out and since code blocks currently function in some apps and some instances as well if they are running a 0.19 beta)

FAQ

  • What is this?: Here is a post with a large amount of details: https://programming.dev/post/6637268
  • Where do I participate?: https://adventofcode.com/
  • Is there a leaderboard for the community?: We have a programming.dev leaderboard with the info on how to join in this post: https://programming.dev/post/6631465

🔒This post will be unlocked when there is a decent amount of submissions on the leaderboard to avoid cheating for top spots

🔓 Unlocked after 27 mins (current record for time, hard one today)

  • morrowind@lemmy.ml
    ·
    11 months ago

    CRYSTAL

    finally solved part 2, and in just 1 second :)))

    Input = File.read("input.txt").lines
    
    # {source, destination}
    alias Map = Tuple(Range(Int64, Int64), Range(Int64, Int64))
    
    Maps = Array(Array(Map)).new(7)
    index = 1
    7.times do |i| 
    	a, index = get_ranges(index + 2)
    	Maps << a
    end
    
    part2
    # part1
    
    def part1()
    	seeds = Input[0].split(":")[1].split.map(&.to_i64)
    	locs = Array(Int64).new(7)
    	
    	seeds.each do |seed|
    		val = seed
    		Maps.each do |maplist|
    			maplist.each do |map|
    				if map[0].includes?(val)
    					val = map[1].begin + (val - map[0].begin)
    					break
    		end     end     end
    		locs << val
    	end
    	puts locs.min
    end
    
    def part2()
    	seeds = Input[0].split(":")[1].split.map(&.to_i64)
    	seeds = seeds.in_groups_of(2, 0).map { |a| a[0]..(a[0]+a[1]) }
    
    	found = false
    	loc = 0
    	until found 
    		val = loc
    		Maps.reverse_each do |maplist|
    			maplist.each do |map|
    				if map[1].includes?(val)
    					val = map[0].begin + (val - map[1].begin)
    					break
    		end     end     end
    
    		seeds.each { |seedrange| break if found = seedrange.includes?(val) }
    		loc += 1
    	end
    	puts loc - 1
    end
    
    def get_ranges(index : Int) : {Array(Map), Int32}
    	line = Input[index]
    	ranges = [] of Map
    	until line == ""
    		a, b, l = line.split.map(&.to_i64)
    		ranges << {b...(b+l), a...(a+l)}
    		
    		index += 1
    		break if index == Input.size
    		line = Input[index]
    	end
    	{ranges, index}
    end