def puzzle1():
info_lines, my_ticket, nearby_tickets = get_blank_sep_lines('day16')
my_ticket = my_ticket[1:]
nearby_tickets = [
list(map(int, line.split(','))) for line in nearby_tickets[1:]
]
info = {}
for line in info_lines:
key, value = line.split(':', 1)
ranges = value.split()
r1 = ranges[0].split('-')
r2 = ranges[-1].split('-')
info[key] = [(int(r1[0]), int(r1[1])), (int(r2[0]), int(r2[1]))]
error_sum = 0
for ticket in nearby_tickets:
for item in ticket:
valid = False
for check1, check2 in info.values():
if ((check1[0] <= item <= check1[1])
or (check2[0] <= item <= check2[1])):
valid = True
break
if not valid:
error_sum += item
print(error_sum)
def puzzle1():
count = 0
for declaration in get_blank_sep_lines('day6'):
yeses = set()
for person in declaration:
yeses |= set(person)
count += len(yeses)
print(count)
def puzzle2():
info_lines, my_ticket, nearby_tickets = get_blank_sep_lines('day16')
my_ticket = list(map(int, my_ticket[1].split(',')))
nearby_tickets = [
list(map(int, line.split(','))) for line in nearby_tickets[1:]
]
info = {}
for line in info_lines:
key, value = line.split(':', 1)
ranges = value.split()
r1 = ranges[0].split('-')
r2 = ranges[-1].split('-')
info[key] = [(int(r1[0]), int(r1[1])), (int(r2[0]), int(r2[1]))]
valid_tickets = []
for ticket in nearby_tickets:
valid = True
for item in ticket:
item_valid = False
for check1, check2 in info.values():
if ((check1[0] <= item <= check1[1])
or (check2[0] <= item <= check2[1])):
item_valid = True
break
if not item_valid:
valid = False
break
if valid:
valid_tickets.append(ticket)
# transpose so we can easily look at a column at a time
columns = list(zip(*valid_tickets))
# Check each info type for which columns it could possibly be
possibles = defaultdict(set)
for key, (check1, check2) in info.items():
for idx, values in enumerate(columns):
if all(
(check1[0] <= v <= check1[1]) or (check2[0] <= v <= check2[1])
for v in values):
possibles[key].add(idx)
# Make a (valid on this data) assumption that we don't have to
# 'sudoku' the whole thing and can just consider the values
# as monotonically less constrained.
found = {}
seen = set()
for key, possible in sorted(possibles.items(), key=lambda x: len(x[1])):
loc = (possible - seen).pop()
found[key] = loc
seen.add(loc)
# Determine product of values starting with 'departure'
product = 1
for key, val in found.items():
if key.startswith('departure'):
product *= my_ticket[val]
print(product)
def puzzle1():
rules, messages = get_blank_sep_lines('day19')
rules = {int(x): y.strip() for x, y in [rule.split(':') for rule in rules]}
rule_ev = RuleEvaluator(rules)
count = 0
for msg in messages:
if rule_ev.valid(0, msg) is True:
count += 1
print(count)
def puzzle2():
count = 0
everything = set('abcdefghijklmnopqrstuvwxyz')
for declaration in get_blank_sep_lines('day6'):
yeses = everything.copy()
for person in declaration:
nos = (everything - set(person))
yeses -= nos
count += len(yeses)
print(count)
def puzzle2():
deck1, deck2 = get_blank_sep_lines('day22')
# ignore first line; int-ify
deck1 = deque(int(card) for card in deck1[1:])
deck2 = deque(int(card) for card in deck2[1:])
# Sample data
# deck1 = deque([9, 2, 6, 3, 1])
# deck2 = deque([5, 8, 4, 7, 10])
winner, *_ = recursive_combat(deck1, deck2)
print(score(winner))
def puzzle1():
deck1, deck2 = get_blank_sep_lines('day22')
# ignore first line; int-ify
deck1 = deque(int(card) for card in deck1[1:])
deck2 = deque(int(card) for card in deck2[1:])
while deck1 and deck2:
top1 = deck1.popleft()
top2 = deck2.popleft()
if top1 > top2:
winner = deck1
else:
winner = deck2
winner.append(max(top1, top2))
winner.append(min(top1, top2))
print(score(winner))