Compare commits
2 Commits
58d479b9a6
...
1a7666783d
| Author | SHA1 | Date | |
|---|---|---|---|
| 1a7666783d | |||
| 63850f082b |
93
2020/input/2020/day11.txt
Normal file
93
2020/input/2020/day11.txt
Normal file
@ -0,0 +1,93 @@
|
||||
LLLL.LLLLL.LLLLLLLLLLLLLLLL.L.LLLLLL.LLLL..L.LLLLLLLL.LLLLLL.LLLL..LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL
|
||||
LLLLLLLLLLLLLLLLLLLLLLLLLLL.LLL.LLLLLLLLL.L..LLLLLLLL.LLLLLL.LLLLLLLLLLLLLLLLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLLLL.LLLL.LLLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL.LLLLL.LL.LLLL.LL.LLLLLLLLLLLLLLLLLLLL
|
||||
LLL.LLLLLLLLLLL.LLLL.LLLLLLLLLL.LL.L.LLLLLLL.LLLLLLLL.LLLLLL.LLLLL.LLLLLLL.LLLLLLLL.LLLLL.LLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLL.LLL.LLLL.LLLLLLLLLLL.LLLLLLLLLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLL.LLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL.LLLLLLLLL.LLLLLLLLLLLL.LLLLLLLLLLLLLL
|
||||
...L..LL.LL.LLL....L......L..L.....L.....L....L.LL.....LL..L.L...LL.L...LL..L.L...L.LL...L..LL..L.
|
||||
LLLLLLLLLLLLLLLLLL.L.LLLLLL.LLLLLLLL.LLLLL.L.LLLLLLLLLLLLLLL.LLLLL.LLLLLLLLLL.LLLLL.LLLLLLLL.LLLLL
|
||||
LLLLLLLLL.LLLLLLLLLL.LLLLLLLLLLLLLLL.LLLLLLL.LLLLLLLLLLLLLLL.LLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLLLL.
|
||||
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLLLLLLLLLLLLLLLLLLL.L.LLLL.L.LLLLL.L.LLLLLLLL.LLLLLLLLLLLL.LLLLLLL.LLLLLLLL.LLLLL.LLLLLLLL
|
||||
LLLLLLL..L.LLLLLLLL..LLL.LL.LLLLLL.L.LLLLLLL.LLLLLLLL.LLLLLL.LLLLL.LL.LLLL.LLLLLLLL.LLLL.LLLLLLLLL
|
||||
...L..L.L.L......L....L.L..L...L.L..L.L...LL.LL....L...L........L.L.LLL....L..L..L...L.L..L..LL...
|
||||
LLLLLLLLLL.LLLLLLLLLLLLLLLL.L.LLLLLL.LLLLLLL.LLLLLLLLLLLLLLL.LLLLL.LLLLLLLLLLLL.L.LLLLLLLLLLLLLLLL
|
||||
LLLLLLLLLLLLLLLLLLLL.LLLL.L.LLLLLLLLLLLLLLL..LLLLLLLL.LLLLLL.LLLLL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLL.LLL.LL.LLLLLLLLL.LLLLL..LLLLLLLL.LLLLLLLLLLLLLLL..LLLLLLLLLLLL.LLLLLLL.LLLLLLLL.LLL.LLLLLLLLLL
|
||||
.LLLLLLLLL.LL.LLLLLL.LLL.LLLLLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLL.LLLLL.LLLLLLL.LLLLLLLL.LL.LLLLLLLLLLL
|
||||
LLLLL.LLLLLLLLLLLLLL.LLLLLL.LLLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL.LLLLL.LLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL
|
||||
.LLLLLLLLLLLLLLLLLLL.L.LLLL.LLLLLLLL.LLLLLLLLLLLLLLLLLLL..LL.LLLLLLLLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL
|
||||
L....LL.....L......LLL......L.LLL..L....L.L....L....LL.L.LL.LL........LL....L.L.L..LLLL.......L...
|
||||
LLLLLLL.LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL.LLLLLLLLLLLLL.LLLLL.LLL.LLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
.LL..LL.LL.LLLLLLLLL.LL.LLLLLLLLLLLL.LLLLLLL.LLLLL.LLLLLLLLL.LLLLLLL.LLLLLLLLLLLLLLLLLLLLLLLLLLLLL
|
||||
LLL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL.LLLLL.LL.LLLLLL.LLLLL.LLLLLLL.L.LL.LLLLLLLLLLLLLLLLLL
|
||||
LLLLLLLLLL..LLLLLLLL.LLLL.L.LLL.LLLLLLLLLLLL.LLLLLLLL.LLLLLL.LLLL..LLLLLLLLLL..LLLL.LLLLLLLLLLLLLL
|
||||
LLL.LLLLLL.LLLLLLLLL.LLLLLL.LLLLLLL..LLLLLLL..LLLLLLL.LLLLLL.LLLLL.LLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL
|
||||
.LLLLLLLLLLLLLLLLLLL.LLLLLL.LL.LLLLL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL
|
||||
LLLLLLLLLLLLLLLLLLLL.LL.LLL.LLLLLLLL.LLLLLLL.LLLLLLLL..LLL.L.LLLLL.LLLLLLL.LLLLLL...LLLLLLLLLLLLLL
|
||||
LLL.LLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL.LLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLL.LLLL
|
||||
LLLL.LLLLL...LLLLLLLLLLL.LL.LLLLLLLL.LLLLLLL.LLLLLLLLLLLLLL..LLLLL.LLLLLLL..LLLLLLL.LLLLLLLLLLLLLL
|
||||
..L...LLL........LL....L.....L.....L..L..L.....L.L.LL...L......LLLLL.L.L...........L.LL.....LL...L
|
||||
LLLLLLLLLLLLLLLLLLLL.LLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLL.LLLLLLLLLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLL.L.LLL.LLL.LLLLLL.LLLLLLLL.LLLLL.LLLLLLLLLL.LLLLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLL.LLLLLL
|
||||
LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL.LLLLLLL.LLLLLLLL.LLLLLL.LLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLL.LLL
|
||||
LLLLLLLLLLLLLLLL.LLLLLLLLLL.LLLLLLLLLLLLL.LL.LL.LLLLLLLLLLLL.LLLLL.LLLLLLLLLLLL.LL.LLL.LLLLLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLL...LLLLLLLLLLLLLLL.LLLLLL.LLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLL.LL
|
||||
LLLLLLL.LL.LLLLLLLLL.LLLLLLLLLLLLLLL.LLLLLLL..LLLLLLL.LLLLLL.LLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
....L..L.L.LL..LLL..L....LL...L.L..LL.L......L...LLL.L.L.L.....L.......L......LL.....L..L.L..LL...
|
||||
LLLLLLLLLL.LLLLLLLLL.LLLLLL.LLLLLLLL.LLLLLL.LLLLLLLLLLLLLLLLLLLLLL.LLLLLLL.LLLLLLL.LLLLLLLLLLLLL.L
|
||||
LLLLLLLLLL.LLLLLLLLL.LLLL.L.LLL.LLLL.LLLLLLL.LLLLLLLLLLLLLLL.LLLLL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLLLLL.LLLLLL.LLLLLLLLLLLLLL...LLLLLL.LLLLLLLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLLLLL.LLLLLLLLL..LLLLLLLLLLLLLLLLLL.LLLLLLL.LLLL.LLLLLLL.LLLLLLLL.LLL.LLLLLLLLLL
|
||||
LLLLLLLLLL.L.LLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL.LLLL.LLL.LLLLLL.LLLLLLLLLLLLLLLLLLLLLL.LLL.LLLLLLLLLL
|
||||
LL.LLLLLLL.LLLLLLLLL.LLLLLL.LLLLLLLL.LLLLLLLL.LLLLLLL.LLL.LL.LLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
..LL.LLL...LLL.....L.L.L......L......L........L.LL......LLL..LL..L..L.LLL..LL..LL.L.....L.LL....L.
|
||||
LLLLLLLLLL.LL.LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLLLLLL.LLLLLLLL..LLLL.LLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLL.LLLLLLLLLLLLL.LL.LLLLLL.L.LLLLLLLLL.L.LLLLL.LL.L.LLLLLLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLL.LLLLLLLL.LLLLLL.LLLLLLLLLLLLLLLL.LLLLLL.LLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLL.LLLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLLL.LLLLLLL.LLLLLLL.LL.LLLLL.LLLLLLLLLLL.LL
|
||||
LLLLLLLLLLLLLLLLLLLL.LLLLLLLL.LLLLLLLLLLLLLLLLLLL.LLLLLLLLLL.LLLLL.LLL.LLL.LLLLL.LL.LLLLLLLLLLLLLL
|
||||
L..L..LL..LLL...L......L.....L...LL..L..L.....L.L...LL......L.L.LLL.L..L....L....L...L.L........LL
|
||||
LLLLLLLLLL.LLLLLLLLLLLLLLLLLLLL.LLLL.LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL.LLLLLLL..LLLLLLLLLLLLLL
|
||||
LLLLLL.LLL.LLLLLLLLL.LLLLLLLLLLLLLLL.L.LL.LLLLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLLLLLLLL.LLLLL.LLLLLLLL
|
||||
L.LLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLL.LLLLLLLLLLLLLLLL.LLLL.L.LLLLL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLL.LLL.LL.LL.LLLLLLLLL.LL.LL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLLLLLL.LLLLL.LL.LLLLLLLLLLLLLL
|
||||
LL.LLLLLLLLLLLLLL.LL.LLLLLLLLLLLLLL..LLLLLLLLLL.LLL.L..LLLLL.LLLLL..LLLLLL.LLLLLLLLLLLLLLLLLLLLLLL
|
||||
LLLLLLLLLLLLLL.LLLLLLLLLLLL.LLLLLLLL.LLL.LLLLLLLLLLLL.LLLLLL.LLLLL.LLLLLLL..LLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLL.LLL.LLLLL.LL.LLLLLLLLLLLL.LLLLLLL.LLLLLLLL.LLLLLL.LLLLL.LLLLLLL.LLL.LL.L.LLLLLLL.LLL.L.
|
||||
LLLLLLLLLLLLLLLLLLLL.LLLL.LLLLLLLLLL.LLL.LLL.LLLLLLLL.LLLLLL.LLLLLLLLLLLLLLLLL.L.LL.LLLLLLLLLL.LLL
|
||||
..L....L....L....L........L...L....L..LL.L.L..L.LLLL.L.LLL...L...L..LL..L...L....L....L.......L.L.
|
||||
LLLLLLLLLL..LLL.LLLLLLLLLLL.LLLLLLLL.LLL.LLL..LLLLLLL.LLLLLL.LLLLL.LLLLLLLLLLLLLLL..LL..LLLLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLL.LLLLLLLLLLLLLLL.LLLLLLL.LL.LLLLL.LLLLLL.LLLLLLLLLLLL..LLLLLLLLLLLLLLLLLLLLLLL
|
||||
LLLLLLLLL.LLLLLLLLLLLLLLLLL..LLLLLLL.LLLLLLLLLLLLLLLL.LLLLLL.LLLLL.LLLLLLLLLLLLLLLL.LLLL.LLLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLL.LLLLLL..LLLLLLL..LLLLLL.LL.LLLLLLLLLLLL.LLLLL.LLLLLLL.LLLLLLLLLLLLLLLLLLLLL.L
|
||||
L.LLLLLLLL.LLLLLLLLL.LL.LLL.LLLLLLLLLLLLLLL..LLLLLLLLLLLLLLL.LLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLL..LLL.LLLLLLLLLLLLLLLLLLLL.LLLLLL.LLLLLLLLL.LLLLL..LLLLL.LLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL
|
||||
L.....L..LLL.....LL.L..L..LL....LLLLL.LL..L.......L...LL.....LL...L...........L.....L.L..L.....L.L
|
||||
LLLLLLLLLL.LLL.LLLLL.LLLLLL.LLLLLLLL.LLLLLLL.LLLLLLLLL.LLLL..LLL.LLLLLLLLL.LLLLLLLLLLLLL.LLLLLLLLL
|
||||
LLLLLLLLLL..LLLLL.LL.LLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLL.LLLLLL.LLLLLLLLLLLLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLL.LLLLLL.LLLLLLLL.LLLLLLL.LLLLLLLL.LLLL.L.LLL.LLLLLLLLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLL.LLLLLLL.LLLLLLLL.LLLLLL.LLLLL.LLLLLLL.LLLL.LL.LLLLLLLLLLLLLLL
|
||||
LLLLL.LLLL.LLLLLLL.LLLLLLLL.LLLLLLLL.LLLLLLLLLLLLLLL.LLLLLLL.LLLL..LLLLLLL.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLLLLLLLLLLLL..LLLLL.LLLLLLLLLLLLLLLLLLLLLLLLL.LLLLLL.LLLLL.LLLLLL..LLLLLLLL.LLLLLLLLLLLLLL
|
||||
........LLLLLL.LL.L..L...L...LLL....L.......LLLL..L.LL.L..L.L.LLL...L...L.......L..L.....L.L.L..LL
|
||||
LLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLLLLLLLLLLL.LL.LLL..LLLL.LLLLLLL.LLLLLLLLLLLLLLLLLLLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLL.LLLLLL.LLLLLLLLLLLLLLL..LLLLLLLL.LLLLLLLLLLLLLLLLLLLLLLLLLLLLL.LLL.LLLLLLLLLL
|
||||
L.LLLLL.LLLLLLLLLLLL.LLLLLL.LLLLLLLLLLL.LLLL.LLL.LLLLLLLLLLL.LLLLLLLLLLLLL.LLLLLLLL.LLLLL.LLLLLLLL
|
||||
LLLLLL.LLL.LLLLLLLLLLLLL.LLLLLLLLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLLL.LLL.L.L.LLLLLLLL.LLLLLLLLLLLLLL
|
||||
LLL.LLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL
|
||||
LLLLLLLLLLLLLLLLLLLLL.LLLLL.LLLLLLL.LLLLL.LL.LLLLLLLLLLLLLLLLLLLLL.LLLLLLL..LLLLLLL.LLLLLLLLLLLLLL
|
||||
..LL..L....L.......L....L....LL...L.L..L.........LL..L..LL.L....LLL.L.LLL...L.....LL.....LL.LL....
|
||||
LLLLLLLLLL.LLLLLL.LL.LLLLLLLL..LLLLL.LLLLLLLLLLLLLLLL.LLLLLL.L.LLLLLLLLLLL.LLLLLLLL.LLLLLLLLLL.LLL
|
||||
L.LLLLLLLLLLLL.LLLLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLLL.LL.LLLLLL.LLLLL.LLLLLLL.LLLLL.LLLLLLLLLL.LLLLLL
|
||||
LLLLLLLLLL.LLLLLLLLL.LLL.LL.LLLLLLLL.L.LLLLLLLLLLLLLLLLLLLLL.L.LLL.LLLLLLL.LLLLLLLL.LLLLLLLLLLLLL.
|
||||
LLLLLLLLLLLLLLLLLL.LLLLLLLL.LLLLLLLLLLLLLLLL.LLLLLLL.LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL.LLLLLLLLL
|
||||
LLLLL.LLLL.LLLLLLLLL.LLLLLL.LLLL.LLL..LLLLLL.LLLLLLLLLLLLLLL.LLLLL.LLLLLLLLLL.LLLLL.LLLLLLLLLLLLLL
|
||||
LLLLLLLLLLLLLLLLLLLL.LLLLLL.LLLLLLLLLLLLLL.LLLLLLLLLL.LLLLLL.LLLLL.LLLLLLL.LLLLLLLL.LLLLLLLLL.LLLL
|
||||
LLLLLLLLLLLLLLLLLLLLLLLLL.LLLLLLLLLL.L.LLLLLLLLLLLLLL.LLLLLL.LLLLL.LLLLLLLLLLLLLLLL.LL.LLLLLLLLLLL
|
||||
.L.L....L........L....LL...L...L...L..L.............LL.LL..L.L.L...LL.......LLL.......LLL.L.L.L..L
|
||||
LLLLLLLLLL.LLLLLLLLLLLLLLLL.LLLLL.LL.LLLLLLLLLLLLLL.L.LLLLL..LLLLL.LLLLLLL.LLLLLLLL.LLLL.LLLLLLLLL
|
||||
LLLLLLLLLLLLLLLLLLLL.LLLLLLLLLLLLLLL.LLLLLLLLLLLLLLLLL.LLLLLLLLLLLLL.LLLLL.LLLLLLLL.LLLLLL.LLLLLLL
|
||||
LLLLLLLLLL..LLLLLLLL.LLLLLL..LLLLLLL.LLLLLLLLLLLLLLLL.LLLLLL.LLLLL.LLLLLLL.LLLLLLLLL.LLLLLLLLLLLLL
|
||||
LLLLLLLLLL.L.LLLLLLL.LLLLLLLLLLLLLL.LLLLLLLL.LLL.LLLL.LLLLLLLLL.LLLLLLLLLLLLLLLLLLL.LLLLL.LLLLLLLL
|
||||
LLLLL.LLLLLLLLLLLLLL.LLLLLL.LLLLLLLL.LLLLLLLLLLLLLL.L.LLLLLL.LLLLL.LLLLLLL.LLLLLLLL.L.LLLLLLLLLLLL
|
||||
721
2020/src/day11.rs
Normal file
721
2020/src/day11.rs
Normal file
@ -0,0 +1,721 @@
|
||||
//! --- 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:
|
||||
//!
|
||||
//! L.LL.LL.LL
|
||||
//! LLLLLLL.LL
|
||||
//! L.L.L..L..
|
||||
//! LLLL.LL.LL
|
||||
//! L.LL.LL.LL
|
||||
//! L.LLLLL.LL
|
||||
//! ..L.L.....
|
||||
//! LLLLLLLLLL
|
||||
//! L.LLLLLL.L
|
||||
//! L.LLLLL.LL
|
||||
//! 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:
|
||||
//!
|
||||
//! If a seat is empty (L) and there are no occupied seats adjacent to it, the seat becomes occupied.
|
||||
//! If a seat is occupied (#) and four or more seats adjacent to it are also occupied, the seat becomes empty.
|
||||
//! Otherwise, the seat's state does not change.
|
||||
//! 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:
|
||||
//!
|
||||
//! #.LL.L#.##
|
||||
//! #LLLLLL.L#
|
||||
//! L.L.L..L..
|
||||
//! #LLL.LL.L#
|
||||
//! #.LL.LL.LL
|
||||
//! #.LLLL#.##
|
||||
//! ..L.L.....
|
||||
//! #LLLLLLLL#
|
||||
//! #.LLLLLL.L
|
||||
//! #.#LLLL.##
|
||||
//! This process continues for three more rounds:
|
||||
//!
|
||||
//! #.##.L#.##
|
||||
//! #L###LL.L#
|
||||
//! L.#.#..#..
|
||||
//! #L##.##.L#
|
||||
//! #.##.LL.LL
|
||||
//! #.###L#.##
|
||||
//! ..#.#.....
|
||||
//! #L######L#
|
||||
//! #.LL###L.L
|
||||
//! #.#L###.##
|
||||
//!
|
||||
//! #.#L.L#.##
|
||||
//! #LLL#LL.L#
|
||||
//! L.L.L..#..
|
||||
//! #LLL.##.L#
|
||||
//! #.LL.LL.LL
|
||||
//! #.LL#L#.##
|
||||
//! ..L.L.....
|
||||
//! #L#LLLL#L#
|
||||
//! #.LLLLLL.L
|
||||
//! #.#L#L#.##
|
||||
//!
|
||||
//! #.#L.L#.##
|
||||
//! #LLL#LL.L#
|
||||
//! L.#.L..#..
|
||||
//! #L##.##.L#
|
||||
//! #.#L.LL.LL
|
||||
//! #.#L#L#.##
|
||||
//! ..L.L.....
|
||||
//! #L#L##L#L#
|
||||
//! #.LLLLLL.L
|
||||
//! #.#L#L#.##
|
||||
//!
|
||||
//! 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 37 occupied 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:
|
||||
//!
|
||||
//! .......#.
|
||||
//! ...#.....
|
||||
//! .#.......
|
||||
//! .........
|
||||
//! ..#L....#
|
||||
//! ....#....
|
||||
//! .........
|
||||
//! #........
|
||||
//! ...#.....
|
||||
//! The leftmost empty seat below would only see one empty seat, but cannot see any of the occupied ones:
|
||||
//!
|
||||
//! .............
|
||||
//! .L.L.#.#.#.#.
|
||||
//! .............
|
||||
//! The empty seat below would see no occupied seats:
|
||||
//!
|
||||
//! .##.##.
|
||||
//! #.#.#.#
|
||||
//! ##...##
|
||||
//! ...L...
|
||||
//! ##...##
|
||||
//! #.#.#.#
|
||||
//! .##.##.
|
||||
//! 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:
|
||||
//!
|
||||
//! L.LL.LL.LL
|
||||
//! LLLLLLL.LL
|
||||
//! L.L.L..L..
|
||||
//! LLLL.LL.LL
|
||||
//! L.LL.LL.LL
|
||||
//! L.LLLLL.LL
|
||||
//! ..L.L.....
|
||||
//! LLLLLLLLLL
|
||||
//! L.LLLLLL.L
|
||||
//! L.LLLLL.LL
|
||||
//! #.##.##.##
|
||||
//! #######.##
|
||||
//! #.#.#..#..
|
||||
//! ####.##.##
|
||||
//! #.##.##.##
|
||||
//! #.#####.##
|
||||
//! ..#.#.....
|
||||
//! ##########
|
||||
//! #.######.#
|
||||
//! #.#####.##
|
||||
//! #.LL.LL.L#
|
||||
//! #LLLLLL.LL
|
||||
//! L.L.L..L..
|
||||
//! LLLL.LL.LL
|
||||
//! L.LL.LL.LL
|
||||
//! L.LLLLL.LL
|
||||
//! ..L.L.....
|
||||
//! LLLLLLLLL#
|
||||
//! #.LLLLLL.L
|
||||
//! #.LLLLL.L#
|
||||
//! #.L#.##.L#
|
||||
//! #L#####.LL
|
||||
//! L.#.#..#..
|
||||
//! ##L#.##.##
|
||||
//! #.##.#L.##
|
||||
//! #.#####.#L
|
||||
//! ..#.#.....
|
||||
//! LLL####LL#
|
||||
//! #.L#####.L
|
||||
//! #.L####.L#
|
||||
//! #.L#.L#.L#
|
||||
//! #LLLLLL.LL
|
||||
//! L.L.L..#..
|
||||
//! ##LL.LL.L#
|
||||
//! L.LL.LL.L#
|
||||
//! #.LLLLL.LL
|
||||
//! ..L.L.....
|
||||
//! LLLLLLLLL#
|
||||
//! #.LLLLL#.L
|
||||
//! #.L#LL#.L#
|
||||
//! #.L#.L#.L#
|
||||
//! #LLLLLL.LL
|
||||
//! L.L.L..#..
|
||||
//! ##L#.#L.L#
|
||||
//! L.L#.#L.L#
|
||||
//! #.L####.LL
|
||||
//! ..#.#.....
|
||||
//! LLL###LLL#
|
||||
//! #.LLLLL#.L
|
||||
//! #.L#LL#.L#
|
||||
//! #.L#.L#.L#
|
||||
//! #LLLLLL.LL
|
||||
//! L.L.L..#..
|
||||
//! ##L#.#L.L#
|
||||
//! L.L#.LL.L#
|
||||
//! #.LLLL#.LL
|
||||
//! ..#.L.....
|
||||
//! LLL###LLL#
|
||||
//! #.LLLLL#.L
|
||||
//! #.L#LL#.L#
|
||||
//! Again, at this point, people stop shifting around and the seating area reaches equilibrium. Once this occurs, you count 26 occupied 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?
|
||||
|
||||
use std::convert::TryFrom;
|
||||
use std::str::FromStr;
|
||||
|
||||
use aoc_runner_derive::{aoc, aoc_generator};
|
||||
|
||||
#[derive(Clone, Copy, PartialEq)]
|
||||
enum State {
|
||||
/// '.'
|
||||
Floor,
|
||||
/// 'L'
|
||||
Empty,
|
||||
/// '#'
|
||||
Occupied,
|
||||
}
|
||||
|
||||
use std::fmt;
|
||||
impl fmt::Debug for State {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
write!(f, "{}", self)
|
||||
}
|
||||
}
|
||||
|
||||
impl fmt::Display for State {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
match self {
|
||||
State::Floor => write!(f, "."),
|
||||
State::Empty => write!(f, "L"),
|
||||
State::Occupied => write!(f, "#"),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl FromStr for State {
|
||||
type Err = String;
|
||||
fn from_str(s: &str) -> Result<State, String> {
|
||||
match s {
|
||||
"." => Ok(State::Floor),
|
||||
"L" => Ok(State::Empty),
|
||||
"#" => Ok(State::Occupied),
|
||||
s => Err(format!("Unknown map character: '{}'", s)),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
impl TryFrom<char> for State {
|
||||
type Error = String;
|
||||
fn try_from(c: char) -> Result<State, String> {
|
||||
match c {
|
||||
'.' => Ok(State::Floor),
|
||||
'#' => Ok(State::Occupied),
|
||||
'L' => Ok(State::Empty),
|
||||
c => Err(format!("Unknown map character: '{}'", c)),
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#[derive(PartialEq)]
|
||||
struct Map {
|
||||
cells: Vec<State>,
|
||||
width: usize,
|
||||
height: usize,
|
||||
}
|
||||
|
||||
impl fmt::Debug for Map {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
write!(f, "{}", self)
|
||||
}
|
||||
}
|
||||
|
||||
impl fmt::Display for Map {
|
||||
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
|
||||
write!(f, "\n")?;
|
||||
for row in self.cells.chunks(self.width) {
|
||||
for c in row {
|
||||
write!(f, "{}", c)?;
|
||||
}
|
||||
write!(f, "\n")?;
|
||||
}
|
||||
Ok(())
|
||||
}
|
||||
}
|
||||
|
||||
impl FromStr for Map {
|
||||
type Err = String;
|
||||
|
||||
fn from_str(s: &str) -> Result<Map, String> {
|
||||
let mut cells = Vec::new();
|
||||
let rows: Vec<_> = s.split("\n").collect();
|
||||
for row in &rows {
|
||||
let c: Result<Vec<_>, _> = row.chars().map(|cell| State::try_from(cell)).collect();
|
||||
cells.extend(c?);
|
||||
}
|
||||
let height = rows.len();
|
||||
let width = cells.len() / height;
|
||||
Ok(Map {
|
||||
cells,
|
||||
height,
|
||||
width,
|
||||
})
|
||||
}
|
||||
}
|
||||
|
||||
use std::ops::{Index, IndexMut};
|
||||
|
||||
impl Index<(usize, usize)> for Map {
|
||||
type Output = State;
|
||||
|
||||
fn index(&self, (x, y): (usize, usize)) -> &Self::Output {
|
||||
&self.cells[x + y * self.width]
|
||||
}
|
||||
}
|
||||
|
||||
impl IndexMut<(usize, usize)> for Map {
|
||||
fn index_mut(&mut self, (x, y): (usize, usize)) -> &mut Self::Output {
|
||||
&mut self.cells[x + y * self.width]
|
||||
}
|
||||
}
|
||||
|
||||
impl Map {
|
||||
fn new(width: usize, height: usize) -> Map {
|
||||
Map {
|
||||
width,
|
||||
height,
|
||||
cells: vec![State::Empty; width * height],
|
||||
}
|
||||
}
|
||||
fn adjacent_count(&self, x: usize, y: usize) -> usize {
|
||||
use std::cmp::min;
|
||||
let x_min = x.saturating_sub(1);
|
||||
let y_min = y.saturating_sub(1);
|
||||
let x_max = min(x + 1, self.width - 1);
|
||||
let y_max = min(y + 1, self.height - 1);
|
||||
|
||||
let mut cnt = 0;
|
||||
for y_off in y_min..=y_max {
|
||||
for x_off in x_min..=x_max {
|
||||
// Skip the current cell
|
||||
if x == x_off && y == y_off {
|
||||
continue;
|
||||
}
|
||||
if self[(x_off, y_off)] == State::Occupied {
|
||||
cnt += 1
|
||||
}
|
||||
}
|
||||
}
|
||||
cnt
|
||||
}
|
||||
|
||||
/// Counts number of occupied seats in 8 cardinal directions. Stops if it hits an empty seat.
|
||||
fn line_of_sight_count(&self, x: usize, y: usize) -> usize {
|
||||
let incs = vec![
|
||||
// Right
|
||||
(1, 0),
|
||||
// Left
|
||||
(-1, 0),
|
||||
// Up
|
||||
(0, -1),
|
||||
// Down
|
||||
(0, 1),
|
||||
// Up-right
|
||||
(1, -1),
|
||||
// Up-left
|
||||
(-1, -1),
|
||||
// Down-right
|
||||
(1, 1),
|
||||
// Down-left
|
||||
(-1, 1),
|
||||
];
|
||||
|
||||
incs.into_iter()
|
||||
.map(|inc| self.shoot(x, y, inc))
|
||||
.filter(|&v| v)
|
||||
.count()
|
||||
}
|
||||
|
||||
/// Iterates over the map using the offsets until it hits an occupied seat or edge.
|
||||
/// If an occupied seat is found before an unoccupied seat or edge, true is returned.
|
||||
/// If an unoccupied seat is found before an occupied seat or edge, false is returned.
|
||||
/// If an edge is hit, false is returned.
|
||||
/// Floors are ignored.
|
||||
fn shoot(&self, x: usize, y: usize, (x_off, y_off): (isize, isize)) -> bool {
|
||||
let mut x = x as isize;
|
||||
let mut y = y as isize;
|
||||
let width = self.width as isize;
|
||||
let height = self.height as isize;
|
||||
loop {
|
||||
x = x + x_off;
|
||||
y = y + y_off;
|
||||
|
||||
// Hit an edge.
|
||||
if x < 0 || y < 0 || x >= width || y >= height {
|
||||
return false;
|
||||
}
|
||||
|
||||
let s = self[(x as usize, y as usize)];
|
||||
if let State::Empty = s {
|
||||
return false;
|
||||
}
|
||||
if let State::Occupied = s {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fn occupied_count(&self) -> usize {
|
||||
self.cells.iter().filter(|&c| c == &State::Occupied).count()
|
||||
}
|
||||
}
|
||||
|
||||
fn step_solution1(map: &Map) -> Map {
|
||||
let mut new_m = Map::new(map.width, map.height);
|
||||
for y in 0..map.height {
|
||||
for x in 0..map.width {
|
||||
// Floor's never change
|
||||
if map[(x, y)] == State::Floor {
|
||||
new_m[(x, y)] = State::Floor;
|
||||
continue;
|
||||
}
|
||||
let new_cell = match map.adjacent_count(x, y) {
|
||||
0 => State::Occupied,
|
||||
c if c >= 4 => State::Empty,
|
||||
_ => map[(x, y)],
|
||||
};
|
||||
new_m[(x, y)] = new_cell;
|
||||
}
|
||||
}
|
||||
new_m
|
||||
}
|
||||
|
||||
fn step_solution2(map: &Map) -> Map {
|
||||
let mut new_m = Map::new(map.width, map.height);
|
||||
for y in 0..map.height {
|
||||
for x in 0..map.width {
|
||||
// Floor's never change
|
||||
if map[(x, y)] == State::Floor {
|
||||
new_m[(x, y)] = State::Floor;
|
||||
continue;
|
||||
}
|
||||
let new_cell = match map.line_of_sight_count(x, y) {
|
||||
0 => State::Occupied,
|
||||
c if c >= 5 => State::Empty,
|
||||
_ => map[(x, y)],
|
||||
};
|
||||
new_m[(x, y)] = new_cell;
|
||||
}
|
||||
}
|
||||
new_m
|
||||
}
|
||||
|
||||
#[aoc_generator(day11)]
|
||||
fn parse(input: &str) -> Map {
|
||||
input.parse().expect("Failed to parse map")
|
||||
}
|
||||
|
||||
#[aoc(day11, part1)]
|
||||
fn solution1(map: &Map) -> usize {
|
||||
let mut prev = step_solution1(map);
|
||||
let mut cur = step_solution1(&prev);
|
||||
while prev != cur {
|
||||
// Show map animating.
|
||||
// println!("{}", cur);
|
||||
prev = cur;
|
||||
cur = step_solution1(&prev);
|
||||
}
|
||||
cur.occupied_count()
|
||||
}
|
||||
|
||||
#[aoc(day11, part2)]
|
||||
fn solution2(map: &Map) -> usize {
|
||||
let mut prev = step_solution2(map);
|
||||
let mut cur = step_solution2(&prev);
|
||||
while prev != cur {
|
||||
// Show map animating.
|
||||
// println!("{}", cur);
|
||||
prev = cur;
|
||||
cur = step_solution2(&prev);
|
||||
}
|
||||
cur.occupied_count()
|
||||
}
|
||||
|
||||
#[cfg(test)]
|
||||
mod tests {
|
||||
use super::*;
|
||||
#[test]
|
||||
fn index() {
|
||||
let m: Map = "#.L\n.#L\n.L#".parse().expect("Failed to parse map");
|
||||
assert_eq!(m[(1, 0)], State::Floor);
|
||||
assert_eq!(m[(0, 1)], State::Floor);
|
||||
assert_eq!(m[(0, 2)], State::Floor);
|
||||
|
||||
assert_eq!(m[(2, 0)], State::Empty);
|
||||
assert_eq!(m[(2, 1)], State::Empty);
|
||||
assert_eq!(m[(1, 2)], State::Empty);
|
||||
|
||||
assert_eq!(m[(0, 0)], State::Occupied);
|
||||
assert_eq!(m[(1, 1)], State::Occupied);
|
||||
assert_eq!(m[(2, 2)], State::Occupied);
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn solution1() {
|
||||
let input = r#"L.LL.LL.LL
|
||||
LLLLLLL.LL
|
||||
L.L.L..L..
|
||||
LLLL.LL.LL
|
||||
L.LL.LL.LL
|
||||
L.LLLLL.LL
|
||||
..L.L.....
|
||||
LLLLLLLLLL
|
||||
L.LLLLLL.L
|
||||
L.LLLLL.LL"#
|
||||
.replace(' ', "");
|
||||
let steps: Vec<_> = vec![
|
||||
r#"#.##.##.##
|
||||
#######.##
|
||||
#.#.#..#..
|
||||
####.##.##
|
||||
#.##.##.##
|
||||
#.#####.##
|
||||
..#.#.....
|
||||
##########
|
||||
#.######.#
|
||||
#.#####.##"#,
|
||||
r#"#.LL.L#.##
|
||||
#LLLLLL.L#
|
||||
L.L.L..L..
|
||||
#LLL.LL.L#
|
||||
#.LL.LL.LL
|
||||
#.LLLL#.##
|
||||
..L.L.....
|
||||
#LLLLLLLL#
|
||||
#.LLLLLL.L
|
||||
#.#LLLL.##"#,
|
||||
r#"#.##.L#.##
|
||||
#L###LL.L#
|
||||
L.#.#..#..
|
||||
#L##.##.L#
|
||||
#.##.LL.LL
|
||||
#.###L#.##
|
||||
..#.#.....
|
||||
#L######L#
|
||||
#.LL###L.L
|
||||
#.#L###.##"#,
|
||||
r#"#.#L.L#.##
|
||||
#LLL#LL.L#
|
||||
L.L.L..#..
|
||||
#LLL.##.L#
|
||||
#.LL.LL.LL
|
||||
#.LL#L#.##
|
||||
..L.L.....
|
||||
#L#LLLL#L#
|
||||
#.LLLLLL.L
|
||||
#.#L#L#.##"#,
|
||||
r#"#.#L.L#.##
|
||||
#LLL#LL.L#
|
||||
L.#.L..#..
|
||||
#L##.##.L#
|
||||
#.#L.LL.LL
|
||||
#.#L#L#.##
|
||||
..L.L.....
|
||||
#L#L##L#L#
|
||||
#.LLLLLL.L
|
||||
#.#L#L#.##"#,
|
||||
]
|
||||
.iter()
|
||||
// Trim whitespace that rustfmt keeps introducing.
|
||||
.map(|m| m.replace(' ', ""))
|
||||
.collect();
|
||||
|
||||
let mut m = input.parse().expect("Failed to parse map");
|
||||
for (i, want_input) in steps.iter().enumerate() {
|
||||
let want: Map = want_input
|
||||
.parse()
|
||||
.expect(&format!("Failed to parse step {}", i));
|
||||
let got = step_solution1(&m);
|
||||
assert_eq!(want, got, "step {}\nm {}", i, m);
|
||||
m = got;
|
||||
}
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn line_of_sight_count() {
|
||||
let test_input = vec![
|
||||
(
|
||||
8,
|
||||
(3, 4),
|
||||
r#".......#.
|
||||
...#.....
|
||||
.#.......
|
||||
.........
|
||||
..#L....#
|
||||
....#....
|
||||
.........
|
||||
#........
|
||||
...#....."#
|
||||
.replace(' ', ""),
|
||||
),
|
||||
(
|
||||
4,
|
||||
(3, 0),
|
||||
r#"#.L#.##.L#
|
||||
#L#####.LL
|
||||
L.#.#..#..
|
||||
##L#.##.##
|
||||
#.##.#L.##
|
||||
#.#####.#L
|
||||
..#.#.....
|
||||
LLL####LL#
|
||||
#.L#####.L
|
||||
#.L####.L#"#
|
||||
.replace(' ', ""),
|
||||
),
|
||||
(
|
||||
0,
|
||||
(1, 1),
|
||||
r#".............
|
||||
.L.L.#.#.#.#.
|
||||
............."#
|
||||
.replace(' ', ""),
|
||||
),
|
||||
(
|
||||
0,
|
||||
(3, 3),
|
||||
r#".##.##.
|
||||
#.#.#.#
|
||||
##...##
|
||||
...L...
|
||||
##...##
|
||||
#.#.#.#
|
||||
.##.##."#
|
||||
.replace(' ', ""),
|
||||
),
|
||||
];
|
||||
for (want, (x, y), input) in test_input {
|
||||
let m: Map = input.parse().expect("Failed to parse map data");
|
||||
assert_eq!(want, m.line_of_sight_count(x, y), "map {}", m);
|
||||
}
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn solution2() {
|
||||
let input = r#"L.LL.LL.LL
|
||||
LLLLLLL.LL
|
||||
L.L.L..L..
|
||||
LLLL.LL.LL
|
||||
L.LL.LL.LL
|
||||
L.LLLLL.LL
|
||||
..L.L.....
|
||||
LLLLLLLLLL
|
||||
L.LLLLLL.L
|
||||
L.LLLLL.LL"#
|
||||
.replace(' ', "");
|
||||
let steps: Vec<_> = vec![
|
||||
r#"#.##.##.##
|
||||
#######.##
|
||||
#.#.#..#..
|
||||
####.##.##
|
||||
#.##.##.##
|
||||
#.#####.##
|
||||
..#.#.....
|
||||
##########
|
||||
#.######.#
|
||||
#.#####.##"#,
|
||||
r#"#.LL.LL.L#
|
||||
#LLLLLL.LL
|
||||
L.L.L..L..
|
||||
LLLL.LL.LL
|
||||
L.LL.LL.LL
|
||||
L.LLLLL.LL
|
||||
..L.L.....
|
||||
LLLLLLLLL#
|
||||
#.LLLLLL.L
|
||||
#.LLLLL.L#"#,
|
||||
r#"#.L#.##.L#
|
||||
#L#####.LL
|
||||
L.#.#..#..
|
||||
##L#.##.##
|
||||
#.##.#L.##
|
||||
#.#####.#L
|
||||
..#.#.....
|
||||
LLL####LL#
|
||||
#.L#####.L
|
||||
#.L####.L#"#,
|
||||
r#"#.L#.L#.L#
|
||||
#LLLLLL.LL
|
||||
L.L.L..#..
|
||||
##LL.LL.L#
|
||||
L.LL.LL.L#
|
||||
#.LLLLL.LL
|
||||
..L.L.....
|
||||
LLLLLLLLL#
|
||||
#.LLLLL#.L
|
||||
#.L#LL#.L#"#,
|
||||
r#"#.L#.L#.L#
|
||||
#LLLLLL.LL
|
||||
L.L.L..#..
|
||||
##L#.#L.L#
|
||||
L.L#.#L.L#
|
||||
#.L####.LL
|
||||
..#.#.....
|
||||
LLL###LLL#
|
||||
#.LLLLL#.L
|
||||
#.L#LL#.L#"#,
|
||||
r#"#.L#.L#.L#
|
||||
#LLLLLL.LL
|
||||
L.L.L..#..
|
||||
##L#.#L.L#
|
||||
L.L#.LL.L#
|
||||
#.LLLL#.LL
|
||||
..#.L.....
|
||||
LLL###LLL#
|
||||
#.LLLLL#.L
|
||||
#.L#LL#.L#"#,
|
||||
]
|
||||
.iter()
|
||||
.map(|s| s.replace(' ', ""))
|
||||
.collect();
|
||||
let mut m = input.parse().expect("Failed to parse map");
|
||||
for (i, want_input) in steps.iter().enumerate() {
|
||||
let want: Map = want_input
|
||||
.parse()
|
||||
.expect(&format!("Failed to parse step {}", i));
|
||||
let got = step_solution2(&m);
|
||||
assert_eq!(want, got, "step {}\nm {}", i, m);
|
||||
m = got;
|
||||
}
|
||||
}
|
||||
}
|
||||
@ -1,5 +1,6 @@
|
||||
pub mod day1;
|
||||
pub mod day10;
|
||||
pub mod day11;
|
||||
pub mod day2;
|
||||
pub mod day3;
|
||||
pub mod day4;
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user