advent-2022 VS a2tools

Rust. I did hardcode how edges fold in part 2. I made a visualisation tool, which helped me check the folds were at the right spot, ran the code and it worked first try! Compared to the other days, I didn’t focused on speed, but it still runs in less than 1ms. Edit: GitHub https://github.com/baptistemanson/advent-2022/blob/master/src/day22.rs

Rust in 2ms for both parts: https://github.com/baptistemanson/advent-2022/blob/master/src/day17.rs

Here's the code: https://github.com/colinleroy/aoc2022/blob/master/a2tools/src/aoc/day23/day23.c

I only did part 1 tonight, somebody's literarlly doing Redditor wife at the office door.

Here's the (awful) code (it was less awful at the beginning when I didn't have to shrink everything to struct arrays with members have multiple purposes)

Well. I suck at doubly-linked lists so I shift one position at a time. This is quite a number of CPU cycles, but it's going to be quite a number of cycles anyway so let's leave it at that and spend the evening doing something else!

Here it is :)

I didn't do part 2 yet.

I'm stopping at part 1 because I guess part 2 would take days even if I figure out a good algorithm. Here's the code.

Quite happy with my solution for part 1, it runs in under a minute on the //c.

The night, for part 2. But the Apple 2 screen's not wide enough to use the hgr page as memory, so I need an array, but also there's not enough main ram to store char[350][170]... So I use this and it is slow (I should be able to improve it quite a bit though) https://github.com/colinleroy/aoc2022/blob/master/a2tools/src/lib/bool_array.c

So off we go read the input file twice, the first time to get the map boundaries, the second time to setup the bool array : part 1 using 2kB of RAM.