Solve Day 11 #19
Merged
Solve Day 11 #19
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Codecov Report
@@ Coverage Diff @@
## main #19 +/- ##
==========================================
- Coverage 95.63% 95.08% -0.55%
==========================================
Files 16 17 +1
Lines 206 244 +38
Branches 13 21 +8
==========================================
+ Hits 197 232 +35
- Misses 5 6 +1
- Partials 4 6 +2
Continue to review full report at Codecov.
|
manuphatak
commented
Dec 14, 2020
Comment on lines
-25
to
+31
| fromRightOrError' :: Show a => Either a b -> b | ||
| fromRightOrError' (Left x) = error (show x) | ||
| fromRightOrError' (Right x) = x | ||
| fromRightOrShowError :: Show a => Either a b -> b | ||
| fromRightOrShowError (Left x) = error (show x) | ||
| fromRightOrShowError (Right x) = x |
There was a problem hiding this comment.
I was lookin' for a name for this thing. This is inspired by Debug.Trace.traceShow
manuphatak
commented
Dec 14, 2020
Comment on lines
-8
to
+13
| occurrences :: Eq a => a -> [a] -> Int | ||
| occurrences target = length . filter (target ==) | ||
| occurrences :: (Foldable t, Eq a) => a -> t a -> Int | ||
| occurrences target = foldr go 0 | ||
| where | ||
| go value | ||
| | value == target = succ | ||
| | otherwise = id |
There was a problem hiding this comment.
Generalized this function to work with Foldables including Data.Map
* origin/main: Update CI to cache after tests (#20)
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Day 11: Seating System
Your plane lands with plenty of time to spare. The final leg of your journey is a ferry that goes directly to the tropical island where you can finally start your vacation. As you reach the waiting area to board the ferry, you realize you're so early, nobody else has even arrived yet!
By modeling the process people use to choose (or abandon) their seat in the waiting area, you're pretty sure you can predict the best place to sit. You make a quick map of the seat layout (your puzzle input).
The seat layout fits neatly on a grid. Each position is either floor (
.), an empty seat (L), or an occupied seat (#). For example, the initial seat layout might look like this:Now, you just need to model the people who will be arriving shortly. Fortunately, people are entirely predictable and always follow a simple set of rules. All decisions are based on the number of occupied seats adjacent to a given seat (one of the eight positions immediately up, down, left, right, or diagonal from the seat). The following rules are applied to every seat simultaneously:
L) and there are no occupied seats adjacent to it, the seat becomes occupied .#) and four or more seats adjacent to it are also occupied, the seat becomes empty .Floor (
.) never changes ; seats don't move, and nobody sits on the floor.After one round of these rules, every seat in the example layout becomes occupied:
After a second round, the seats with four or more occupied adjacent seats become empty again:
This process continues for three more rounds:
At this point, something interesting happens: the chaos stabilizes and further applications of these rules cause no seats to change state! Once people stop moving around, you count
37occupied seats.Simulate your seating area by applying the seating rules repeatedly until no seats change state. How many seats end up occupied?
Part Two
As soon as people start to arrive, you realize your mistake. People don't just care about adjacent seats - they care about the first seat they can see in each of those eight directions!
Now, instead of considering just the eight immediately adjacent seats, consider the first seat in each of those eight directions. For example, the empty seat below would see eight occupied seats:
The leftmost empty seat below would only see one empty seat, but cannot see any of the occupied ones:
The empty seat below would see no occupied seats:
Also, people seem to be more tolerant than you expected: it now takes five or more visible occupied seats for an occupied seat to become empty (rather than four or more from the previous rules). The other rules still apply: empty seats that see no occupied seats become occupied, seats matching no rule don't change, and floor never changes.
Given the same starting layout as above, these new rules cause the seating area to shift around as follows:
Again, at this point, people stop shifting around and the seating area reaches equilibrium. Once this occurs, you count
26occupied seats.Given the new visibility method and the rule change for occupied seats becoming empty, once equilibrium is reached, how many seats end up occupied?
Link
https://adventofcode.com/2020/day/11