Further optimise day 4

.gitignore

@@ -0,0 +1,2 @@
+*.in
+*.ex*

day02.py

@@ -0,0 +1,35 @@
+import fileinput
+from functools import reduce
+
+def main():
+    part1 = 0
+    part2 = 0
+
+    for i, line in enumerate(fileinput.input()):
+        line = line.strip()
+        subsets = line.split(": ")[1].split("; ")
+
+        maxes = {}
+
+        part1_possible = True
+        for subset in subsets:
+            for balls in subset.split(", "):
+                count, color = balls.split()
+                count = int(count)
+                maxes[color] = max(maxes.get(color, 0), count)
+                part1_possible = (
+                    part1_possible
+                    and (color != "red" or count <= 12)
+                    and (color != "green" or count <= 13)
+                    and (color != "blue" or count <= 14)
+                )
+
+        if part1_possible:
+            part1 += i + 1
+
+        power = reduce(lambda x, y: x * y, maxes.values())
+        part2 += power
+
+    print(part1, part2)
+
+main()

day04.py

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