-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDay9.py
More file actions
283 lines (275 loc) · 11.5 KB
/
Day9.py
File metadata and controls
283 lines (275 loc) · 11.5 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
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
#per location that != '9'
#look at what neighbour is lowest
#check if that number is a well
#if not, look at what neighbour is closest from that
#if location is well, add 1 to dict where key is well location
#at the end, get the sizes of three largest entries in dict, multiply them together
def lavaflows_lowestpoints():
f = open("input day 9.txt", "r")
lines = f.readlines()
lowestpoint = []
locations = []
line = 0
while line < len(lines):
if lines[line][-1] == '\n':
lines[line] = lines[line][:-1]
number = 0
while number < len(lines[line]):
nummer = int(lines[line][number])
if line == 0:
nummeronder = int(lines[line + 1][number])
if number != 0:
nummerlinks = int(lines[line][number - 1])
if number < len(lines[line]) - 1:
nummerrechts = int(lines[line][number + 1])
if number == 0:
if nummer < nummerrechts and nummer < nummeronder:
lowestpoint.append(nummer)
locations.append([number, line])
elif number == len(lines[line]) - 1:
if nummer < nummerlinks and nummer < nummeronder:
lowestpoint.append(nummer)
locations.append([number, line])
elif nummer < nummerrechts and nummer < nummerlinks and nummer < nummeronder:
lowestpoint.append(nummer)
locations.append([number, line])
if 0 < line < (len(lines) - 1):
nummeronder = int(lines[line + 1][number])
nummerboven = int(lines[line - 1][number])
if number != 0:
nummerlinks = int(lines[line][number - 1])
if number < len(lines[line]) - 1:
nummerrechts = int(lines[line][number + 1])
if number == 0:
if nummer < nummerrechts and nummer < nummeronder and nummer < nummerboven:
lowestpoint.append(nummer)
locations.append([number, line])
elif number == len(lines[line]) - 1:
if nummer < nummeronder and nummer < nummerlinks and nummer < nummerboven:
lowestpoint.append(nummer)
locations.append([number, line])
elif nummer < nummerrechts and nummer < nummerlinks and nummer < nummeronder and nummer < nummerboven:
lowestpoint.append(nummer)
locations.append([number, line])
if line == len(lines) - 1:
nummerboven = int(lines[line - 1][number])
if number != 0:
nummerlinks = int(lines[line][number - 1])
if number < len(lines[line]) - 1:
nummerrechts = int(lines[line][number + 1])
if number == 0:
if nummer < nummerrechts and nummer < nummerboven:
lowestpoint.append(nummer)
locations.append([number, line])
elif number == len(lines[line]) - 1:
if nummer < nummerlinks and nummer < nummerboven:
lowestpoint.append(nummer)
locations.append([number, line])
elif nummer < nummerrechts and nummer < nummerboven and nummer < nummerlinks:
lowestpoint.append(nummer)
locations.append([number, line])
number += 1
line += 1
sum = 0
for point in lowestpoint:
sum += point + 1
print(sum)
print(lowestpoint)
print(locations)
#returns bool
def isWell(x, y, input):
nummer = int(input[y][x])
if y == 0:
nummeronder = int(input[y + 1][x])
if x != 0:
nummerlinks = int(input[y][x - 1])
if x < len(input[y]) - 1:
nummerrechts = int(input[y][x + 1])
if x == 0:
if nummer < nummerrechts and nummer < nummeronder:
return True
elif x == len(input[y]) - 1:
if nummer < nummerlinks and nummer < nummeronder:
return True
elif nummer < nummerrechts and nummer < nummerlinks and nummer < nummeronder:
return True
elif 0 < y < (len(input) - 1):
nummeronder = int(input[y + 1][x])
nummerboven = int(input[y - 1][x])
if x != 0:
nummerlinks = int(input[y][x - 1])
if x < len(input[y]) - 1:
nummerrechts = int(input[y][x + 1])
if x == 0:
if nummer < nummerrechts and nummer < nummeronder and nummer < nummerboven:
return True
elif x == len(input[y]) - 1:
if nummer < nummeronder and nummer < nummerlinks and nummer < nummerboven:
return True
elif nummer < nummerrechts and nummer < nummerlinks and nummer < nummeronder and nummer < nummerboven:
return True
elif y == len(input) - 1:
nummerboven = int(input[y - 1][x])
if x != 0:
nummerlinks = int(input[y][x - 1])
if x < len(input[y]) - 1:
nummerrechts = int(input[y][x + 1])
if x == 0:
if nummer < nummerrechts and nummer < nummerboven:
return True
elif x == len(input[y]) - 1:
if nummer < nummerlinks and nummer < nummerboven:
return True
elif nummer < nummerrechts and nummer < nummerboven and nummer < nummerlinks:
return True
else:
return False
#returns [x, y] of lowest neighbor
def lowerNeighbor(x, y, input):
nummer = input[y][x]
neighbors = []
nummerlinks = 9
nummerrechts = 9
nummeronder = 9
nummerboven = 9
if y == 0:
nummeronder = int(input[y + 1][x])
neighbors.append(nummeronder)
if x != 0:
nummerlinks = int(input[y][x - 1])
neighbors.append(nummerlinks)
if x < len(input[y]) - 1:
nummerrechts = int(input[y][x + 1])
neighbors.append(nummerrechts)
elif 0 < y < (len(input) - 1):
nummeronder = int(input[y + 1][x])
nummerboven = int(input[y - 1][x])
neighbors.append(nummeronder)
neighbors.append(nummerboven)
if x != 0:
nummerlinks = int(input[y][x - 1])
neighbors.append(nummerlinks)
if x < len(input[y]) - 1:
nummerrechts = int(input[y][x + 1])
neighbors.append(nummerrechts)
elif y == len(input) - 1:
nummerboven = int(input[y - 1][x])
neighbors.append(nummerboven)
if x != 0:
nummerlinks = int(input[y][x - 1])
neighbors.append(nummerlinks)
if x < len(input[y]) - 1:
nummerrechts = int(input[y][x + 1])
neighbors.append(nummerrechts)
laagste = min(neighbors)
if laagste == nummerlinks:
return [x - 1, y]
if laagste == nummerrechts:
return [x + 1, y]
if laagste == nummerboven:
return [x, y - 1]
if laagste == nummeronder:
return [x, y + 1]
#gets locations, makes dict with locations and checks all the locations and other stuff
def lavaflows_basins():
f = open("input day 9.txt", "r")
lines = f.readlines()
lowestpoint = []
locations = []
line = 0
while line < len(lines):
if lines[line][-1] == '\n':
lines[line] = lines[line][:-1]
number = 0
while number < len(lines[line]):
nummer = int(lines[line][number])
if line == 0:
nummeronder = int(lines[line + 1][number])
if number != 0:
nummerlinks = int(lines[line][number - 1])
if number < len(lines[line]) - 1:
nummerrechts = int(lines[line][number + 1])
if number == 0:
if nummer < nummerrechts and nummer < nummeronder:
lowestpoint.append(nummer)
locations.append([number, line])
elif number == len(lines[line]) - 1:
if nummer < nummerlinks and nummer < nummeronder:
lowestpoint.append(nummer)
locations.append([number, line])
elif nummer < nummerrechts and nummer < nummerlinks and nummer < nummeronder:
lowestpoint.append(nummer)
locations.append([number, line])
if 0 < line < (len(lines) - 1):
nummeronder = int(lines[line + 1][number])
nummerboven = int(lines[line - 1][number])
if number != 0:
nummerlinks = int(lines[line][number - 1])
if number < len(lines[line]) - 1:
nummerrechts = int(lines[line][number + 1])
if number == 0:
if nummer < nummerrechts and nummer < nummeronder and nummer < nummerboven:
lowestpoint.append(nummer)
locations.append([number, line])
elif number == len(lines[line]) - 1:
if nummer < nummeronder and nummer < nummerlinks and nummer < nummerboven:
lowestpoint.append(nummer)
locations.append([number, line])
elif nummer < nummerrechts and nummer < nummerlinks and nummer < nummeronder and nummer < nummerboven:
lowestpoint.append(nummer)
locations.append([number, line])
if line == len(lines) - 1:
nummerboven = int(lines[line - 1][number])
if number != 0:
nummerlinks = int(lines[line][number - 1])
if number < len(lines[line]) - 1:
nummerrechts = int(lines[line][number + 1])
if number == 0:
if nummer < nummerrechts and nummer < nummerboven:
lowestpoint.append(nummer)
locations.append([number, line])
elif number == len(lines[line]) - 1:
if nummer < nummerlinks and nummer < nummerboven:
lowestpoint.append(nummer)
locations.append([number, line])
elif nummer < nummerrechts and nummer < nummerboven and nummer < nummerlinks:
lowestpoint.append(nummer)
locations.append([number, line])
number += 1
line += 1
sum = 0
for point in lowestpoint:
sum += point + 1
print(sum)
print(lowestpoint)
print(locations)
Wells = {}
for location in locations:
Wells[str(location)] = 0
y = 0
while y < len(lines):
x = 0
while x < len(lines[y]):
if int(lines[y][x]) < 9:
pointX = x
pointY = y
while True:
coordinates = lowerNeighbor(pointX, pointY, lines)
pointX = coordinates[0]
pointY = coordinates[1]
if isWell(pointX, pointY, lines):
Wells[str(coordinates)] += 1
break
x += 1
y += 1
#writing out a for loop
print(Wells)
answer = max(Wells, key=Wells.get)
total = Wells[answer]
Wells[answer] = 0
answer = max(Wells, key=Wells.get)
total *= Wells[answer]
Wells[answer] = 0
answer = max(Wells, key=Wells.get)
total *= Wells[answer]
print(total)