FrederikBaerentsen/AdventOfCode
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Solved 2024/08 P1

Browse Source
This commit is contained in:
FrederikBaerentsen 2024-12-08 19:24:10 +01:00
parent f3f88f47d1
commit 88f2b09174
1 changed files with 69 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

77
2024/08/solution.py
View File

@ -5,37 +5,37 @@ sys.path.insert(0, '../../')
from fred import list2int,get_re,nprint,lprint,grid_valid,loadFile,subTuples,addTuples,toGrid,get_value_in_direction
start_time = time.time()
input_f = 'test'
input_f = 'test3'
part = 1
part = 2
#########################################
# #
# Part 1 #
# #
#########################################
def findAntinodes(grid:list,pos:set,current_node:set):
print('Found',current_node,'at',pos)
if part == 1:
def findAntinodes(grid:list,pos:set,current_node:set):
#print('Found',current_node,'at',pos)
antinodes = []
for row in range(pos[0],len(grid)):
for col in range(0,len(grid[1])):
print(row,col)
if get_value_in_direction(grid,(row,col)) == current_node and (row,col) != pos:
print('Matched with',(row,col))
#print('Matched with',(row,col))
s = subTuples((row,col-1),pos)
a = addTuples(s,(row,col+1))
if grid_valid(s[0],s[1],grid):
print('Antinode at',s)
antinodes.append(s)
if grid_valid(a[0],a[1],grid):
print('Antinode at',a)
antinodes.append(a)
dist = subTuples((row,col),pos)
add = addTuples(dist,(row,col))
sub = subTuples(pos,dist)
if grid_valid(sub[0],sub[1],grid):
#print('Antinode at',sub)
antinodes.append(sub)
if grid_valid(add[0],add[1],grid):
#print('Antinode at',add)
antinodes.append(add)
return antinodes
if part == 1:
grid = toGrid(input_f)
nprint(grid)
@ -47,7 +47,7 @@ if part == 1:
current_node = get_value_in_direction(grid,(row,col))
if current_node != '.':
antinodes += findAntinodes(grid,(row,col),current_node)
print(antinodes)
#print(antinodes)
for idx, i in enumerate(grid):
for jdx, j in enumerate(i):
if (idx, jdx) in antinodes:
@ -56,6 +56,8 @@ if part == 1:
print(grid[idx][jdx], end=' ') # Regular grid element
print()
print(len(set(antinodes)))
#########################################
# #
@ -63,6 +65,47 @@ if part == 1:
# #
#########################################
if part == 2:
exit()
def findAntinodes(grid:list,pos:set,current_node:set):
#print('Found',current_node,'at',pos)
antinodes = []
for row in range(pos[0],len(grid)):
for col in range(0,len(grid[1])):
if get_value_in_direction(grid,(row,col)) == current_node and (row,col) != pos:
#print('Matched with',(row,col))
dist = subTuples((row,col),pos)
add = addTuples(dist,(row,col))
sub = subTuples(pos,dist)
if grid_valid(sub[0],sub[1],grid):
#print('Antinode at',sub)
antinodes.append(sub)
if grid_valid(add[0],add[1],grid):
#print('Antinode at',add)
antinodes.append(add)
return antinodes
grid = toGrid(input_f)
nprint(grid)
size = (len(grid),len(grid[0]))
antinodes = []
for row in range(0,size[0]):
for col in range(0,size[1]):
current_node = get_value_in_direction(grid,(row,col))
if current_node != '.':
antinodes += findAntinodes(grid,(row,col),current_node)
#print(antinodes)
for idx, i in enumerate(grid):
for jdx, j in enumerate(i):
if (idx, jdx) in antinodes:
print('#', end=' ') # Print sign
else:
print(grid[idx][jdx], end=' ') # Regular grid element
print()
print(len(set(antinodes)))
print("--- %s seconds ---" % (time.time() - start_time))