-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathday12.py
More file actions
87 lines (61 loc) · 1.64 KB
/
day12.py
File metadata and controls
87 lines (61 loc) · 1.64 KB
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
from collections import defaultdict
def parse(input):
ret = defaultdict(list)
for row in input.strip().splitlines():
a, b = row.split('-')
ret[a].append(b)
ret[b].append(a)
return ret
def walk_paths1(path, input):
if path[-1] == 'end':
return [path]
ret = []
for room in input[path[-1]]:
if room.lower() == room and room in path:
continue
p = path[:]
p.append(room)
ret.extend(walk_paths1(p, input))
return ret
def part1(input):
input = parse(input)
paths = walk_paths1(['start'], input)
return len(paths)
def is_small_cave(room):
return room.lower() == room
def can_visit(path, room):
if room == 'end':
return True
if room == 'start':
return False
if not is_small_cave(room):
return True
if room not in path:
return True
for visited in path:
if is_small_cave(visited) and path.count(visited) == 2:
return False
return True
def walk_paths2(path, input):
if path[-1] == 'end':
return [path]
ret = []
for room in input[path[-1]]:
if not can_visit(path, room):
continue
p = path[:]
p.append(room)
ret.extend(walk_paths2(p, input))
return ret
def part2(input):
input = parse(input)
paths = walk_paths2(['start'], input)
return len(paths)
if __name__ == '__main__':
import sys
import utils
input = sys.stdin.read()
p1, t1 = utils.time(part1, input)
print(f'part1: {p1} ({t1:.20f})')
p2, t2 = utils.time(part2, input)
print(f'part2: {p2} ({t2:.20f})')