Commit Graph

69 Commits

Author SHA1 Message Date
80da5eb67e
Reworked part 1 to support part 2 2022-12-22 23:56:15 +01:00
b1292193a4
2022 - Day 22 [part 1] 2022-12-22 21:20:57 +01:00
36fc884ba6
2022 - Day 21 2022-12-21 20:15:50 +01:00
3432c50756
2022 - Day 20 2022-12-20 20:30:03 +01:00
9e3de56bdf
2022 - Day 19 2022-12-20 04:11:48 +01:00
8915fb135e
2022 - Day 18 2022-12-18 21:32:02 +01:00
27d845d8ff 2022 - Day 18 [Part 1] 2022-12-18 19:56:51 +01:00
ea2949c2c6 Reimplemented day17 using a bitset and improved pattern finding algorithm do be much more efficient 2022-12-18 16:35:02 +01:00
d4631d0da6 Reimplemented day16 using Floyd-Warshall to increase the speed and made part2 work properly without cheating 2022-12-18 15:38:09 +01:00
e7a687653d 2022 - Day 17 2022-12-18 03:15:47 +01:00
3a1181d973
Better conditional assignment 2022-12-17 06:01:17 +01:00
98555936d2
Improved performance by simplifying the connections 2022-12-17 03:57:26 +01:00
26aa976d63
Improved solution for part1 2022-12-16 22:02:59 +01:00
5d7a0f60ee
Made writing day14 to gif a feature that can be enabled 2022-12-16 21:48:51 +01:00
77f992a70a
Cleanup 2022-12-16 21:48:33 +01:00
c5a0ad16a1
2022 - Day 16 2022-12-16 21:14:09 +01:00
c43808fbfc
2022 - Day 15 2022-12-15 22:30:23 +01:00
0da86585cb
Added commented out code to visualize the simulation 2022-12-14 19:55:30 +01:00
619d58fc18
2022 - Day 14 2022-12-14 19:24:31 +01:00
af3843e583
2022 - Day 13 2022-12-13 19:16:38 +01:00
9a495ccd77
2022 - Day 12 2022-12-12 21:10:53 +01:00
8ab48001ea Do no actually need lcm 2022-12-11 18:08:56 +01:00
afd943fcd7 2022 - Day 11 2022-12-11 17:33:10 +01:00
6d87bd24ad Fixed template 2022-12-11 15:51:32 +01:00
b084f178ee Improved 2022 - Day 8 by stopping early if the highest possible score can not exceed the current highest score 2022-12-10 17:39:13 +01:00
225537f364 Updated lib to allow different output between part 1 and part 2 2022-12-10 17:33:17 +01:00
068b675982 2022 - Day 10 2022-12-10 17:11:13 +01:00
e1a993e56b 2022 - Day 9 2022-12-10 16:53:22 +01:00
b42678d356
Made solution less complex and increased performance 2022-12-09 01:12:54 +01:00
5c0cfb45dd
Improved solution 2022-12-08 22:27:51 +01:00
cc3e2ca1f2
2022 - Day 8 2022-12-08 19:38:32 +01:00
8d69dd9b0c
Yet another implementation, this time without using unsafe 2022-12-08 03:53:06 +01:00
47907ef562
Alternative implementation that does not use unsafe or a tree structures (is slower however) 2022-12-08 00:31:35 +01:00
d0bef9e654
Improved match statement to make it more readable and slightly faster 2022-12-08 00:29:44 +01:00
dc44463638
Improved readability by using unsafe rust 2022-12-07 22:38:44 +01:00
a4da36a23b
2022 - Day 7 2022-12-07 20:30:07 +01:00
3ef5039528
Even faster 2022-12-06 22:08:56 +01:00
386f764fbd
Added missing test for actual solution 2022-12-06 21:45:13 +01:00
39debb6875
Even more optimization 2022-12-06 21:38:57 +01:00
714c699f9b
Wrote custom check which is way faster 2022-12-06 21:31:31 +01:00
8e3012b56c
2022 - Day 6 2022-12-06 21:24:38 +01:00
4236ff8a61
Actually parse the boat from the string describing it now 2022-12-06 06:17:53 +01:00
308ddd0de4
Split with two different seperators instead of replacing first 2022-12-06 05:27:57 +01:00
4aa5bd00f9
Split the input in two in a better way 2022-12-06 05:25:55 +01:00
9a155dbda7
Implemented parsers as traits 2022-12-06 05:12:51 +01:00
f03ddf12cf
Put benchmarks in own module and added 6MB version of Day 5 problem to see how it performs 2022-12-06 03:48:18 +01:00
3047033aa3
Reorganized test 2022-12-06 02:30:33 +01:00
c75da6c077
Added benchmarks 2022-12-06 02:17:08 +01:00
ee9dcc92c1
Even better way to have different return types, also added script to setup template 2022-12-06 01:26:17 +01:00
5554cfedb3
Simplified solution 2022-12-06 00:54:35 +01:00