kamov/advent-of-code
1
0
Fork 0
Code Issues Pull requests Packages Projects Releases Wiki Activity

Update day11.py

Browse source
This commit is contained in:
kamoshi 2020-12-11 18:10:06 +01:00 committed by GitHub
parent cce67dbbc9
commit b08631fb85
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 16 additions and 23 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

37
2020/Python/day11.py
View file

@ -10,20 +10,19 @@ def parse_data() -> list[str]:
return data return data
def check_occupied(x: int, y: int, data: list[str]) -> int: # Count occupied seats *adjacent* to the seat at position (x, y)
if 0 <= x < len(data[0]) and 0 <= y < len(data): def count_occupied_adj(x: int, y: int, data: list[str]) -> int:
if data[y][x] == '#':
def check_occupied(_x: int, _y: int, _data: list[str]) -> int:
if 0 <= _x < len(data[0]) and 0 <= _y < len(data):
if data[_y][_x] == '#':
return 1 return 1
return 0 return 0
places = [(-1, -1), (-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 0), (1, 1)]
def count_occu_adj(x: int, y: int, data: list[str]) -> int:
result = 0 result = 0
for _x in range(x - 1, x + 2): for _x, _y in places:
for _y in range(y - 1, y + 2): result += check_occupied(x + _x, y + _y, data)
if _x == 0 and _y == 0:
continue
result += check_occupied(_x, _y, data)
return result return result
@ -32,9 +31,9 @@ def generate_new_grid(past_data: list[str]):
for y in range(len(past_data)): for y in range(len(past_data)):
line = "" line = ""
for x in range(len(past_data[0])): for x in range(len(past_data[0])):
if past_data[y][x] == "#" and count_occu_adj(x, y, past_data) > 4: if past_data[y][x] == "#" and count_occupied_adj(x, y, past_data) >= 4:
new_char = 'L' new_char = 'L'
elif past_data[y][x] == 'L' and count_occu_adj(x, y, past_data) == 0: elif past_data[y][x] == 'L' and count_occupied_adj(x, y, past_data) == 0:
new_char = '#' new_char = '#'
else: else:
new_char = past_data[y][x] new_char = past_data[y][x]
@ -59,21 +58,15 @@ def find_stable_state(grid: list[str], limit_iter: int = 10000) -> Union[None, l
grid = new_state grid = new_state
return None return None
# Works for the example,
# doesn't work for the real imput???
# Need to do something later
def solve_p1(input_data: list[str]) -> int: def solve_p1(input_data: list[str]) -> int:
final_state = find_stable_state(input_data) final_state = find_stable_state(input_data)
if final_state is None: if final_state is None:
return -1 return -1
result = 0 result = 0
print(final_state) for line in final_state:
for y in range(len(final_state)): result += line.count('#')
for x in range(len(final_state[0])):
if final_state[y][x] == '#':
result += 1
return result return result
DATA = parse_data() print(solve_p1(parse_data()))
print(solve_p1(DATA))