-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path10.py
66 lines (57 loc) · 1.46 KB
/
10.py
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
from lib import *
input = read_input(2018, 10)
points = []
for line in input.splitlines():
x, y, vx, vy = map(int, re.match(r"^position=< *(-?\d+), *(-?\d+)> velocity=< *(-?\d+), *(-?\d+)>$", line).groups())
points.append((x, y, vx, vy))
i = 0
best = 1e1337
prev = None
while True:
p = {}
minx = miny = 1e1337
maxx = maxy = -1e1337
for x, y, vx, vy in points:
x += vx * i
y += vy * i
minx = min(x, minx)
maxx = max(x, maxx)
miny = min(y, miny)
maxy = max(y, maxy)
p[(x, y)] = True
dist = maxx - minx + maxy - miny
if dist < best:
best = dist
i += 1
prev = p
else:
for y in range(miny, maxy + 1):
print("".join(" #"[prev.get((x, y), False)] for x in range(minx, maxx + 1)))
break
points = []
for line in input.splitlines():
x, y, vx, vy = map(int, re.match(r"^position=< *(-?\d+), *(-?\d+)> velocity=< *(-?\d+), *(-?\d+)>$", line).groups())
points.append((x, y, vx, vy))
i = 0
best = 1e1337
prev = None
while True:
p = {}
minx = miny = 1e1337
maxx = maxy = -1e1337
for x, y, vx, vy in points:
x += vx * i
y += vy * i
minx = min(x, minx)
maxx = max(x, maxx)
miny = min(y, miny)
maxy = max(y, maxy)
p[(x, y)] = True
dist = maxx - minx + maxy - miny
if dist < best:
best = dist
i += 1
prev = p
else:
print(i - 1)
break