sebse/python-aoc-2021
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Day 14 (minified)

Browse Source
This commit is contained in:
Sebastian Seedorf
2021-12-15 13:00:55 +01:00
parent de0a250ed9
commit c7bc2439a6
3 changed files with 10 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
day14/part2.py
View File

@@ -9,16 +9,14 @@ first = next(lines)
next(lines)
repl = (re.match(r"([A-Z]{2}) -> ([A-Z])", line).groups() for line in lines)
repl = (v for (a, b), insert in repl for v in [(a + insert, a + b), (insert + b, a + b)])
repl = (v for (a, b), m in repl for v in [(a+m, a+b), (m+b, a+b)])
repl = {k: list(map(itemgetter(1), v)) for k, v in groupby(sorted(repl), itemgetter(0))}
combinations = Counter(first[a:a+2] for a in range(len(first)-1))
combinations = Counter(first[i:i+2] for i in range(len(first)-1))
for _ in range(40):
combinations = {k: sum_val for k, v in repl.items() if (sum_val := sum(combinations.get(x, 0) for x in v)) > 0}
letters = ((l, cnt) for key, cnt in combinations.items() for l in key)
letters = {k: sum(map(itemgetter(1), v)) for k, v in groupby(sorted(letters), itemgetter(0))}
letters[first[0]] += 1
letters = {k: sum(map(itemgetter(1), v)) for k, v in groupby(sorted(combinations.items()), lambda x: x[0][0])}
letters[first[-1]] += 1
print((max(letters.values()) - min(letters.values())) // 2)
print(max(letters.values()) - min(letters.values()))