aboutsummaryrefslogtreecommitdiff
path: root/2025/08/a.py
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano@tronto.net>2025-12-08 07:29:26 +0100
committerSebastiano Tronto <sebastiano@tronto.net>2025-12-08 07:29:26 +0100
commit5d69f923116a2b251a445c0cb9e6f23551ad686a (patch)
tree42dfa409c6198f6796b4e8513d01bbdb0a00725e /2025/08/a.py
parent01c2cd358b3f693181fa86e82414b3e32f9a890e (diff)
downloadaoc-5d69f923116a2b251a445c0cb9e6f23551ad686a.tar.gz
aoc-5d69f923116a2b251a445c0cb9e6f23551ad686a.zip
Day 8 2025
Diffstat (limited to '2025/08/a.py')
-rw-r--r--2025/08/a.py30
1 files changed, 28 insertions, 2 deletions
diff --git a/2025/08/a.py b/2025/08/a.py
index 5fdb11b..1980414 100644
--- a/2025/08/a.py
+++ b/2025/08/a.py
@@ -1,6 +1,32 @@
1import fileinput 1import fileinput
2 2
3N = 1000 # Change to 10 for test case
4
3with fileinput.input() as lines: 5with fileinput.input() as lines:
4 for line in lines: 6 pts = [tuple(int(x) for x in line[:-1].split(',')) for line in lines]
5 ... 7
8r = range(len(pts))
9
10def dist(p, q):
11 return (p[0]-q[0])**2 + (p[1]-q[1])**2 + (p[2]-q[2])**2
12
13d = sorted([(dist(pts[i], pts[j]), i, j) for i in r for j in r if j > i])
14
15rep = [i for i in r]
16
17def findrep(i):
18 return i if rep[i] == i else findrep(rep[i])
19
20def joinrep(i, j):
21 rep[findrep(i)] = findrep(j)
22
23for i in range(N):
24 j, k = d[i][1], d[i][2]
25 if findrep(j) != findrep(k):
26 joinrep(j, k)
6 27
28sizes = [[0, i] for i in r]
29for i in r:
30 sizes[findrep(i)][0] += 1
31sizes.sort()
32print(sizes[-1][0] * sizes[-2][0] * sizes[-3][0])

Generated with cgit - Back to sebastiano.tronto.net