From 168cc9d9846d0f6f977a4fb7d46310faecf15fa8 Mon Sep 17 00:00:00 2001 From: Stefan Nygaard Hansen Date: Thu, 21 Dec 2023 10:32:33 +0100 Subject: [PATCH] Edit solution --- 2023/day21/solution.py | 17 +++++++++++------ 1 file changed, 11 insertions(+), 6 deletions(-) diff --git a/2023/day21/solution.py b/2023/day21/solution.py index 3f6889a..08bb30f 100644 --- a/2023/day21/solution.py +++ b/2023/day21/solution.py @@ -1,3 +1,5 @@ +import numpy as np + with open("input") as f: inp = f.read().strip().split("\n") @@ -21,7 +23,8 @@ steps = 26501365 rest = steps % R -for m in range(rest+2*R): +g = [] +for step in range(rest+2*R): new_ps = set() for p in ps: for dp in [-1, 1, 1j, -1j]: @@ -30,15 +33,17 @@ if grid[cor_p] == ".": new_ps.add(new_p) ps = new_ps - if m == 63: + if step == 63: print(len(ps)) # Part 1 - if (m+1) % R == rest: - print((m+1)//R, m+1, len(ps)) # Points to fit + if (step+1) % R == rest: + g.append(len(ps)) # Part 2 + +coefs = np.polyfit([0, 1, 2], g, 2) +coefs = list(map(round, coefs)) -# This is the corresponding polynomial. def n_gardens(steps): - return 3738+14836*steps+14696*steps**2 + return coefs[2] + coefs[1]*steps + coefs[0]*steps**2 print(n_gardens(steps // R)) \ No newline at end of file