-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDay15b.java
More file actions
214 lines (190 loc) · 5.42 KB
/
Day15b.java
File metadata and controls
214 lines (190 loc) · 5.42 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
import java.util.Scanner;
import java.util.ArrayList;
import java.io.File;
import java.util.LinkedList;
import java.util.Queue;
public class Day15b {
public static String myRead(Scanner scanner) {
String line;
try {
line = scanner.nextLine().trim();
} catch (Exception e) {
line = null;
}
return line;
}
public static Scanner myScanner(File text) {
Scanner scanner;
try {
scanner = new Scanner(text);
} catch (Exception e) {
System.out.println("No Scanner");
return null;
}
return scanner;
}
public static int toInt(String line) {
String res = "";
for (int i = 0; i < line.length(); ++i) {
char c = line.charAt(i);
if (Character.isDigit(c) || c == '-') {
res += c;
}
}
return Integer.valueOf(res);
}
public static int notInRanges(ArrayList<Range> ranges, int low, int high) {
Range curr = new Range(low, high);
ArrayList<Range> newRanges = new ArrayList<>();
newRanges.add(curr);
for (Range prev: ranges) {
ArrayList<Range> tmp = new ArrayList<>();
for (Range x: newRanges) {
tmp.addAll(prev.unOverlapRanges(x));
}
newRanges = tmp;
if (tmp.size() == 0) {
return -1;
}
}
return newRanges.get(0).start;
}
public static ArrayList<Range> colRangeForRow(int ROW, Coord sensor, Coord beacon, ArrayList<Range> prevRanges) {
int dist = sensor.mhDist(beacon);
// x + (sensor.row - y) <= dist
int nomRange = dist - Math.abs(sensor.row - ROW);
if (nomRange <= 0) {
return null;
}
Range curr = new Range(0, 0);
if (beacon.row != ROW) {
curr = new Range(sensor.col - nomRange, sensor.col + nomRange);
} else if (beacon.col == sensor.col - nomRange) {
curr = new Range(sensor.col - nomRange + 1, sensor.col + nomRange);
} else if (beacon.col == sensor.col + nomRange) {
curr = new Range(sensor.col - nomRange, sensor.col + nomRange - 1);
}
ArrayList<Range> currRange = new ArrayList<>();
currRange.add(curr);
for (Range prev: prevRanges) {
ArrayList<Range> tmp = new ArrayList<>();
for (Range x: currRange) {
tmp.addAll(prev.unOverlapRanges(x));
}
currRange = tmp;
}
return currRange;
}
public static void main(String[] args) {
File text = new File("/Users/axelteo/Desktop/AdventofCode/Day15input.txt");
Scanner scanner = myScanner(text);
if (scanner == null) {
return;
}
ArrayList<Coord> beacons = new ArrayList<>();
ArrayList<Range>[] colRangeForRow = new ArrayList[4000000];
for (int i = 0; i < 4000000; ++i) {
colRangeForRow[i] = new ArrayList<Range>();
}
String line;
while ((line = myRead(scanner)) != null) {
String[] tokens = line.split(" ", 0);
Coord sensor, beacon;
sensor = new Coord(toInt(tokens[2]), toInt(tokens[3]));
beacon = new Coord(toInt(tokens[8]), toInt(tokens[9]));
beacons.add(beacon);
for (int i = 0; i < 4000000; ++i) {
ArrayList<Range> tmp = colRangeForRow(i, sensor, beacon, colRangeForRow[i]);
if (tmp != null) {
colRangeForRow[i].addAll(tmp);
}
}
}
int LIMIT = 4000000;
int beaconCol = -1;
for (int i = 0; i < LIMIT; ++i) {
beaconCol = notInRanges(colRangeForRow[i], 0, LIMIT);
if (beaconCol != -1 && !beacons.contains(new Coord(beaconCol, i))) {
System.out.println("Beacon is at row " + i + ", col " + beaconCol);
long score = (long) beaconCol * (long) 4000000 + (long) i;
System.out.println("score is " + score);
return;
}
}
System.out.println("not here?");
}
}
class Coord {
int col;
int row;
public Coord(int col, int row) {
this.col = col;
this.row = row;
}
public int mhDist(Coord x) {
return Math.abs(this.col - x.col) + Math.abs(this.row - x.row);
}
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (!(obj instanceof Coord)) {
return false;
}
Coord some = (Coord) obj;
if (some.col == this.col && some.row == this.row) {
return true;
}
return false;
}
@Override
public String toString() {
return "(" + this.col + "," + this.row + ")";
}
}
class Range {
int start;
int end;
public Range(int start, int end) {
this.start = start;
this.end = end;
}
public int size() {
return this.end - this.start + 1;
}
public ArrayList<Range> unOverlapRanges(Range newRange) {
ArrayList<Range> res = new ArrayList<>();
if (this.end < newRange.start || newRange.end < this.start) {
res.add(newRange);
return res;
}
if (newRange.start >= this.start && newRange.end <= this.end) {
return res;
}
if (newRange.start < this.start && newRange.end > this.end) {
res.add(new Range(newRange.start, this.start - 1));
res.add(new Range(this.end + 1, newRange.end));
return res;
}
if (newRange.start < this.start && newRange.end <= this.end) {
res.add(new Range(newRange.start, this.start - 1));
return res;
}
if (newRange.start >= this.start && newRange.end > this.end) {
res.add(new Range(this.end + 1, newRange.end));
return res;
}
return res;
}
public boolean inRange(int x) {
if (x >= this.start && x <= this.end) {
return true;
}
return false;
}
@Override
public String toString() {
return "(" + this.start + " - " + this.end + ")";
}
}