mirror of
https://github.com/peter-tanner/advent-of-code-2020.git
synced 2024-11-30 10:50:17 +08:00
32 lines
657 B
Python
32 lines
657 B
Python
import math as m
|
|
|
|
lines = open('input').read().splitlines()
|
|
|
|
def uphalf(t):
|
|
return [t[0], t[1] + int(abs(t[0] - t[1])/2) + 1]
|
|
def lowhalf(t):
|
|
return [t[0] - int(abs(t[0] - t[1])/2) - 1, t[1]]
|
|
|
|
def bsp(dom, low, up, input):
|
|
for p in input:
|
|
if p == low:
|
|
dom = lowhalf(dom)
|
|
else:
|
|
dom = uphalf(dom)
|
|
if input[-1] == low:
|
|
return dom[1]
|
|
else:
|
|
return dom[0]
|
|
|
|
ids = []
|
|
rowdomain = [127, 0]
|
|
coldomain = [7, 0]
|
|
|
|
for line in lines:
|
|
bruh = [
|
|
bsp(rowdomain, "F", "B", line[0:7]),
|
|
bsp(coldomain, "L", "R", line[7:10])
|
|
]
|
|
ids.append(bruh[0]*8 + bruh[1])
|
|
|
|
print(max(ids)) |