From 553ecfa4f6bf9bcc2a07bb88f10afc366964d9f5 Mon Sep 17 00:00:00 2001 From: Daniel Weber Date: Thu, 12 Dec 2024 07:07:44 -0500 Subject: [PATCH] Part 1 --- 2024/day12/main.py | 65 ++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 65 insertions(+) create mode 100644 2024/day12/main.py diff --git a/2024/day12/main.py b/2024/day12/main.py new file mode 100644 index 0000000..07926b0 --- /dev/null +++ b/2024/day12/main.py @@ -0,0 +1,65 @@ +import sys +import os +sys.path.insert(1, os.path.abspath('../../')) +from python_tools.aoc_utils import * + +import collections as C + +G = C.defaultdict(list) +VISITED = set() +LIMITS = [0,0] +CURRENT_PLOT = () + +def add_p_and_a(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_a(input, np, a, p) + a += 1 + p += 4 + for j in [[1,0],[0,1],[-1,0],[0,-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): + VISITED.clear() + p1 = 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_a(input, [row, col], 0, 0) + p1 += a*p + print("Part 1: ", p1) + + +def part_two(input): + pass + +def main(): + f = open("input.txt", 'r') + contents = [list(x.strip()) for x in f.readlines()] + LIMITS[0] = len(contents) + LIMITS[1] = len(contents[0]) + part_one(contents) + part_two(contents) + +if __name__ == "__main__": + main() +