magical
074a6e3721
day 19 note
2024-12-19 08:10:58 +00:00
magical
d6b6bb979e
day 19 part 2
2024-12-19 05:49:57 +00:00
magical
f1ed65a6d9
day 19 part 1
2024-12-19 05:24:17 +00:00
magical
e57c5ecfd1
day 18 cleanup
2024-12-18 05:35:28 +00:00
magical
cc853a4dcd
day 18 part 2
2024-12-18 05:28:30 +00:00
magical
16637ab722
day 18 part 1
2024-12-18 05:19:25 +00:00
magical
d1a2b1eeb1
day 17 generic† solution
...
† mostly, subject to a few broad assumptions
2024-12-17 16:38:38 +00:00
magical
7fcfd8fcb6
day 17
2024-12-17 06:43:51 +00:00
magical
96f25dee8b
day 16
...
hello A* my old friend
2024-12-16 05:38:18 +00:00
magical
89b317c60d
day 15 part 2
2024-12-15 05:52:36 +00:00
magical
c9e55ade7d
day 15 part 1
2024-12-15 05:52:21 +00:00
magical
b6512dc6c1
day 14 ivy solution
2024-12-15 04:20:55 +00:00
magical
0247ce727a
day 14 cleanup
2024-12-14 06:18:18 +00:00
magical
35312d30d8
day 14 part 2
2024-12-14 06:00:19 +00:00
magical
7030b4529d
day 14 part 1
2024-12-14 05:19:02 +00:00
magical
7cc13becde
day 13 actually numpy is fine
2024-12-13 05:51:06 +00:00
magical
1c7035d433
day 13 cleanup
2024-12-13 05:41:12 +00:00
magical
4000af8bf3
day 13
2024-12-13 05:31:25 +00:00
magical
54c84304aa
day 12 part 2
2024-12-12 05:42:20 +00:00
magical
1b49b24aa1
day 12 part 1
2024-12-12 05:32:56 +00:00
magical
eec175943e
day 11 part 2
2024-12-11 05:29:55 +00:00
magical
0e13af40c5
day 11 part 1
2024-12-11 05:12:00 +00:00
magical
ad6279089f
day 10 optimizations
...
- reduce duplicate queue entries by not appending to the queue if a
point has a nonzero count. (if there's a count then it must have
already been queued.)
- use the correct data structure for a double-ended queue so pop(0) has
less work to do
- factor out the list of summits
of these three changes, only the last one has any noticable effect
on the run time. 🤷
2024-12-10 05:49:48 +00:00
magical
4634b831ea
remove unused samples
2024-12-10 05:42:31 +00:00
magical
984d92dd6e
day 10
2024-12-10 05:42:13 +00:00
magical
484491426d
day 9 part 2
...
it seemed easier to go for a sparse implementation than try to make the
dense implementation from part 1 work
2024-12-09 17:46:27 +00:00
magical
f0eff608ae
day 9 part 1
2024-12-09 05:32:15 +00:00
magical
7e2e395314
day 8
2024-12-08 05:20:33 +00:00
magical
7373859412
day 7 optimization
...
instead of lists, construct a tower of nested generators. i think this
is equivalent to a recursive backtracking solution.
since the input doesn't contain 0 we can check for <goal in the
intermediate layers, and ==goal at the end.
2024-12-07 21:02:18 +00:00
magical
9e083f00f9
day 7
2024-12-07 05:43:17 +00:00
magical
ece6ff1139
day 6 reduce state size
2024-12-06 05:51:15 +00:00
magical
67cd627138
day 6 part 2
2024-12-06 05:49:05 +00:00
magical
c40379371e
day 6 part 1
2024-12-06 05:19:41 +00:00
magical
ba3639a098
day 5 cleanup
2024-12-05 08:11:46 +00:00
magical
eeff5e846c
day 5 part 2
2024-12-05 08:07:02 +00:00
magical
ccc463cf17
day 5 part 1
2024-12-05 07:52:55 +00:00
magical
7f8e50b15f
ignore executables
2024-12-04 07:29:50 +00:00
magical
babad98e13
update cron.sh
2024-12-04 07:29:11 +00:00
magical
6012f7757c
day 4 part 2
2024-12-04 07:27:10 +00:00
magical
5cb39af7b8
day 4 part 1
2024-12-04 06:19:26 +00:00
magical
1ea972f4f2
day 3
2024-12-03 06:09:30 +00:00
magical
d610807879
day 2
2024-12-02 05:23:17 +00:00
magical
a2143ba7ae
day 1 ivy solution
2024-12-02 03:56:40 +00:00
magical
f85cbb1539
day 1
2024-12-02 03:40:57 +00:00
magical
02ba7c97f9
initial commit
2024-12-02 01:22:03 +00:00
magical