Commit Graph

Select branches

Hide Pull Requests

2021-day23

2022/4-ranges

2022/day-08-part-2-o-n

2022/day-2-allocless

master

#1

#2

#3

#4

#5

#6

Mono Color

• b2f9898714 Reduce code duplication Bert Peters 2021-12-26 12:32:07 +01:00
• d757c389f0 Replace inefficient recursion with iteration Bert Peters 2021-12-26 11:24:45 +01:00
• fd561a3e9d Clippy suggestions Bert Peters 2021-12-22 21:16:27 +01:00
• 2fcdc6b8d2 Brute force day 22 part 1 Bert Peters 2021-12-22 21:12:15 +01:00
• 8a3f0f843c Finally discovered that pos != new_pos Bert Peters 2021-12-22 20:36:58 +01:00
• 23b5c39838 Add inputs day 21 Bert Peters 2021-12-22 20:04:29 +01:00
• 452f6e5f14 Implement fast day 21 part 1 Bert Peters 2021-12-21 09:35:50 +01:00
• 61fb240622 Avoid 2/3 hashmap lookups Bert Peters 2021-12-20 18:24:37 +01:00
• aee25057d6 Avoid allocations Bert Peters 2021-12-20 18:14:36 +01:00
• a98332894f Brute force implementation day 20 Bert Peters 2021-12-20 18:04:58 +01:00
• 09e012c082 Add input files day 18 Bert Peters 2021-12-19 22:55:11 +01:00
• 944d3e644a Filter out the worst repetition Bert Peters 2021-12-19 18:38:30 +01:00
• d56f4ae8f8 Implement part 2 with the same brute force Bert Peters 2021-12-19 18:33:24 +01:00
• 53ca8d0043 Implement day 19 part 1 Bert Peters 2021-12-19 18:16:56 +01:00
• 6506af879a Simplify y-hit iterator Bert Peters 2021-12-18 18:12:41 +01:00
• 101ebee505 Use dedicated iterator instead of range Bert Peters 2021-12-18 18:00:40 +01:00
• cc81a7012b Use math instead of binary search Bert Peters 2021-12-18 17:21:43 +01:00
• 9c299f140c Tighter bounds for the range of y Bert Peters 2021-12-18 15:01:47 +01:00
• ba1b7b693e Use reusable parser wrapper more Bert Peters 2021-12-18 14:54:05 +01:00
• 7d331f9131 Implement day 18 2021 Bert Peters 2021-12-18 14:46:27 +01:00
• dfd8b2b985 Partially smart, partially brute-force day 17 Bert Peters 2021-12-17 10:04:36 +01:00
• 0f6167e90f Merge common parts of parsers Bert Peters 2021-12-16 19:26:10 +01:00
• 3e2a3f5206 Avoid allocating and tracking bits manually Bert Peters 2021-12-16 19:00:17 +01:00
• 8cc2245492 Optimize hex parser Bert Peters 2021-12-16 18:46:19 +01:00
• fb167ef899 Implementation day 16 Bert Peters 2021-12-16 09:55:53 +01:00
• 4240f8fc8c Avoid queueing worse routes Bert Peters 2021-12-15 18:40:20 +01:00
• 9a4ac427e0 Use Dijkstra instead of A* Bert Peters 2021-12-15 18:29:08 +01:00
• c3929a56d8 Slow implementation for day 15 Bert Peters 2021-12-15 07:49:16 +01:00
• 9e37026f30 Remove unnecessary indexing Bert Peters 2021-12-14 19:54:45 +01:00
• a926243f0d Improve "winning" logic Bert Peters 2021-12-14 19:51:57 +01:00
• a35ae82548 Replace unnecessary HashMap and allocations Bert Peters 2021-12-14 19:39:00 +01:00
• 8a0b72f111 Implementation day 14 2021 Bert Peters 2021-12-14 09:25:38 +01:00
• b5866b2d8a Modify points in-place Bert Peters 2021-12-13 22:55:14 +01:00
• 554683bc64 Actually apply nom Bert Peters 2021-12-13 22:20:02 +01:00
• 1031a8cdbb Avoid allocating the final buffer twice Bert Peters 2021-12-13 21:40:00 +01:00
• 5c764f6627 Don't use silly hashsets Bert Peters 2021-12-13 21:34:48 +01:00
• ffe8d27469 Clean up day 13 a little. Bert Peters 2021-12-13 08:52:57 +01:00
• d471f170b3 Very dirty solution day 13 Bert Peters 2021-12-13 08:29:53 +01:00
• 07cbf6cf53 Fix upcoming clippy warning Bert Peters 2021-12-12 15:56:05 +01:00
• 6e3252ce5a Add formal benchmarking code Bert Peters 2021-12-12 15:33:52 +01:00
• 0897e2e907 Implement day 12 part 2 Bert Peters 2021-12-12 11:31:54 +01:00
• 4d1fdd9cc0 Implement day 12 part 1 Bert Peters 2021-12-12 11:09:14 +01:00
• 84c160cf54 Simplify part 2 Bert Peters 2021-12-11 17:20:22 +01:00
• 440d454911 Implement day 11 Bert Peters 2021-12-11 13:56:10 +01:00
• 50cd6d8171 Implementation day 10 2021 Bert Peters 2021-12-10 10:46:02 +01:00
• dde9c0adbf Update to RC version of clap Bert Peters 2021-12-09 12:14:15 +01:00
• e0e1bc26e8 Simplify implementation day 8 Bert Peters 2021-12-09 12:02:07 +01:00
• 77ce31980b Implement day 9 Bert Peters 2021-12-09 11:56:29 +01:00
• 8c78106846 Bit-optimize day 8 Bert Peters 2021-12-08 13:52:08 +01:00
• 22f767e8df Implement day 08 2021 Bert Peters 2021-12-08 13:31:33 +01:00
• 3434966ac2 Just use the median, obviously Bert Peters 2021-12-07 13:22:43 +01:00
• c5f66fcc09 Avoid more allocations in day 7 part 1 Bert Peters 2021-12-07 11:41:19 +01:00
• c02f1e11c5 Convert recursion to iteration Bert Peters 2021-12-07 11:00:26 +01:00
• d099614217 Improve part 2 with binary search Bert Peters 2021-12-07 10:37:25 +01:00
• 766ee91719 Brute-force day 7 part 2 Bert Peters 2021-12-07 10:12:01 +01:00
• 2f3eb50a5b Implement day 7 part 1 Bert Peters 2021-12-07 09:45:58 +01:00
• b369f9d36a Implement day 6 2021 Bert Peters 2021-12-06 09:21:00 +01:00
• 1433b0cdbe Implement day 5 Bert Peters 2021-12-05 11:31:14 +01:00
• 5e52da6e6b Use iterator instead of range Bert Peters 2021-12-04 11:57:01 +01:00
• e50b812aed Day 4: more efficiently ignore completed cards Bert Peters 2021-12-04 11:40:40 +01:00
• fdef10a78e Less awkward line length hack Bert Peters 2021-12-04 11:28:32 +01:00
• 392aefb32d Less allocations in day 3 part 2 Bert Peters 2021-12-04 11:13:54 +01:00
• fb358be8f0 Implementation day 4 2021 Bert Peters 2021-12-04 10:43:02 +01:00
• 612d3ecb6b Tricky solution day 03, could possibly be improved Bert Peters 2021-12-03 09:21:13 +01:00
• d08a4e0e4e Merge day 1 solutions Bert Peters 2021-12-02 18:50:26 +01:00
• ed844a997c Create reusable line reader Bert Peters 2021-12-02 08:34:14 +01:00
• c9468ba139 Implementation 2021 day 2 Bert Peters 2021-12-02 08:21:49 +01:00
• 938eda0d22 Rework day 1 Bert Peters 2021-12-01 20:35:27 +01:00
• f413b08da6 Very quick implementation for day 1 Bert Peters 2021-12-01 09:30:03 +01:00
• 10531e3422 Merge pull request #3 from bertptrs/prepare/2021 Bert Peters 2021-12-01 09:08:43 +01:00
• 2e0a7ea81d Update READMEs for 2021. Bert Peters 2021-11-29 20:31:29 +01:00
• 2c64028978 Enable debug information for release Bert Peters 2021-11-28 17:13:27 +01:00
• 89159137fe Add other days Bert Peters 2021-11-28 17:12:26 +01:00
• 186d91d1b7 Use function pointers over dyn traits Bert Peters 2021-11-28 16:49:37 +01:00
• c985ba8a1a Add CI for 2021 Bert Peters 2021-11-22 08:26:05 +01:00
• cece8439a7 Initial 2021 runner Bert Peters 2021-11-20 11:57:32 +01:00
• 5f98b62f21 2019 day 24 part 2 Bert Peters 2021-10-29 08:30:21 +02:00
• affaf6e96f 2019 day 24 part 1 Bert Peters 2021-10-28 17:54:52 +02:00
• a6996e5234 2019 day 19 part 2 Bert Peters 2021-10-21 08:25:20 +02:00
• a64eff96a4 More efficiently scan lines Bert Peters 2021-10-21 08:16:08 +02:00
• 7718fc59c6 2019 day 19 part 1 Bert Peters 2021-10-21 08:05:22 +02:00
• 4e3c9c75c5 Merge pull request #2 from bertptrs/rewrite-2019-python Bert Peters 2021-10-18 22:34:35 +02:00
• 583b590a6c Remove last C++ remnant. Bert Peters 2021-10-18 21:50:22 +02:00
• ef302bbeb7 Trivial reimplementation day 21 Bert Peters 2021-10-18 19:45:36 +02:00
• 5791760412 More efficiently pick items Bert Peters 2021-10-18 16:00:32 +02:00
• e66f3df949 Implement brute force for 2019 day 25 Bert Peters 2021-10-18 15:51:44 +02:00
• 71f54bac6b Add minimal day 25 runner Bert Peters 2021-10-16 17:46:55 +02:00
• dbf6b2eb17 Add input day 23 Bert Peters 2021-07-03 17:59:58 +02:00
• 05e2a4f3a7 intcode: make execute current not protected Bert Peters 2021-07-03 17:59:43 +02:00
• ca43475a44 Implement day 23 Bert Peters 2021-07-03 17:57:40 +02:00
• 3f8c9505c3 Fix numpy deprecation Bert Peters 2021-07-03 15:26:38 +02:00
• befa2eefaa Replace Travis with Github Actions Bert Peters 2021-07-03 15:19:13 +02:00
• 22091fc8c3 Implement day 22 part 2 Bert Peters 2021-07-03 15:05:49 +02:00
• abc742e2ad Implement day 22 part 1 Bert Peters 2021-07-03 14:15:11 +02:00
• 8a137deae4 Update dependencies Bert Peters 2021-04-05 21:18:21 +02:00
• a43f260e1b Implement day 17 part 1 Bert Peters 2021-02-09 20:20:17 +01:00
• beae045f55 Implement 2019 day 16 part 2 Bert Peters 2021-02-02 19:57:24 +01:00
• 2d561eab7d Implement 2019 day 16 part 1 Bert Peters 2021-02-02 19:12:10 +01:00
• 165159cba9 Implement 2019 day 15 Bert Peters 2021-02-01 22:39:09 +01:00
• eff22abf8a Fix mypy issues Bert Peters 2021-01-30 10:09:19 +01:00