-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day17.java
388 lines (305 loc) · 10.3 KB
/
Day17.java
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
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
package io.github.sirnikolai.days;
import io.github.sirnikolai.AbstractSolution;
import java.util.*;
import java.util.stream.Collectors;
public class Day17 extends AbstractSolution {
@Override
public void Part1(String input) {
String[] arr = input.split("\n");
char[][] arr2 = new char[arr.length][arr.length];
List<char[][]> cycle = new ArrayList<>();
for(int i = 0; i < arr.length; i++) {
arr2[i] = arr[i].toCharArray();
}
for(int i = 0; i < arr.length; i++) {
if(i == arr.length / 2) {
cycle.add(pad(arr2));
continue;
}
cycle.add(createBase(arr2.length + 2));
}
for(int i = 0; i < 6; i++) {
cycle = doCycle(cycle);
for(int j = 0; j < cycle.size(); j++) {
cycle.set(j, pad(cycle.get(j)));
}
cycle.add(0, createBase(cycle.get(0).length));
cycle.add(createBase(cycle.get(0).length));
}
System.out.println(count(cycle));
}
private int count(List<char[][]> cube) {
int tally = 0;
for(char[][] map : cube) {
for(char[] layer : map) {
for(char c : layer) {
if(c == '#') {
tally++;
}
}
}
}
return tally;
}
private void prettyPrint(List<char[][]> cube) {
for(char[][] map : cube) {
for(char[] layer : map) {
System.out.println(Arrays.toString(layer));
}
System.out.println();
}
}
private List<char[][]> doCycle(List<char[][]> cube) {
List<char[][]> cloned = clone(cube);
for (int z = 0; z < cube.size(); z++) {
char[][] layer = cube.get(z);
for (int x = 0; x < layer.length; x++) {
for (int y = 0; y < layer.length; y++) {
int active = countActiveNeighbours(cube, x, y, z);
if (layer[x][y] == '#') {
if (active != 2 && active != 3) {
cloned.get(z)[x][y] = '.';
}
} else {
if (active == 3) {
cloned.get(z)[x][y] = '#';
}
}
}
}
}
return cloned;
}
private int[][] paths = {{0,1}, {1,0}, {0,-1}, {-1,0}, {0,0}, {1,1}, {-1,-1}, {1,-1}, {-1,1}};
private int countActiveNeighbours(List<char[][]> cube, int x, int y, int z) {
int total = 0;
char[][] currentLayer = null;
//do prev
if(z > 0) {
currentLayer = cube.get(z-1);
for(int[] path : paths) {
int x2 = path[0] + x;
int y2 = path[1] + y;
if(x2 < 0 || x2 >= currentLayer.length) {
continue;
}
if(y2 < 0 || y2 >= currentLayer.length) {
continue;
}
if(currentLayer[x2][y2] == '#') {
total++;
}
}
}
//do current
currentLayer = cube.get(z);
for(int[] path : paths) {
int x2 = path[0] + x;
int y2 = path[1] + y;
if(x2 == x && y2 == y) {
continue;
}
if(x2 < 0 || x2 >= currentLayer.length) {
continue;
}
if(y2 < 0 || y2 >= currentLayer.length) {
continue;
}
if(currentLayer[x2][y2] == '#') {
total++;
}
}
//do next
if(z < cube.size() - 1) {
currentLayer = cube.get(z+1);
for(int[] path : paths) {
int x2 = path[0] + x;
int y2 = path[1] + y;
if(x2 < 0 || x2 >= currentLayer.length) {
continue;
}
if(y2 < 0 || y2 >= currentLayer.length) {
continue;
}
if(currentLayer[x2][y2] == '#') {
total++;
}
}
}
return total;
}
private char[][] pad(char[][] layer) {
char[][] padded = new char[layer.length + 2][layer.length + 2];
for(char[] arr : padded) {
Arrays.fill(arr, '.');
}
for(int i = 0; i < layer.length; i++) {
for(int j = 0; j < layer.length; j++) {
padded[i+1][j+1] = layer[i][j];
}
}
return padded;
}
private List<char[][]> clone(List<char[][]> cube) {
List<char[][]> lst = new ArrayList<>();
for(char[][] map : cube) {
lst.add(clone(map));
}
return lst;
}
private char[][] createBase(int n) {
char[][] clone = new char[n][n];
for(char[] arr : clone) {
Arrays.fill(arr, '.');
}
return clone;
}
private char[][] clone(char[][] map) {
char[][] clone = new char[map.length][map[0].length];
for(int i = 0; i < map.length; i++) {
clone[i] = Arrays.copyOf(map[i], map[i].length);
}
return clone;
}
@Override
public void Part2(String input) {
// This was helped on https://reddit.com/r/adventofcode
String[] arr = input.split("\n");
Map<Point, Boolean> map = new HashMap<>();
for(int j = 0; j < arr.length; j++) {
String s = arr[j];
for(int i = 0; i < s.length(); i++) {
map.put(new Point(j, i, 0, 0, s.charAt(i) == '#'), s.charAt(i) == '#');
}
}
for(int i = 0; i < 6; i++) {
map = runCycle(map);
}
System.out.println(countPoints(map));
}
private Map<Point, Boolean> runCycle(Map<Point, Boolean> map) {
int[] mins = getMins(map.keySet());
int[] maxes = getMaxes(map.keySet());
Map<Point, Boolean> clone = new HashMap<>();
for(int x = mins[0] - 1; x < maxes[0] + 2; x++) {
for(int y = mins[1] - 1; y < maxes[1] + 2; y++) {
for(int z = mins[2] - 1; z < maxes[2] + 2; z++) {
for(int w = mins[3] - 1; w < maxes[3] + 2; w++) {
Point next = new Point(x,y,z,w,false);
if(map.containsKey(next)) {
next.active = map.get(next);
}
int count = getCount(map, next);
if(next.active) {
if(count != 2 && count != 3) {
clone.put(next, false);
} else {
clone.put(next, true);
}
} else {
if(count == 3) {
clone.put(next, true);
} else {
clone.put(next, false);
}
}
}
}
}
}
return clone;
}
private int getCount(Map<Point, Boolean> map, Point p) {
int total = 0;
for(int x = -1; x <= 1; x++) {
for(int y = -1; y <= 1; y++) {
for(int z = -1; z <= 1; z++) {
for(int w = -1; w <= 1; w++) {
if(
x == 0 &&
y == 0 &&
z == 0 &&
w == 0) {
continue;
}
Point next = new Point(p.x + x, p.y + y, p.z + z, p.w + w,false);
if(map.containsKey(next)) {
next.active = map.get(next);
}
if(next.active) {
total++;
}
}
}
}
}
return total;
}
private int[] getMins(Set<Point> set) {
int[] arr = new int[4];
for(Point p : set) {
arr[0] = Math.min(arr[0], p.x);
arr[1] = Math.min(arr[1], p.y);
arr[2] = Math.min(arr[2], p.z);
arr[3] = Math.min(arr[3], p.w);
}
return arr;
}
private int[] getMaxes(Set<Point> set) {
int[] arr = new int[4];
for(Point p : set) {
arr[0] = Math.max(arr[0], p.x);
arr[1] = Math.max(arr[1], p.y);
arr[2] = Math.max(arr[2], p.z);
arr[3] = Math.max(arr[3], p.w);
}
return arr;
}
private long countPoints(Map<Point, Boolean> map) {
return map.values().stream().filter(b -> b).count();
}
private static class Point {
int x;
int y;
int z;
int w;
boolean active;
public Point(int x, int y, int z, int w, boolean active) {
this.x = x;
this.y = y;
this.z = z;
this.w = w;
this.active = active;
}
private Point add(int x, int y, int z, int w) {
return new Point(this.x + x, this.y + y, this.z + z, this.w + w, false);
}
private double manhattanDistance(Point other) {
return Math.sqrt(Math.pow(other.x - x, 2) + Math.pow(other.y - y, 2) + Math.pow(other.z - z, 2) + Math.pow(other.w - w, 2));
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Point point = (Point) o;
return x == point.x &&
y == point.y &&
z == point.z &&
w == point.w;
}
@Override
public int hashCode() {
return Objects.hash(x, y, z, w);
}
@Override
public String toString() {
return "Point{" +
"x=" + x +
", y=" + y +
", z=" + z +
", w=" + w +
", active=" + active +
'}';
}
}
}