1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
import sys
sys.path.append("../common")
import aoc
data = [[int(v) for v in l.split(",")] for l in aoc.data.split("\n")]
minx = min(data, key = lambda x: x[0])[0]
maxx = max(data, key = lambda x: x[0])[0]
miny = min(data, key = lambda x: x[1])[1]
maxy = max(data, key = lambda x: x[1])[1]
def closest(x, y):
mc = None
md = None
ad = None
for i in range(len(data)):
c = data[i]
dist = abs(c[0] - x) + abs(c[1] - y)
if md == None or dist < md:
md = dist
mc = i
ad = None
elif dist == md:
ad = dist
return mc, ad
def combined_dist(x, y):
dist = 0
for i in range(len(data)):
c = data[i]
dist += abs(c[0] - x) + abs(c[1] - y)
return dist
def solve1(args):
areas = dict()
for x in range(minx, maxx):
for y in range(miny, maxy):
mc, ad = closest(x, y)
if ad == None:
if mc not in areas:
areas[mc] = 1
else:
areas[mc] += 1
# remove outside points
for i in range(len(data)):
c = data[i]
mc, ac = closest(minx, c[1])
if mc == i:
areas.pop(i)
continue
mc, ac = closest(maxx, c[1])
if mc == i:
areas.pop(i)
continue
mc, ac = closest(c[0], miny)
if mc == i:
areas.pop(i)
continue
mc, ac = closest(c[0], maxy)
if mc == i:
areas.pop(i)
continue
return max(areas.values())
def solve2(args):
safezone = 0
for x in range(minx, maxx):
for y in range(miny, maxy):
dist = combined_dist(x,y)
if dist < 10000:
safezone += 1
return safezone
aoc.run(solve1, solve2, sols=[3276, 38380])
|
