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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
import math
import queue
def red(dcoord):
dx = dcoord[0]
dy = dcoord[1]
if dx == 0:
return (0, (1 if dy > 0 else -1))
if dy == 0:
return ((1 if dx > 0 else -1), 0)
gcd = math.gcd(dx, dy)
return (dx // gcd, dy // gcd)
def angle(x, y): # from y-axis, clockwise
if x >= 0 and y > 0:
return math.atan(abs(x/y))
if x > 0 and y <= 0:
return math.atan(abs(y/x)) + math.pi/2
if x <= 0 and y < 0:
return math.atan(abs(x/y)) + math.pi
else:
return math.atan(abs(y/x)) + 3*math.pi / 2
def pt1(input):
asteroids = set()
res = {}
max_x = len(input[0].rstrip())
max_y = len(input)
for y in range(max_y):
for x in range(max_x):
if input[y][x] == "#":
asteroids.add((x,y))
for a in asteroids:
candidates = set(asteroids.copy())
candidates.remove(a)
seen = set()
while len(candidates) > 0:
c = candidates.pop()
seen.add(c)
dx = c[0] - a[0]
dy = c[1] - a[1]
x = a[0]
y = a[1]
x += dx
y += dy
dx, dy = red((dx, dy))
x += dx
y += dy
while x < max_x and y < max_y and x >= 0 and y >= 0:
if (x, y) in candidates:
candidates.remove((x, y))
if (x, y) in seen:
seen.remove((x, y))
x += dx
y += dy
res[a] = seen
best = [0, 0, 0]
for coord in res:
if (amount := len(res[coord])) > best[0]:
best = [amount, coord, res[coord]]
return (best[1], best[0])
def pt2(input):
asteroids = set()
res = {}
max_x = len(input[0].rstrip())
max_y = len(input)
for y in range(max_y):
for x in range(max_x):
if input[y][x] == "#":
asteroids.add((x,y))
for a in asteroids:
candidates = set(asteroids.copy())
candidates.remove(a)
seen = set()
while len(candidates) > 0:
c = candidates.pop()
seen.add(c)
dx = c[0] - a[0]
dy = c[1] - a[1]
x = a[0]
y = a[1]
x += dx
y += dy
dx, dy = red((dx, dy))
x += dx
y += dy
while x < max_x and y < max_y and x >= 0 and y >= 0:
if (x, y) in candidates:
candidates.remove((x, y))
if (x, y) in seen:
seen.remove((x, y))
x += dx
y += dy
res[a] = seen
best = [0, 0, 0]
for coord in res:
if (amount := len(res[coord])) > best[0]:
best = [amount, coord, res[coord]]
asteroids.remove(best[1])
x0 = best[1][0]
y0 = best[1][1]
angles = {}
q = queue.Queue()
for a in asteroids:
angles[a] = angle(a[0] - x0, y0 - a[1])
for k, v in sorted(angles.items(), key=lambda item: item[1]):
if k in best[2]:
q.put(k)
destroyed = 1
while not q.empty():
asteroid = q.get()
if destroyed == 200:
return (asteroid, asteroid[0]*100 + asteroid[1])
asteroids.remove(asteroid)
destroyed += 1
# add next asteroid behind to queue
dx = asteroid[0] - x0
dy = asteroid[1] - y0
x = x0
y = y0
x += dx
y += dy
dx, dy = red((dx, dy))
x += dx
y += dy
while x < max_x and y < max_y and x >= 0 and y >= 0:
if (x, y) in asteroids:
q.put((x, y))
break
x += dx
y += dy
if __name__ == "__main__":
import cProfile
input = open("../input/10","r").readlines()
cProfile.run("pt1(input)")
cProfile.run("pt2(input)")
print(pt1(input))
print(pt2(input))
|
