-
Notifications
You must be signed in to change notification settings - Fork 0
/
day14.py
152 lines (134 loc) · 4.51 KB
/
day14.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
"""
cadybaltz
12/14/2023
AoC 2023 Day 14
Part 1: 530, 00:07:02
Part 2: 73, 00:15:43
"""
import sys
def solution(lines, part):
g = []
result = 0
seen = {}
cycle = None
for x in range(len(lines)):
line = lines[x].strip()
g.append(list(line))
if part == 1:
# north
for x in range(1, len(g)):
for y in range(len(g[0])):
if g[x][y] == 'O':
z = x - 1
while z >= 0 and g[z][y] == '.':
z -= 1
g[x][y] = '.'
g[z + 1][y] = 'O'
result = 0
for x in range(len(g)):
for y in range(len(g[0])):
if g[x][y] == 'O':
result += len(g) - x
return result
elif part == 2:
count = 0
while cycle is None:
# north
for x in range(1, len(g)):
for y in range(len(g[0])):
if g[x][y] == 'O':
z = x - 1
while z >= 0 and g[z][y] == '.':
z -= 1
g[x][y] = '.'
g[z+1][y] = 'O'
# west
for y in range(1, len(g[0])):
for x in range(len(g)):
if g[x][y] == 'O':
z = y - 1
while z >= 0 and g[x][z] == '.':
z -= 1
g[x][y] = '.'
g[x][z + 1] = 'O'
# south
for x in range(len(g)-1,-1,-1):
for y in range(len(g[0])):
if g[x][y] == 'O':
z = x + 1
while z < len(g) and g[z][y] == '.':
z += 1
g[x][y] = '.'
g[z - 1][y] = 'O'
# east
for y in range(len(g[0])-1,-1,-1):
for x in range(len(g)):
if g[x][y] == 'O':
z = y + 1
while z < len(g[0]) and g[x][z] == '.':
z += 1
g[x][y] = '.'
g[x][z - 1] = 'O'
result = 0
for x in range(len(g)):
for y in range(len(g[0])):
if g[x][y] == 'O':
result += len(g) - x
if result in seen:
cycle = count - seen[result]
else:
seen[result] = count
count += 1
# seen[result] = start of first cycle
# cycle = cycle length
for a in range((1000000000 - seen[result]) % cycle):
# north
for x in range(1, len(g)):
for y in range(len(g[0])):
if g[x][y] == 'O':
z = x - 1
while z >= 0 and g[z][y] == '.':
z -= 1
g[x][y] = '.'
g[z+1][y] = 'O'
# west
for y in range(1, len(g[0])):
for x in range(len(g)):
if g[x][y] == 'O':
z = y - 1
while z >= 0 and g[x][z] == '.':
z -= 1
g[x][y] = '.'
g[x][z + 1] = 'O'
# south
for x in range(len(g)-1,-1,-1):
for y in range(len(g[0])):
if g[x][y] == 'O':
z = x + 1
while z < len(g) and g[z][y] == '.':
z += 1
g[x][y] = '.'
g[z - 1][y] = 'O'
# east
for y in range(len(g[0])-1,-1,-1):
for x in range(len(g)):
if g[x][y] == 'O':
z = y + 1
while z < len(g[0]) and g[x][z] == '.':
z += 1
g[x][y] = '.'
g[x][z - 1] = 'O'
result = 0
for x in range(len(g)):
for y in range(len(g[0])):
if g[x][y] == 'O':
result += len(g) - x
return result
if __name__ == '__main__':
if sys.argv[1] == 't':
input = open("test.txt", "r")
else:
input = open("input.txt", "r")
lines = input.readlines()
print("Part 1: " + str(solution(lines, 1)))
print("Part 2: " + str(solution(lines, 2)))