-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathd15.java
70 lines (64 loc) · 2.49 KB
/
d15.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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.stream.Collectors;
import static java.lang.System.out;
public class d15 {
public static void main(String[] args) {
var reader = new BufferedReader(new InputStreamReader(System.in));
var risks = reader.lines().toList();
out.println(
new Path(
new Board() {
public int size() { return risks.size(); }
public int risk(int x, int y) { return risks.get(y).charAt(x) - '0'; }
}
).length());
out.println(
new Path(
new Board() {
public int size() { return risks.size() * 5; }
public int risk(int x, int y) {
var r = risks.get(y % risks.size()).charAt(x % risks.size()) - '0' + x / risks.size() + y / risks.size();
return r > 9 ? r - 9 : r;
}
}
).length());
}
interface Board {
int size();
int risk(int x, int y);
}
interface Neighbors {
boolean adjust(int x, int y, int dx, int dy);
}
static class Path {
final Board board;
Path(Board board) {
this.board = board;
}
int length() {
var field = new int[(board.size() + 2)*(board.size() + 2)];
Arrays.fill(field, Integer.MAX_VALUE / 2);
field[(board.size() + 2) + 1] = 0;
Neighbors neighbors = (x, y, dx, dy) -> {
var r = board.risk(x, y);
if (field[(x + dx) + 1 + ((y + dy) + 1) * (board.size() + 2)] + r < field[x + 1 + (y + 1) * (board.size() + 2)]) {
field[x + 1 + (y + 1) * (board.size() + 2)] = field[(x + dx) + 1 + ((y + dy) + 1) * (board.size() + 2)] + r;
return true;
}
return false;
};
l:
for (int x = 0; x < board.size(); x++) {
for (int y = 0; y < board.size(); y++) {
if (neighbors.adjust(x, y, -1, 0)) continue l;
if (neighbors.adjust(x, y, +1, 0)) continue l;
if (neighbors.adjust(x, y, 0, -1)) continue l;
if (neighbors.adjust(x, y, 0, +1)) continue l;
}
}
return field[board.size() + (board.size()) * (board.size() + 2)];
}
}
}