Created
December 12, 2021 17:16
-
-
Save albertein/c17f4c579433c6db3453a4868ce08ef2 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from collections import defaultdict | |
def is_small_cave(node): | |
if node == node.lower(): | |
return True | |
def count_paths(node, paths, visited): | |
if node in visited: | |
return 0 | |
if node == 'end': | |
return 1 | |
if is_small_cave(node): | |
visited.add(node) | |
valid_paths = 0 | |
for child in paths[node]: | |
# We copy visited, since we're interested on all paths. | |
# So each individual branch needs to keep track of only visited nodes | |
# in that path. | |
valid_paths += count_paths(child, paths, set(visited)) | |
return valid_paths | |
if __name__ == '__main__': | |
paths = defaultdict(list) | |
with open('input.txt') as data: | |
for line in data: | |
path_a, path_b = line.strip().split('-') | |
paths[path_a].append(path_b) | |
paths[path_b].append(path_a) | |
visited = set() | |
print(count_paths('start', paths, visited)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment