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
204 Commits 5 Branches 0 Tags
f4a7b06d4792840dd658504319c2c42c134da411
Commit Graph

52 Commits

Author SHA1 Message Date
Bert Peters
f4a7b06d47 Reuse input helper. 2018-12-14 11:42:44 +01:00
Bert Peters
98da0a9857 Implement day 14. 2018-12-14 11:37:30 +01:00
Bert Peters
faf3ad90d9 Make day 12 even more rusty. 2018-12-13 14:55:30 +01:00
Bert Peters
0de6e22a00 Deduplicate day 12. 2018-12-13 14:47:00 +01:00
Bert Peters
91f0ec55f1 Slightly cleaned up by using structs. 2018-12-13 11:44:18 +01:00
Bert Peters
e6c8c6b100 Implement a very ugly part 2. 2018-12-13 11:24:03 +01:00
Bert Peters
973c9ed63b Add a part1 implementation and wrong part2. 2018-12-13 10:52:32 +01:00
Bert Peters
e22f934ea6 Remove code duplication. 2018-12-12 16:12:26 +01:00
Bert Peters
8340f2c8fa Preallocate correct state length. 2018-12-12 13:08:35 +01:00
Bert Peters
247613555b Implement day 12 part 2. 
This in no way should work, but it does, at least for my input.
 2018-12-12 12:44:27 +01:00
Bert Peters
fd3e509841 Implement part 1 of day 12. 
Part two is going to take 31 hours of computation, so I might need to
improve that.
 2018-12-12 11:30:45 +01:00
Bert Peters
b245e0911d Implement the summed-area-table algorithm. 
Which is somewhat awkward for the edge cases (that are not in my input!)
but is really fast anyway.
 2018-12-11 18:14:15 +01:00
Bert Peters
4b8255728c Remove an invalid optimization. 2018-12-11 15:49:39 +01:00
Bert Peters
59be8e9d7a Implement day 11 part 2. 2018-12-11 11:06:20 +01:00
Bert Peters
ff8bc97329 Implement day 11 part 1. 2018-12-11 10:31:23 +01:00
Bert Peters
eaf1156ae0 Refactor for autovectorization. 
By storing x/y as a vector of ints instead of a vector of tuples, the
compiler recognizes it for what it is: a huge vector multiplication. Now
the compiler emits AVX2 instructions.
 2018-12-10 17:13:10 +01:00
Bert Peters
c3480482f2 Implement an estimator function for day 10. 
This bumps the speed tenfold.
 2018-12-10 14:17:57 +01:00
Bert Peters
c94555fda1 Implement day 10. 
This implementation is stupid but it works.
 2018-12-10 13:13:29 +01:00
Bert Peters
63a5f81d8c Pre-allocate correct size. 2018-12-09 17:47:22 +01:00
Bert Peters
c17be69910 Replace linkedlist with VecDeq. 
Slightly slower but a lot cleaner.
 2018-12-09 13:27:05 +01:00
Bert Peters
9b287a0098 Prepare future scaffolding. 
Also reformat the code, but that is nothing significant.
 2018-12-09 13:02:54 +01:00
Bert Peters
9b04e3b2c9 Implement day 9 part 2. 
Linked lists in rust are a pain, but we got there.
 2018-12-09 10:57:47 +01:00
Bert Peters
e101dbd58c Move get_impl to crate. 2018-12-09 10:49:04 +01:00
Bert Peters
1d5869af70 Implement day 9 part 1. 2018-12-09 10:47:21 +01:00
Bert Peters
cf6f4f9e1e Better usage of clap. 2018-12-08 08:00:43 +01:00
Bert Peters
880ae49be6 Split lib/bin. 2018-12-08 07:37:04 +01:00
Bert Peters
c0052c8c24 Replace filter + map with filter_map. 2018-12-08 07:32:46 +01:00
Bert Peters
7245cdf6b5 Implement day 08 in rust. 2018-12-08 07:15:27 +01:00
Bert Peters
2b732c2285 Implement day 08, in python. 
Attempted to reach the leaderboard. Failed miserably. Trying again soon
anyway.
 2018-12-08 07:13:48 +01:00
Bert Peters
0c07cbda24 Remove unused hashset. 2018-12-07 18:13:40 +01:00
Bert Peters
3deb4ceb9a Replace backwards edges with dependency count. 2018-12-07 17:27:26 +01:00
Bert Peters
eee42a70f4 Implement part 2. 
This one got kind of messy at the end.
 2018-12-07 15:58:53 +01:00
Bert Peters
7b56d98853 Implement day 07 part 1. 2018-12-07 11:26:25 +01:00
Bert Peters
1582b556d8 Refactor range of coordinates to own function. 2018-12-06 16:37:19 +01:00
Bert Peters
c44ebaa238 Refactor grouping count into a trait. 2018-12-06 16:19:52 +01:00
Bert Peters
d53100e591 Move sample and input files. 
IDEA doesn't like files without extension.
 2018-12-06 15:43:28 +01:00
Bert Peters
f77e5adf2a Implement day 6. 2018-12-06 13:08:28 +01:00
Bert Peters
bdea21d92b Day 06 inputs. 2018-12-06 11:10:51 +01:00
Bert Peters
8fef472a58 Clarify bitmagic. 
[skip ci]
 2018-12-05 22:45:55 +01:00
Bert Peters
f3d0297da5 Bithack optimizations, why not. 
It saves a branch and a (possibly inlined) function call, but it also
halves the runtime.
 2018-12-05 22:37:22 +01:00
Bert Peters
f426e7067a More easily time the program. 2018-12-05 12:23:54 +01:00
Bert Peters
28d38470a6 Move sample input to separate files. 2018-12-05 10:43:58 +01:00
Bert Peters
3543351c20 Implement day 05. 
This was a nice exercise in not allocating memory. Or at least it was,
for part 1.
 2018-12-05 10:39:39 +01:00
Bert Peters
3d68f20097 Slightly more efficient and compact code. 
This version loops the input twice, first to build the claims, and then
to check whether they have been claimed more than once.
 2018-12-05 09:53:42 +01:00
Bert Peters
38db4487e3 Add missing input for day 3. 2018-12-04 15:16:50 +01:00
Bert Peters
43eeacc686 Rework previous regex use. 2018-12-04 13:49:16 +01:00
Bert Peters
1e51012d5e Implement day 4. 
Nice code-reuse between 1 and 2. I'm not accustomed to this.
 2018-12-04 13:41:45 +01:00
Bert Peters
9a0f24d6bb Implement day 3. 
Wasted way too much trying to do this cleverly.
 2018-12-03 10:41:38 +01:00
Bert Peters
fd5af9245b Implement day 2. 
Part two was weird.
 2018-12-02 10:36:45 +01:00
Bert Peters
3bbe6a479a Implement day 1 2018. 
We've started.
 2018-12-01 11:03:48 +01:00