96 lines
3.2 KiB
Plaintext
96 lines
3.2 KiB
Plaintext
|
Advent of Code
|
|||
|
|
|
|||
|
|
--- Day 19: A Series of Tubes ---
|
|||
|
|
|
|||
|
|
Somehow, a network packet got lost and ended up here. It's trying to follow a routing diagram (your puzzle input),
|
|||
|
|
but it's confused about where to go.
|
|||
|
|
|
|||
|
|
Its starting point is just off the top of the diagram. Lines (drawn with |, -, and +) show the path it needs to
|
|||
|
|
take, starting by going down onto the only line connected to the top of the diagram. It needs to follow this path
|
|||
|
|
until it reaches the end (located somewhere within the diagram) and stop there.
|
|||
|
|
|
|||
|
|
Sometimes, the lines cross over each other; in these cases, it needs to continue going the same direction, and
|
|||
|
|
only turn left or right when there's no other option. In addition, someone has left letters on the line; these
|
|||
|
|
also don't change its direction, but it can use them to keep track of where it's been. For example:
|
|||
|
|
|
|||
|
|
|
|
|||
|
|
| +--+
|
|||
|
|
A | C
|
|||
|
|
F---|----E|--+
|
|||
|
|
| | | D
|
|||
|
|
+B-+ +--+
|
|||
|
|
|
|||
|
|
|
|||
|
|
Given this diagram, the packet needs to take the following path:
|
|||
|
|
|
|||
|
|
• Starting at the only line touching the top of the diagram, it must go down, pass through A, and continue
|
|||
|
|
onward to the first +.
|
|||
|
|
• Travel right, up, and right, passing through B in the process.
|
|||
|
|
• Continue down (collecting C), right, and up (collecting D).
|
|||
|
|
• Finally, go all the way left through E and stopping at F.
|
|||
|
|
|
|||
|
|
Following the path to the end, the letters it sees on its path are ABCDEF.
|
|||
|
|
|
|||
|
|
The little packet looks up at you, hoping you can help it find the way. What letters will it see (in the order it
|
|||
|
|
would see them) if it follows the path? (The routing diagram is very wide; make sure you view it without line
|
|||
|
|
wrapping.)
|
|||
|
|
|
|||
|
|
Your puzzle answer was __________________.
|
|||
|
|
|
|||
|
|
--- Part Two ---
|
|||
|
|
|
|||
|
|
The packet is curious how many steps it needs to go.
|
|||
|
|
|
|||
|
|
For example, using the same routing diagram from the example above...
|
|||
|
|
|
|||
|
|
|
|
|||
|
|
| +--+
|
|||
|
|
A | C
|
|||
|
|
F---|--|-E---+
|
|||
|
|
| | | D
|
|||
|
|
+B-+ +--+
|
|||
|
|
|
|||
|
|
|
|||
|
|
...the packet would go:
|
|||
|
|
|
|||
|
|
• 6 steps down (including the first line at the top of the diagram).
|
|||
|
|
• 3 steps right.
|
|||
|
|
• 4 steps up.
|
|||
|
|
• 3 steps right.
|
|||
|
|
• 4 steps down.
|
|||
|
|
• 3 steps right.
|
|||
|
|
• 2 steps up.
|
|||
|
|
• 13 steps left (including the F it stops on).
|
|||
|
|
|
|||
|
|
This would result in a total of 38 steps.
|
|||
|
|
|
|||
|
|
How many steps does the packet need to go?
|
|||
|
|
|
|||
|
|
Your puzzle answer was _________.
|
|||
|
|
|
|||
|
|
Both parts of this puzzle are complete! They provide two gold stars: **
|
|||
|
|
|
|||
|
|
At this point, you should return to your advent calendar and try another puzzle.
|
|||
|
|
|
|||
|
|
If you still want to see it, you can get your puzzle input.
|
|||
|
|
|
|||
|
|
References
|
|||
|
|
|
|||
|
|
Visible links
|
|||
|
|
. http://adventofcode.com/
|
|||
|
|
. http://adventofcode.com/2017/about
|
|||
|
|
. http://adventofcode.com/2017/support
|
|||
|
|
. http://adventofcode.com/2017/events
|
|||
|
|
. http://adventofcode.com/2017/settings
|
|||
|
|
. http://adventofcode.com/2017/auth/logout
|
|||
|
|
. http://adventofcode.com/2017
|
|||
|
|
. http://adventofcode.com/2017
|
|||
|
|
. http://adventofcode.com/2017/leaderboard
|
|||
|
|
. http://adventofcode.com/2017/stats
|
|||
|
|
. http://adventofcode.com/2017/sponsors
|
|||
|
|
. http://adventofcode.com/2017/sponsors
|
|||
|
|
. https://teespring.com/advent-of-code
|
|||
|
|
. https://teespring.com/advent-of-code-eu
|
|||
|
|
. http://adventofcode.com/2017
|
|||
|
|
. http://adventofcode.com/2017/day/19/input
|