2018 Day 6

Author: Programator2

2018/6.txt

@@ -0,0 +1,50 @@
+194, 200
+299, 244
+269, 329
+292, 55
+211, 63
+123, 311
+212, 90
+292, 169
+359, 177
+354, 95
+101, 47
+95, 79
+95, 287
+294, 126
+81, 267
+330, 78
+202, 165
+225, 178
+266, 272
+351, 326
+180, 62
+102, 178
+151, 101
+343, 145
+205, 312
+74, 193
+221, 56
+89, 89
+242, 172
+59, 138
+83, 179
+223, 88
+297, 234
+147, 351
+226, 320
+358, 338
+321, 172
+54, 122
+263, 165
+126, 341
+64, 132
+264, 306
+72, 202
+98, 49
+238, 67
+310, 303
+277, 281
+222, 318
+357, 169
+123, 225

2018/6a.py

@@ -0,0 +1,88 @@
+from collections import defaultdict
+
+
+def mhd(p1, p2, q1, q2):
+    return abs(p1 - q1) + abs(p2 - q2)
+
+
+with open("6.txt") as f:
+    l = f.readlines()
+    l = map(lambda x: x.rstrip(), l)
+    points = []
+    code = {}
+    for i, s in enumerate(l):
+        splited = s.split(", ")
+        point = (int(splited[0]), int(splited[1]))
+        code[point] = i
+        points.append(point)
+    min_x = min(map(lambda x: x[0], points))
+    min_y = min(map(lambda x: x[1], points))
+    max_x = max(map(lambda x: x[0], points))
+    max_y = max(map(lambda x: x[1], points))
+
+    # {point: area}
+    area = defaultdict(int)
+
+    # {coordinate tuple: point or None}
+    board = {}
+
+    # helper set
+    points_set = set(points)
+
+    # add points to the board
+    for p in points:
+        board[p] = p
+
+    for x in range(min_x, max_x + 1):
+        for y in range(min_y, max_y + 1):
+            if (x, y) in points_set:
+                continue
+            min_dist = 999999
+            min_point = None
+            double_minimum = False
+            for p in points:
+                dist = mhd(x, y, *p)
+                if dist == min_dist:
+                    double_minimum = True
+                elif dist < min_dist:
+                    double_minimum = False
+                    min_dist = dist
+                    min_point = p
+            else:
+                if double_minimum:
+                    board[(x, y)] = None
+                else:
+                    board[(x, y)] = min_point
+                    area[min_point] += 1
+
+    # Check edges for infinite
+    infinity_set = set()
+    for x in range(min_x, max_x + 1):
+        infinity_set.add(board[(x, min_y)])
+        infinity_set.add(board[(x, max_y)])
+    for y in range(min_y, max_y + 1):
+        infinity_set.add(board[(min_x, y)])
+        infinity_set.add(board[(max_x, y)])
+
+    areas = []
+    for point, area in area.items():
+        if point in infinity_set:
+            continue
+        areas.append(area)
+
+    # Treba pripocitat este jednotku, lebo neberiem do uvahy samotny bod, od
+    # ktoreho pocitam vzdialenost
+    #
+    # Add one because the actual point from which the distance is computed was
+    # not included
+    print(max(areas) + 1)
+
+    # print()
+    # for x in range(min_x, max_x + 1):
+    #     for y in range(min_y, max_y + 1):
+    #         point = board[(x, y)]
+    #         if point:
+    #             print(code[point], end='')
+    #         else:
+    #             print('.', end='')
+    #     print()

2018/6b.py

@@ -0,0 +1,34 @@
+from collections import defaultdict
+
+
+def mhd(p1, p2, q1, q2):
+    return abs(p1 - q1) + abs(p2 - q2)
+
+
+with open("6.txt") as f:
+    l = f.readlines()
+    l = map(lambda x: x.rstrip(), l)
+    points = []
+    code = {}
+    for i, s in enumerate(l):
+        splited = s.split(", ")
+        point = (int(splited[0]), int(splited[1]))
+        code[point] = i
+        points.append(point)
+    min_x = min(map(lambda x: x[0], points))
+    min_y = min(map(lambda x: x[1], points))
+    max_x = max(map(lambda x: x[0], points))
+    max_y = max(map(lambda x: x[1], points))
+
+    # helper set
+    points_set = set(points)
+
+    result = 0
+
+    for x in range(min_x - 100, max_x + 100):
+        for y in range(min_y - 100, max_y + 100):
+            dist_sum = sum((mhd(x, y, *p) for p in points))
+            if dist_sum < 10000:
+                result += 1
+
+    print(result)