aoc
/
2023
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Further optimise day 4

This commit is contained in:
Sijmen 2023-12-05 14:19:16 +01:00
parent 2194015259
commit 4dcc750416
1 changed files with 23 additions and 20 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
day04.py
View File

@ -1,24 +1,27 @@
import fileinput import fileinput
# def main():
# Part 1 #
# # Part 1
cards = [] #
part1 = 0 cards = []
for i, line in enumerate(fileinput.input()): part1 = 0
card = line.rstrip().split(": ")[1] for line in fileinput.input():
(winning, owned) = ({int(i) for i in h.split()} for h in card.split(" | ")) card = line.split(": ", 1)[1]
(winning, owned) = ({int(i) for i in h.split()} for h in card.split(" | ", 1))
count = len(winning & owned) count = len(winning & owned)
cards.append(count) cards.append(count)
part1 += 1 << count - 1 if count else 0 part1 += 1 << count - 1 if count else 0
# #
# Part 2 # Part 2
# #
dp = [0] * len(cards) dp = [0] * len(cards)
part2 = 0 part2 = 0
for i in range(len(cards)): for i in range(len(cards)):
dp[i] = 1 + sum(dp[i - cards[-i - 1] : i]) dp[i] = 1 + sum(dp[i - cards[-i - 1] : i])
part2 += dp[i] part2 += dp[i]
print(part1, part2) print(part1, part2)
main()