-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday_12.py
69 lines (51 loc) · 1.81 KB
/
day_12.py
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
from functools import cache
from run_util import run_puzzle
def parse_data(data, copies=1):
lines = data.split('\n')
rows = []
for line in lines:
pattern, splits = line.split()
splits = tuple(int(number) for number in splits.split(','))
pattern = '?'.join((pattern,) * copies)
splits = splits * copies
rows.append([pattern, splits])
return rows
@cache
def count_permutations(pattern, groups):
if len(pattern) == 0:
if len(groups) == 0:
return 1
else:
return 0
if pattern[0] == "#":
if len(groups) == 0 or len(pattern) < groups[0] or any(c == "." for c in pattern[:groups[0]]):
return 0
if len(groups) > 1:
if len(pattern) < groups[0] + 1 or pattern[groups[0]] == "#":
return 0
return count_permutations(pattern[groups[0] + 1:], groups[1:])
else:
return count_permutations(pattern[groups[0]:], groups[1:])
if pattern[0] == ".":
return count_permutations(pattern.strip("."), groups)
if pattern[0] == "?":
return count_permutations(pattern.replace("?", ".", 1), groups) + count_permutations(pattern.replace("?", "#", 1), groups)
def part_a(data):
rows = parse_data(data)
return sum(count_permutations(pattern, splits) for pattern, splits in rows)
def part_b(data):
rows = parse_data(data, copies=5)
return sum(count_permutations(pattern, splits) for pattern, splits in rows)
def main():
examples = [
("""???.### 1,1,3
.??..??...?##. 1,1,3
?#?#?#?#?#?#?#? 1,3,1,6
????.#...#... 4,1,1
????.######..#####. 1,6,5
?###???????? 3,2,1""", 21, 525152)
]
day = int(__file__.split('/')[-1].split('.')[0][-2:])
run_puzzle(day, part_a, part_b, examples)
if __name__ == '__main__':
main()