From 000ad0f9ec9ee30a8ec3f0632598ace2f6853d20 Mon Sep 17 00:00:00 2001
From: Tom Weber <tom@weber.codes>
Date: Sat, 16 Dec 2023 14:50:16 +0100
Subject: [PATCH] day 11 updated

---
 python/day11.py | 60 ++-----------------------------------------------
 1 file changed, 2 insertions(+), 58 deletions(-)

diff --git a/python/day11.py b/python/day11.py
index 866e869..5ece315 100644
--- a/python/day11.py
+++ b/python/day11.py
@@ -16,29 +16,6 @@ def empty_spaces(mat):
             empty_cols.append(i)
     return empty_lines, empty_cols
 
-def expand_mat(mat):
-    empty_lines = []
-    for idx, line in enumerate(mat):
-        if sum(line) == 0:
-            empty_lines.append(idx)
-    while empty_lines:
-        idx = empty_lines.pop(0)
-        mat.insert(idx, [0 for x in range(len(mat[0]))])
-        if empty_lines:
-            empty_lines = [x+1 for x in empty_lines]
-    empty_cols = []
-    for i in range(len(mat[0])):
-        col = [x[i] for x in mat]
-        if sum(col) == 0:
-            empty_cols.append(i)
-    while empty_cols:
-        idx = empty_cols.pop(0)
-        for line in mat:
-            line.insert(idx, 0)
-        if empty_cols:
-            empty_cols = [x+1 for x in empty_cols]
-    return mat
-
 def galaxies(mat):
     coords = []
     for idx, line in enumerate(mat):
@@ -47,14 +24,6 @@ def galaxies(mat):
                 coords.append((idx, jdx))
     return coords
 
-def bfsdistances(coords, mat):
-    dists = [[0 for x in range(len(coords))] for y in range(len(coords))]
-    for idx, coord in enumerate(coords):
-        paths = bfs(coord, mat)
-        for jdx, path in enumerate(paths):
-            dists[idx][jdx] = len(path)
-    return dists
-
 def manhattendistances(coords, expansions, expansionrate=1000000-1):
     (rows, cols) = expansion
     dists = [[0 for x in range(len(coords))] for y in range(len(coords))]
@@ -71,36 +40,11 @@ def manhatten(x,d):
     (dx, dy) = d
     return abs(x-dx) + abs(y-dy)
 
-def bfs(start, maze):
-    paths = []
-    directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]
-    stack = [(start, [])]
-    visited = [[0 for x in range(len(mat[0]))] for y in range(len(mat))]
-    visited[start[0]][start[1]] = 1
-    while stack:
-        (x,y), path = stack.pop(0)
-        for dx, dy in directions:
-            newx, newy = x+dx, y+dy
-            if 0 <= newx < len(mat) and 0 <= newy < len(mat[0]) and visited[newx][newy] == 0:
-                new_path = path + [(newx, newy)]
-                if mat[newx][newy] == 1:
-                    paths.append(new_path)
-                else:
-                    stack.append(((newx, newy), new_path))
-                visited[newx][newy] = 1
-
-    return paths
-        
-
 
 mat = mkmat(lines)
 expansion = empty_spaces(mat)
-#mat = expand_mat(mat)
 coords = galaxies(mat)
 dists = manhattendistances(coords, expansion)
-s = 0
-for d in dists:
-   # print(len(d))
-    s += sum(d)
-print(s//2)
 
+print(f"Solution for Part 1: {sum([sum(i) for i in zip(*manhattendistances(coords, expansion, 1))])//2}")
+print(f"Solution for Part 1: {sum([sum(i) for i in zip(*manhattendistances(coords, expansion, 1000000-1))])//2}")