bert/adventofcode
1
0
Fork 0
mirror of https://github.com/bertptrs/adventofcode.git synced 2025-12-25 21:00:31 +01:00
Code Issues Projects Releases Wiki Activity
578 Commits 5 Branches 0 Tags
33111615be20e9143409fbf6815affc7b1a36544
Commit Graph

93 Commits

Author SHA1 Message Date
Bert Peters
33111615be Directly infer matched pivot 2022-01-09 14:22:41 +01:00
Bert Peters
04e8a41d98 Use pre-matching strategy 
Ensure that both scanners to be matched have a set of enough distances
in common to avoid matching between groups that cannot possibly be
related.
 2022-01-08 19:50:16 +01:00
Bert Peters
36d76018ba Correct width calculation 
The original worked by accident
 2022-01-06 23:35:38 +01:00
Bert Peters
4172fd0463 Slightly more efficiently pre-allocate bitsets 2022-01-06 23:22:10 +01:00
Bert Peters
ad0b4a4659 Use running masks instead of computing one by one 2022-01-06 23:05:41 +01:00
Bert Peters
2dab7342f8 Replace sparse map with bitset 2022-01-06 22:52:57 +01:00
Bert Peters
edd14a0e3d Update to Clap 3.0.0! 2022-01-02 23:06:32 +01:00
Bert Peters
4d7188e1ff Replace hashset with bitset 2022-01-02 22:38:28 +01:00
Bert Peters
255edaca79 Implement day 24 2022-01-02 21:47:07 +01:00
Bert Peters
8ea716cba8 Properly use TryFrom 2022-01-02 18:49:25 +01:00
Bert Peters
601de2c565 Readability 2022-01-02 18:30:13 +01:00
Bert Peters
894524bc81 Implement part 2 
Turns out you can incorrectly implement the problem and still get the
right answer for part 1. If you then correct it, it's a lot faster.
 2022-01-02 18:28:04 +01:00
Bert Peters
f19bf28f34 Properly implemented A* estimate 2022-01-02 16:17:01 +01:00
Bert Peters
de3a24a87c Implementation day 23 2022-01-02 16:17:01 +01:00
Bert Peters
09b590e927 Update southbound comment 2021-12-29 15:39:20 +01:00
Bert Peters
9dacb4c1ae Perform updates in-place 2021-12-29 15:29:21 +01:00
Bert Peters
07e03c1630 Implement day 25 2021-12-29 15:09:43 +01:00
Bert Peters
3accf9845d Better code reuse, almost generic over dimensions 2021-12-29 14:19:58 +01:00
Bert Peters
fd26f58e25 Implement day 22 part 2 (and 1 again) 2021-12-29 14:07:52 +01:00
Bert Peters
b2f9898714 Reduce code duplication 2021-12-26 12:32:07 +01:00
Bert Peters
d757c389f0 Replace inefficient recursion with iteration 2021-12-26 11:24:45 +01:00
Bert Peters
fd561a3e9d Clippy suggestions 2021-12-22 21:16:27 +01:00
Bert Peters
2fcdc6b8d2 Brute force day 22 part 1 2021-12-22 21:12:15 +01:00
Bert Peters
8a3f0f843c Finally discovered that pos != new_pos 2021-12-22 20:36:58 +01:00
Bert Peters
23b5c39838 Add inputs day 21 2021-12-22 20:04:29 +01:00
Bert Peters
452f6e5f14 Implement fast day 21 part 1 2021-12-21 09:35:50 +01:00
Bert Peters
61fb240622 Avoid 2/3 hashmap lookups 2021-12-20 18:24:37 +01:00
Bert Peters
aee25057d6 Avoid allocations 2021-12-20 18:14:36 +01:00
Bert Peters
a98332894f Brute force implementation day 20 2021-12-20 18:08:48 +01:00
Bert Peters
09e012c082 Add input files day 18 2021-12-19 22:55:11 +01:00
Bert Peters
944d3e644a Filter out the worst repetition 2021-12-19 18:38:30 +01:00
Bert Peters
d56f4ae8f8 Implement part 2 with the same brute force 2021-12-19 18:33:24 +01:00
Bert Peters
53ca8d0043 Implement day 19 part 1 
By brute force and lots of it
 2021-12-19 18:16:56 +01:00
Bert Peters
6506af879a Simplify y-hit iterator 2021-12-18 18:15:11 +01:00
Bert Peters
101ebee505 Use dedicated iterator instead of range 2021-12-18 18:15:11 +01:00
Bert Peters
cc81a7012b Use math instead of binary search 2021-12-18 17:21:43 +01:00
Bert Peters
9c299f140c Tighter bounds for the range of y 2021-12-18 15:01:47 +01:00
Bert Peters
ba1b7b693e Use reusable parser wrapper more 2021-12-18 14:54:05 +01:00
Bert Peters
7d331f9131 Implement day 18 2021 2021-12-18 14:46:27 +01:00
Bert Peters
dfd8b2b985 Partially smart, partially brute-force day 17 2021-12-17 10:04:36 +01:00
Bert Peters
0f6167e90f Merge common parts of parsers 2021-12-16 19:26:10 +01:00
Bert Peters
3e2a3f5206 Avoid allocating and tracking bits manually 2021-12-16 19:12:34 +01:00
Bert Peters
8cc2245492 Optimize hex parser 2021-12-16 18:46:19 +01:00
Bert Peters
fb167ef899 Implementation day 16 
Not clean but it works.
 2021-12-16 09:55:53 +01:00
Bert Peters
4240f8fc8c Avoid queueing worse routes 2021-12-15 18:40:20 +01:00
Bert Peters
9a4ac427e0 Use Dijkstra instead of A* 
The available distance heuristic doesn't save enough steps to offset its
overhead.
 2021-12-15 18:29:08 +01:00
Bert Peters
c3929a56d8 Slow implementation for day 15 2021-12-15 07:54:14 +01:00
Bert Peters
9e37026f30 Remove unnecessary indexing 2021-12-14 19:54:45 +01:00
Bert Peters
a926243f0d Improve "winning" logic 
You don't need to check every possible win condition, just the one you
touched.
 2021-12-14 19:51:57 +01:00
Bert Peters
a35ae82548 Replace unnecessary HashMap and allocations 2021-12-14 19:39:00 +01:00