summaryrefslogtreecommitdiff
path: root/2024/19/python/main.py
blob: a41156cdfbf44897502381c14cd6a2c1244642b9 (plain)
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
from fileinput import input
from functools import cache
from itertools import takewhile

inp = map(str.strip, input())
towels = [t.strip() for t in next(takewhile(bool, inp)).split(",")]
designs = [d for d in inp if d]

# Construct trie
trie = {}
for towel in towels:
    prev = None
    curr = trie
    for t in towel:
        term, succ = curr.setdefault(t, (False, {}))
        prev = curr
        curr = succ
    prev[towel[-1]] = (True, curr)


@cache
def steps(design, n=0):
    if n == len(design):
        return 1
    ways = 0
    curr = trie
    for d, s in enumerate(design[n:], start=1):
        if s not in curr:
            return ways
        term, curr = curr[s]
        if term:
            ways += steps(design, n + d)
    return ways


silver = sum(map(bool, map(steps, designs)))
gold = sum(map(steps, designs))

print("silver:", silver)
print("gold:", gold)