-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolution.py
155 lines (111 loc) · 2.1 KB
/
solution.py
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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
#!/usr/bin/env python3
class X:
def __init__(self, v):
self.v = int(v)
self.prev = None
self.next = None
def __repr__(self):
return f'([{self.prev.v:12d}]<-[{self.v:12d}]->[{self.next.v:12d}])'
def unlink(x):
x.prev.next = x.next
x.next.prev = x.prev
def link(x, prv, nxt):
x.prev = prv
x.next = nxt
prv.next = nxt.prev = x
# Good lord have mercy
def move(x, n):
# eprint('move', x, 'steps', x.v % n)
if x.v >= 0:
if abs(x.v) < n:
if x.v % n == 0:
return
unlink(x)
prev = x
for _ in range(x.v % n):
prev = prev.next
nxt = prev.next
else:
# eprint('actually', x.v % (n - 1))
if x.v % (n - 1) == 0:
return
unlink(x)
prev = x
for _ in range(x.v % (n - 1)):
prev = prev.next
nxt = prev.next
else:
if abs(x.v) < n:
unlink(x)
nxt = x
for _ in range(x.v % n):
nxt = nxt.next
prev = nxt.prev
else:
# eprint('actually', x.v % (n - 1))
if x.v % (n - 1) == 0:
return
unlink(x)
prev = x
for _ in range(x.v % (n - 1)):
prev = prev.next
link(x, prev, prev.next)
# eprint(prev, x, nxt)
def sol(cur):
for _ in range(1000):
cur = cur.next
# eprint(cur.v)
yield cur.v
for _ in range(1000):
cur = cur.next
# eprint(cur.v)
yield cur.v
for _ in range(1000):
cur = cur.next
# eprint(cur.v)
yield cur.v
def dump(start):
cur = start
while 1:
# eprint(cur.v, end=' ')
cur = cur.next
if cur is start:
break
# eprint()
fin = open("input/input.txt").readlines()
ints = tuple(map(int, fin))
l = tuple(map(X, ints))
n = len(l)
for i, x in enumerate(l):
x.prev = l[(i - 1) % n]
x.next = l[(i + 1) % n]
dump(l[0])
for x in l:
move(x, n)
dump(l[0])
zero = None
for x in l:
if x.v == 0:
zero = x
break
ans = sum(sol(zero))
print(1, ans)
l = tuple(map(lambda v: X(v * 811589153), ints))
for i, x in enumerate(l):
x.prev = l[(i - 1) % n]
x.next = l[(i + 1) % n]
dump(l[0])
for i in range(10):
for x in l:
move(x, n)
dump(l[0])
# eprint('-' * 50)
# eprint(i + 1, end=': ')
# dump(l[0])
zero = None
for x in l:
if x.v == 0:
zero = x
break
ans = sum(sol(zero))
print(2, ans)