-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
feat: simplified Github workflow by running ci/run_all.sh instead of …
…each day separately
- Loading branch information
Showing
5 changed files
with
18 additions
and
136 deletions.
There are no files selected for viewing
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,12 @@ | ||
{ | ||
"year": 2023, | ||
"day": 23, | ||
"level": "first", | ||
"title": "A Long Walk", | ||
"stars": null, | ||
"solution": {}, | ||
"input": null, | ||
"brief": { | ||
"first": "The Elves resume water filtering operations! Clean water starts flowing over the edge of Island Island.\n\nThey offer to help *you* go over the edge of Island Island, too! Just hold on tight to one end of this impossibly long rope and they'll lower you down a safe distance from the massive waterfall you just created.\n\nAs you finally reach Snow Island, you see that the water isn't really reaching the ground: it's being *absorbed by the air* itself. It looks like you'll finally have a little downtime while the moisture builds up to snow-producing levels. Snow Island is pretty scenic, even without any snow; why not take a walk?\n\nThere's a map of nearby hiking trails (your puzzle input) that indicates *paths* (`.`), *forest* (`#`), and steep *slopes* (`^`, `>`, `v`, and `<`).\n\nFor example:\n\n```\n#.#####################\n#.......#########...###\n#######.#########.#.###\n###.....#.>.>.###.#.###\n###v#####.#v#.###.#.###\n###.>...#.#.#.....#...#\n###v###.#.#.#########.#\n###...#.#.#.......#...#\n#####.#.#.#######.#.###\n#.....#.#.#.......#...#\n#.#####.#.#.#########v#\n#.#...#...#...###...>.#\n#.#.#v#######v###.###v#\n#...#.>.#...>.>.#.###.#\n#####v#.#.###v#.#.###.#\n#.....#...#...#.#.#...#\n#.#########.###.#.#.###\n#...###...#...#...#.###\n###.###.#.###v#####v###\n#...#...#.#.>.>.#.>.###\n#.###.###.#.###.#.#v###\n#.....###...###...#...#\n#####################.#\n\n```\n\nYou're currently on the single path tile in the top row; your goal is to reach the single path tile in the bottom row. Because of all the mist from the waterfall, the slopes are probably quite *icy*; if you step onto a slope tile, your next step must be *downhill* (in the direction the arrow is pointing). To make sure you have the most scenic hike possible, *never step onto the same tile twice*. What is the longest hike you can take?\n\nIn the example above, the longest hike you can take is marked with `O`, and your starting position is marked `S`:\n\n```\n#S#####################\n#OOOOOOO#########...###\n#######O#########.#.###\n###OOOOO#OOO>.###.#.###\n###O#####O#O#.###.#.###\n###OOOOO#O#O#.....#...#\n###v###O#O#O#########.#\n###...#O#O#OOOOOOO#...#\n#####.#O#O#######O#.###\n#.....#O#O#OOOOOOO#...#\n#.#####O#O#O#########v#\n#.#...#OOO#OOO###OOOOO#\n#.#.#v#######O###O###O#\n#...#.>.#...>OOO#O###O#\n#####v#.#.###v#O#O###O#\n#.....#...#...#O#O#OOO#\n#.#########.###O#O#O###\n#...###...#...#OOO#O###\n###.###.#.###v#####O###\n#...#...#.#.>.>.#.>O###\n#.###.###.#.###.#.#O###\n#.....###...###...#OOO#\n#####################O#\n\n```\n\nThis hike contains `*94*` steps. (The other possible hikes you could have taken were `90`, `86`, `82`, `82`, and `74` steps long.)\n\nFind the longest hike you can take through the hiking trails listed on your map. *How many steps long is the longest hike?*\n\nTo begin, [get your puzzle input](23/input).\n\nAnswer:" | ||
} | ||
} |
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
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
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
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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,5 @@ | ||
#![allow(unused)] | ||
|
||
use aoc::Grid; | ||
use aoc::Int; | ||
use std::fmt::Debug; | ||
|