-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path14442.java
83 lines (66 loc) · 2.47 KB
/
14442.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
import java.util.*;
import java.io.*;
public class Main {
private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
public static void main(String[] args) throws IOException {
String[] in = br.readLine().split(" ");
int N = Integer.parseInt(in[0]);
int M = Integer.parseInt(in[1]);
int K = Integer.parseInt(in[2]);
Space[][] space = new Space[N][M];
for (int i = 0; i < N; i++) {
in = br.readLine().split("");
for (int j = 0; j < M; j++) {
space[i][j] = in[j].equals("0") ? Space.EMPTY : Space.WALL;
}
}
int distance = -1;
boolean[][][] visited = new boolean[K + 1][N][M];
int[] dx = {1, -1, 0, 0};
int[] dy = {0, 0, 1, -1};
Queue<Position> queue = new ArrayDeque();
queue.add(new Position(0, 0, 0, 1));
visited[0][0][0] = true;
while (!queue.isEmpty()) {
Position position = queue.remove();
if (position.x == N - 1 && position.y == M - 1) {
distance = position.distance;
break;
}
for (int d = 0; d < 4; d++) {
int nx = position.x + dx[d];
int ny = position.y + dy[d];
if (0 <= nx && nx < N && 0 <= ny && ny < M && !visited[position.k][nx][ny]) {
if (space[nx][ny] == Space.EMPTY) {
queue.add(new Position(nx, ny, position.k, position.distance + 1));
visited[position.k][nx][ny] = true;
} else if (space[nx][ny] == Space.WALL && position.k < K && !visited[position.k + 1][nx][ny]) {
queue.add(new Position(nx, ny, position.k + 1, position.distance + 1));
visited[position.k + 1][nx][ny] = true;
}
}
}
}
bw.write(distance + "\n");
bw.close();
}
private static class Position {
int x;
int y;
int k = 0;
int distance = 0;
public Position(int x, int y, int k, int distance) {
this.x = x;
this.y = y;
this.k = k;
this.distance = distance;
}
public void destroyWall() {
this.k++;
}
}
private enum Space {
EMPTY, WALL
}
}