djweber12/advent_of_code
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

getting started on part 2 not done

Browse Source
This commit is contained in:
Daniel Weber 2024-12-12 07:31:50 -05:00
parent 553ecfa4f6
commit 7f2e09616c
1 changed files with 31 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
2024/day12/main.py
View File

@ -10,7 +10,7 @@ VISITED = set()
LIMITS = [0,0] LIMITS = [0,0]
CURRENT_PLOT = () CURRENT_PLOT = ()
def add_p_and_a(input, cp, a, p): def add_p_and_ap1(input, cp, a, p):
ft = input[cp[0]][cp[1]] ft = input[cp[0]][cp[1]]
G[CURRENT_PLOT].append(cp) G[CURRENT_PLOT].append(cp)
VISITED.add(tuple(cp)) VISITED.add(tuple(cp))
@ -18,7 +18,7 @@ def add_p_and_a(input, cp, a, p):
np = [cp[0]+i[0], cp[1]+i[1]] np = [cp[0]+i[0], cp[1]+i[1]]
if 0 <= np[0] < LIMITS[0] and 0 <= np[1] < LIMITS[1] and tuple(np) not in VISITED: if 0 <= np[0] < LIMITS[0] and 0 <= np[1] < LIMITS[1] and tuple(np) not in VISITED:
if input[np[0]][np[1]] == ft: if input[np[0]][np[1]] == ft:
a, p = add_p_and_a(input, np, a, p) a, p = add_p_and_ap1(input, np, a, p)
a += 1 a += 1
p += 4 p += 4
for j in [[1,0],[0,1],[-1,0],[0,-1]]: for j in [[1,0],[0,1],[-1,0],[0,-1]]:
@ -27,15 +27,27 @@ def add_p_and_a(input, cp, a, p):
if 0 <= nnp[0] < LIMITS[0] and 0 <= nnp[1] < LIMITS[1]: if 0 <= nnp[0] < LIMITS[0] and 0 <= nnp[1] < LIMITS[1]:
if input[nnp[0]][nnp[1]] == ft: if input[nnp[0]][nnp[1]] == ft:
p -= 1 p -= 1
return a, p return a, p
def add_p_and_ap2(input, cp, a, p):
ft = input[cp[0]][cp[1]]
G[CURRENT_PLOT].append(cp)
VISITED.add(tuple(cp))
for i in [[1,0],[0,1],[-1,0],[0,-1]]:
np = [cp[0]+i[0], cp[1]+i[1]]
if 0 <= np[0] < LIMITS[0] and 0 <= np[1] < LIMITS[1] and tuple(np) not in VISITED:
if input[np[0]][np[1]] == ft:
a, p = add_p_and_ap2(input, np, a, p)
a += 1
p += 4
for j in [[1,0],[0,1]]:
for i in [-1, 1]:
nnp = [cp[0]+j[0], cp[1]+j[1]]
#check the sides, to see if the perimiter needs to be decrimented
if 0 <= nnp[0] < LIMITS[0] and 0 <= nnp[1] < LIMITS[1]:
if input[nnp[0]][nnp[1]] == ft:
p -= 1
return a, p
def part_one(input): def part_one(input):
VISITED.clear() VISITED.clear()
@ -44,13 +56,21 @@ def part_one(input):
for col, j in enumerate(i): for col, j in enumerate(i):
if (row, col) not in VISITED: if (row, col) not in VISITED:
CURRENT_PLOT = (row, col) CURRENT_PLOT = (row, col)
a, p = add_p_and_a(input, [row, col], 0, 0) a, p = add_p_and_ap1(input, [row, col], 0, 0)
p1 += a*p p1 += a*p
print("Part 1: ", p1) print("Part 1: ", p1)
def part_two(input): def part_two(input):
pass VISITED.clear()
p2 = 0
for row, i in enumerate(input):
for col, j in enumerate(i):
if (row, col) not in VISITED:
CURRENT_PLOT = (row, col)
a, p = add_p_and_ap2(input, [row, col], 0, 0)
p2 += a*p
print("Part 2: ", p2)
def main(): def main():
f = open("input.txt", 'r') f = open("input.txt", 'r')