aoc2021 VS Advent-of-Code-2021

my rust solution:

my rust solution - runs in ~650ms. All it does is explore all possible move sequences that obey game rules. Ordered by increasing total cost.

Thanks! In the meantime, I was able to slash the runtime in half by using a faster hash (fxhash) for the cache.

Same here $ cargo run --release -- --skip-output Finished release [optimized + debuginfo] target(s) in 0.02s Running target/release/aoc21 --skip-output Day 01 took 10.008µs to compute (with i/o: 146.55µs) Day 02 took 9.355µs to compute (with i/o: 87.184µs) Day 03 took 82.134µs to compute (with i/o: 155.095µs) Day 04 took 52.834µs to compute (with i/o: 240.457µs) Day 05 took 673.742µs to compute (with i/o: 776.801µs) Day 06 took 1.306µs to compute (with i/o: 7.122µs) Day 07 took 33.248µs to compute (with i/o: 55.737µs) Day 08 took 984.71µs to compute (with i/o: 1.00838ms) Day 09 took 883.739µs to compute (with i/o: 922.913µs) Day 10 took 19.062µs to compute (with i/o: 126.791µs) Day 11 took 398.191µs to compute (with i/o: 400.35µs)

rust

my rust day9:

my rust solution for day5:

I totally recommend trying - it's going to be a lot of fun and you'll understand the structure better. I'm not a pro and I never studied CS - that's just my experience from last year (day 18).

I keep a diary of what I learned, revised or improved at in my repo.

Python - needs over 45 seconds but WORKS, which is good enough for me after a couple of days, especially given the fact that I can spend at most 1-2 hours a day solving this... The ugliest part are probably the hard-coded distances from rooms to corridors and vice versa, but what the heck, it works.

For reference, here's my work-in-progress code (Python). But most imporatntly I want to describe my line of thinking :

As a complete hobbyist, I was glad I figured out this had something to do with binary trees. It took about an hour to design everything on paper. Then I started to code it...and then debug...and four hours later I finally arrived at this solution.

Python

I'm not sure what kind of brainfog descended on me this morning. After part 1 I instantly knew I should just count the pairs and update their numbers but somehow couldn't figure out how to do it. It took me almost an hour before it dawned on me that...wait for it...a pair splits into two pairs. After that and some off-by-one debugging I came up with this solution. Defaultdict for the win.

Python - two alternative solutions (lines 25-65 and 68-106, not including the parser)

This is not my first visualisation but for the first time I decided to share one here. It looks worse on screen due to flickering (I print the board and clear the screen after each step). Here's the code.

Anyway, here's my stack-based Python solution. It could be made way shorter because there's actually no need to store data separately about valid lines (valid == not corrupt and empty stack), but I thought the verbose approach makes the solution a bit more understandable.