+/AoC

advent of code

git clone https://git.julia.blue/+/AoC

Joseph RyanDay 1234efc25

master
904 B41 linesraw
1from collections import defaultdict
2
3paths = defaultdict(list)
4with open("input") as f:
5    for line in f:
6        l, r = line.strip().split("-")
7        if r != "start" and l != "end":
8            paths[l].append(r)
9        if l != "start" and r != "end":
10            paths[r].append(l)
11
12# for p in paths.items():
13#     print(p)
14routes = set()
15
16
17def visit(current, hist, used):
18    hist = hist + (current,)
19    p = paths[current]
20    if current == "end":
21        routes.add(hist)
22        return
23    for next in p:
24        if next.islower() and next in hist:
25            if not used:
26                visit(next, hist, True)
27        else:
28            visit(next, hist, used)
29
30
31visit("start", (), True)
32# print()
33# for r in sorted(routes):
34#     print(','.join(r))
35print(len(routes))
36routes.clear()
37visit("start", (), False)
38# print()
39# for r in sorted(routes):
40#     print(",".join(r))
41print(len(routes))