aoc2022-python/20.py at main · BurgundyDev/aoc2022-python · GitHub

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
88
89
90
91
92
93
94
95
96
97
98
99
from tqdm import tqdm

class Element:
    def __init__(self, val):
        self.val = val
        self.left = None
        self.right = None

nums = [Element(int(x)) for x in open("20.txt")]

for i in range(len(nums)):
    nums[i].right = nums[(i + 1) % len(nums)]
    nums[i].left = nums[(i - 1) % len(nums)]

mod = len(nums) - 1

for elem in nums:
    if elem.val == 0:
        zero = elem
        continue
    ref = elem
    if elem.val > 0:
        for _ in range(elem.val % mod):
            ref = ref.right
        if elem == ref:
            continue
        # dereferencing the neighbouring nodes and moving the reference
        elem.right.left = elem.left
        elem.left.right = elem.right
        ref.right.left = elem
        elem.right = ref.right
        ref.right = elem
        elem.left = ref
    else:
        for _ in range(-elem.val % mod):
            ref = ref.left
        if elem == ref:
            continue
        elem.left.right = elem.right
        elem.right.left = elem.left
        ref.left.right = elem
        elem.left = ref.left
        ref.left = elem
        elem.right = ref

ans1 = 0

for _ in range(3):
    for _ in range(1000):
        zero = zero.right
    ans1 += zero.val

print(ans1)

nums = [Element(int(x) * 811589153) for x in open("20.txt")]

for i in range(len(nums)):
    nums[i].right = nums[(i + 1) % len(nums)]
    nums[i].left = nums[(i - 1) % len(nums)]

mod = len(nums) - 1
for _ in tqdm(range(10)):
    for elem in nums:
        if elem.val == 0:
            zero = elem
            continue
        ref = elem
        if elem.val > 0:
            for _ in range(elem.val % mod):
                ref = ref.right
            if elem == ref:
                continue
            # dereferencing the neighbouring nodes and moving the reference
            elem.right.left = elem.left
            elem.left.right = elem.right
            ref.right.left = elem
            elem.right = ref.right
            ref.right = elem
            elem.left = ref
        else:
            for _ in range(-elem.val % mod):
                ref = ref.left
            if elem == ref:
                continue
            elem.left.right = elem.right
            elem.right.left = elem.left
            ref.left.right = elem
            elem.left = ref.left
            ref.left = elem
            elem.right = ref

ans2 = 0

for _ in range(3):
    for _ in range(1000):
        zero = zero.right
    ans2 += zero.val

print(ans2)