44 lines
1.2 KiB
Python
44 lines
1.2 KiB
Python
from typing import Any, Callable, Iterator, Literal
|
|
|
|
from ..base import BaseSolver
|
|
|
|
|
|
def split(block: list[str], axis: Literal[0, 1], count: int) -> int:
|
|
n_iter = len(block) if axis == 0 else len(block[0])
|
|
n_check = len(block) if axis == 1 else len(block[0])
|
|
|
|
at: Callable[[int, int], str] = (
|
|
(lambda i, j: block[i][j]) if axis == 0 else (lambda i, j: block[j][i])
|
|
)
|
|
|
|
for i in range(n_iter - 1):
|
|
size = min(i + 1, n_iter - i - 1)
|
|
if (
|
|
sum(
|
|
at(i - s, j) != at(i + 1 + s, j)
|
|
for s in range(0, size)
|
|
for j in range(n_check)
|
|
)
|
|
== count
|
|
):
|
|
return i + 1
|
|
|
|
return 0
|
|
|
|
|
|
class Solver(BaseSolver):
|
|
def solve(self, input: str) -> Iterator[Any]:
|
|
blocks = [block.splitlines() for block in input.split("\n\n")]
|
|
|
|
# part 1
|
|
yield sum(
|
|
split(block, axis=1, count=0) + 100 * split(block, axis=0, count=0)
|
|
for block in blocks
|
|
)
|
|
|
|
# part 2
|
|
yield sum(
|
|
split(block, axis=1, count=1) + 100 * split(block, axis=0, count=1)
|
|
for block in blocks
|
|
)
|