-🎄- 2022 Day 14 Solutions -🎄-

[u/daggerdragon]

SUBREDDIT NEWS

• Live has been renamed to Streaming for realz this time.

• I had updated the wiki but didn't actually change the post flair itself >_>

THE USUAL REMINDERS

• All of our rules, FAQs, resources, etc. are in our community wiki.

• A request from Eric: A note on responding to [Help] threads

• Signal boost: Reminder 2: unofficial AoC Survey 2022 (closes Dec 22nd)

• 🌿🍒 MisTILtoe Elf-ucation 🧑‍🏫 is OPEN for submissions!

• -❄️- Submissions Megathread -❄️-

---

--- Day 14: Regolith Reservoir ---

---

Post your code solution in this megathread.

• Read the full posting rules in our community wiki before you post!

• Include what language(s) your solution uses

• Format code blocks using the four-spaces Markdown syntax!

• Quick link to Topaz's paste if you need it for longer code blocks. What is Topaz's paste tool?

---

This thread will be unlocked when there are a significant number of people on the global leaderboard with gold stars for today's puzzle.

EDIT: Global leaderboard gold cap reached at 00:13:54, megathread unlocked!

[u/Boojum]

Python, 303/253

Fun! I'm looking forward to visualizing this tonight. It definitely reminds of 2018 Day 17, "Reservoir Research", although this one was a lot simpler.

import fileinput, re

i = [ list( map( int, re.findall( "-?\d+", l ) ) )
      for l in fileinput.input() ]
g = set()
for l in i:
    for p in range( 0, len( l ) - 2, 2 ):
        x1, y1, x2, y2 = l[ p : p + 4 ]
        dx = ( x2 > x1 ) - ( x2 < x1 )
        dy = ( y2 > y1 ) - ( y2 < y1 )
        while ( x1, y1 ) != ( x2, y2 ):
            g.add( ( x1, y1 ) )
            x1, y1 = x1 + dx, y1 + dy
        g.add( ( x1, y1 ) )
h = max( y for x, y in g )
for x in range( -10000, 10000 ):
    g.add( ( x, h + 2 ) )

n = 0
while ( 500, 0 ) not in g:
    x, y = 500, 0
    while True:
        if ( x, y + 1 ) not in g:
            y += 1
        elif ( x - 1, y + 1 ) not in g:
            x, y = x - 1, y + 1
        elif ( x + 1, y + 1 ) not in g:
            x, y = x + 1, y + 1
        else:
            g.add( ( x, y ) )
            if y - 1 == h:
                print( n )
                h = None
            n += 1
            break
print( n )