-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day14.java
192 lines (144 loc) · 5.28 KB
/
Day14.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
package io.github.sirnikolai.days;
import io.github.sirnikolai.AbstractSolution;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
public class Day14 extends AbstractSolution {
@Override
public void Part1(String input) {
String[] split = input.split("\n");
Map<Integer, String> map = new HashMap<>();
int prev = 0;
for(int i = 1; i <= split.length; i++) {
if(i == split.length || split[i].startsWith("mask")) {
doRound(map, split, prev, i);
prev = i;
}
}
long total = 0;
for(String s : map.values()) {
total += Long.parseLong(trimZeros(new StringBuilder(s).reverse().toString()), 2);
}
System.out.println(total);
}
private void doRound(Map<Integer, String> map, String[] split, int start, int end) {
List<int[]> locs = getInts(split, start + 1, end);
String mask = new StringBuilder(split[start].substring(split[start].indexOf("= ") + 2)).reverse().toString();
for(int[] arr : locs) {
map.put(arr[0], replace(mask, new StringBuilder(Integer.toString(arr[1], 2)).reverse().toString()));
}
}
private String trimZeros(String s) {
for(int i = 0; i < s.length(); i++) {
if(s.charAt(i) != '0') {
return s.substring(i);
}
}
return "0";
}
private String replace(String mask, String num) {
StringBuilder s = new StringBuilder();
for(int i = 0; i < mask.length(); i++) {
if(mask.charAt(i) != 'X') {
s.append(mask.charAt(i));
} else {
if(i >= num.length()) {
s.append('0');
} else {
s.append(num.charAt(i));
}
}
}
return s.toString();
}
private List<int[]> getInts(String[] arr, int start, int limit) {
List<int[]> lst = new LinkedList<>();
for(int i = start; i < limit; i++) {
String sub = arr[i];
int loc = Integer.parseInt(sub.substring(sub.indexOf("mem[")+4, sub.indexOf("]")));
int val = Integer.parseInt(sub.substring(sub.indexOf("= ")+2));
lst.add(new int[]{loc, val});
}
return lst;
}
private List<long[]> getLongs(String[] arr, int start, int limit) {
List<long[]> lst = new LinkedList<>();
for(int i = start; i < limit; i++) {
String sub = arr[i];
long loc = Long.parseLong(sub.substring(sub.indexOf("mem[")+4, sub.indexOf("]")));
long val = Long.parseLong(sub.substring(sub.indexOf("= ")+2));
lst.add(new long[]{loc, val});
}
return lst;
}
//TODO: this is pretty broken. Had to do in python because there is overflow here somewhere I can't explain
@Override
public void Part2(String input) {
String[] split = input.split("\n");
Map<Long, Long> map = new HashMap<>();
int prev = 0;
for(int i = 1; i <= split.length; i++) {
if(i == split.length || split[i].startsWith("mask")) {
doRound2(map, split, prev, i);
prev = i;
}
}
long total = 0;
for(long i : map.values()) {
total += i;
}
System.out.println(total);
}
private void doRound2(Map<Long, Long> map, String[] split, int start, int end) {
List<long[]> locs = getLongs(split, start + 1, end);
String mask = new StringBuilder(split[start].substring(split[start].indexOf("= ") + 2))
.reverse()
.toString();
for(long[] arr : locs) {
List<String> variants = replace2(mask, new StringBuilder(Long.toString(arr[0], 2)).reverse().toString());
for(String s : variants) {
map.put(Long.parseLong((s), 2), arr[1]);
}
}
}
private List<String> replace2(String mask, String num) {
StringBuilder s = new StringBuilder();
for(int i = 0; i < mask.length(); i++) {
if(mask.charAt(i) == 'X') {
s.append('X');
} else {
if(i >= num.length()) {
s.append('0');
} else {
if(mask.charAt(i) == '0') {
s.append(num.charAt(i));
} else {
s.append('1');
}
}
}
}
List<String> lst = new ArrayList<>();
getPermutations(lst, s.reverse().toString().toCharArray());
return lst;
}
private void getPermutations(List<String> lst, char[] c) {
List<char[]> arr = new ArrayList<>();
arr.add(c);
for(int i = 0; i < c.length; i++) {
List<char[]> temp = new ArrayList<>();
for(char[] cArr : arr) {
if(cArr[i] == 'X') {
char[] copy = Arrays.copyOf(cArr, cArr.length);
cArr[i] = '0';
copy[i] = '1';
temp.add(copy);
}
}
arr.addAll(temp);
}
for(char[] cArr : arr) {
lst.add(new String(cArr));
}
}
}