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
|
#!/usr/bin/env python3
from collections import defaultdict
def solve(paths: defaultdict[list[str]], path: str) -> int:
acc = 0
tokens = path[0].split(",")
for dest in paths[tokens[-1]]:
if dest == "end":
acc += 1
# START PART 1
elif not (dest.islower() and dest in tokens):
acc += solve(paths, (f"{path[0]},{dest}", False))
# END PART 1 START PART 2
elif dest != "start":
if dest.islower() and dest in tokens:
if path[1]:
continue
acc += solve(paths, (f"{path[0]},{dest}", True))
else:
acc += solve(paths, (f"{path[0]},{dest}", path[1]))
# END PART 2
return acc
def main() -> None:
paths: defaultdict[list[str]] = defaultdict(list)
with open("input", "r", encoding="utf-8") as f:
for entry in f.readlines():
x, y = entry.strip().split("-")
paths[x].append(y)
paths[y].append(x)
print(solve(paths, ("start", False)))
if __name__ == "__main__":
main()
|
