117 lines
3.6 KiB
Python
117 lines
3.6 KiB
Python
from enum import Enum
|
|
from typing import Tuple
|
|
|
|
|
|
class Direction(Enum):
|
|
NORTH = 1
|
|
EAST = 2
|
|
SOUTH = 4
|
|
WEST = 8
|
|
|
|
|
|
def parse_data() -> list[(str, int)]:
|
|
data = []
|
|
with open("input.txt") as file:
|
|
for line in file:
|
|
char, *number = line.rstrip()
|
|
data.append((char, int("".join(number))))
|
|
return data
|
|
|
|
|
|
def apply_command(curr_pos: Tuple[int, int], curr_dir: Direction, command: Tuple[str, int]) -> ((int, int), Direction):
|
|
curr_x, curr_y = curr_pos
|
|
_char, _number = command
|
|
|
|
def find_new_direction(old_direction: Direction, char: str, number: int) -> Direction:
|
|
if char == "L":
|
|
result = (old_direction.value << 4) >> ((number % 360) // 90)
|
|
if result > 8:
|
|
result = result >> 4
|
|
return Direction(result)
|
|
elif char == "R":
|
|
result = old_direction.value << ((number % 360) // 90)
|
|
if result > 8:
|
|
result = result >> 4
|
|
return Direction(result)
|
|
|
|
if _char == 'N':
|
|
return (curr_x, curr_y + _number), curr_dir
|
|
elif _char == 'S':
|
|
return (curr_x, curr_y - _number), curr_dir
|
|
elif _char == 'E':
|
|
return (curr_x - _number, curr_y), curr_dir
|
|
elif _char == 'W':
|
|
return (curr_x + _number, curr_y), curr_dir
|
|
|
|
elif _char in "LR":
|
|
return curr_pos, find_new_direction(curr_dir, _char, _number)
|
|
|
|
elif _char == 'F':
|
|
if curr_dir is Direction.NORTH:
|
|
return (curr_x, curr_y + _number), curr_dir
|
|
elif curr_dir is Direction.SOUTH:
|
|
return (curr_x, curr_y - _number), curr_dir
|
|
elif curr_dir is Direction.EAST:
|
|
return (curr_x - _number, curr_y), curr_dir
|
|
elif curr_dir is Direction.WEST:
|
|
return (curr_x + _number, curr_y), curr_dir
|
|
|
|
|
|
def solve_p1(data: list[Tuple[str, int]]) -> int:
|
|
current_direction = Direction.EAST
|
|
current_position = 0, 0
|
|
for command in data:
|
|
current_position, current_direction = apply_command(current_position, current_direction, command)
|
|
final_x, final_y = current_position
|
|
return abs(final_x)+abs(final_y)
|
|
|
|
|
|
def apply_command2(curr_pos: Tuple[int, int], curr_wp: Tuple[int, int], command: Tuple[str, int]) -> Tuple[Tuple[int, int], Tuple[int, int]]:
|
|
curr_x, curr_y = curr_pos
|
|
wp_x, wp_y = curr_wp
|
|
_char, _number = command
|
|
|
|
def find_rotated_wp(_curr_wp: Tuple[int, int], how: str, degrees: int) -> (int, int):
|
|
degrees = degrees % 360
|
|
_wp_x, _wp_y = _curr_wp
|
|
if how == 'R':
|
|
degrees = 360 - degrees
|
|
|
|
if degrees == 0:
|
|
return _wp_x, _wp_y
|
|
elif degrees == 90:
|
|
return -_wp_y, _wp_x
|
|
elif degrees == 180:
|
|
return -_wp_x, -_wp_y
|
|
elif degrees == 270:
|
|
return _wp_y, -_wp_x
|
|
|
|
if _char == 'N':
|
|
return curr_pos, (wp_x, wp_y + _number)
|
|
elif _char == 'S':
|
|
return curr_pos, (wp_x, wp_y - _number)
|
|
elif _char == 'E':
|
|
return curr_pos, (wp_x + _number, wp_y)
|
|
elif _char == 'W':
|
|
return curr_pos, (wp_x - _number, wp_y)
|
|
|
|
elif _char in "LR":
|
|
return curr_pos, find_rotated_wp(curr_wp, _char, _number)
|
|
|
|
elif _char == 'F':
|
|
return (curr_x + wp_x * _number, curr_y + wp_y * _number), (wp_x, wp_y)
|
|
|
|
|
|
def solve_p2(data: list[Tuple[str, int]]) -> int:
|
|
current_waypoint = (10, 1)
|
|
current_position = (0, 0)
|
|
for command in data:
|
|
current_position, current_waypoint = apply_command2(current_position, current_waypoint, command)
|
|
final_x, final_y = current_position
|
|
return abs(final_x)+abs(final_y)
|
|
|
|
|
|
DATA = parse_data()
|
|
print(solve_p1(DATA))
|
|
print(solve_p2(DATA))
|