diff options
Diffstat (limited to '2025/08')
| -rw-r--r-- | 2025/08/a.py | 30 | ||||
| -rw-r--r-- | 2025/08/b.py | 26 |
2 files changed, 54 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 @@ | |||
| 1 | import fileinput | 1 | import fileinput |
| 2 | 2 | ||
| 3 | N = 1000 # Change to 10 for test case | ||
| 4 | |||
| 3 | with fileinput.input() as lines: | 5 | with 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 | |
| 8 | r = range(len(pts)) | ||
| 9 | |||
| 10 | def dist(p, q): | ||
| 11 | return (p[0]-q[0])**2 + (p[1]-q[1])**2 + (p[2]-q[2])**2 | ||
| 12 | |||
| 13 | d = sorted([(dist(pts[i], pts[j]), i, j) for i in r for j in r if j > i]) | ||
| 14 | |||
| 15 | rep = [i for i in r] | ||
| 16 | |||
| 17 | def findrep(i): | ||
| 18 | return i if rep[i] == i else findrep(rep[i]) | ||
| 19 | |||
| 20 | def joinrep(i, j): | ||
| 21 | rep[findrep(i)] = findrep(j) | ||
| 22 | |||
| 23 | for 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 | ||
| 28 | sizes = [[0, i] for i in r] | ||
| 29 | for i in r: | ||
| 30 | sizes[findrep(i)][0] += 1 | ||
| 31 | sizes.sort() | ||
| 32 | print(sizes[-1][0] * sizes[-2][0] * sizes[-3][0]) | ||
diff --git a/2025/08/b.py b/2025/08/b.py new file mode 100644 index 0000000..4a6d610 --- /dev/null +++ b/2025/08/b.py | |||
| @@ -0,0 +1,26 @@ | |||
| 1 | import fileinput | ||
| 2 | |||
| 3 | with fileinput.input() as lines: | ||
| 4 | pts = [tuple(int(x) for x in line[:-1].split(',')) for line in lines] | ||
| 5 | |||
| 6 | r = range(len(pts)) | ||
| 7 | |||
| 8 | def dist(p, q): | ||
| 9 | return (p[0]-q[0])**2 + (p[1]-q[1])**2 + (p[2]-q[2])**2 | ||
| 10 | |||
| 11 | d = sorted([(dist(pts[i], pts[j]), i, j) for i in r for j in r if j > i]) | ||
| 12 | |||
| 13 | rep = [i for i in r] | ||
| 14 | |||
| 15 | def findrep(i): | ||
| 16 | return i if rep[i] == i else findrep(rep[i]) | ||
| 17 | |||
| 18 | def joinrep(i, j): | ||
| 19 | rep[findrep(i)] = findrep(j) | ||
| 20 | |||
| 21 | for _, j, k in d: | ||
| 22 | if findrep(j) != findrep(k): | ||
| 23 | joinrep(j, k) | ||
| 24 | sol = pts[j][0] * pts[k][0] | ||
| 25 | |||
| 26 | print(sol) | ||
