-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest15653.java
More file actions
143 lines (125 loc) · 3.4 KB
/
Copy pathtest15653.java
File metadata and controls
143 lines (125 loc) · 3.4 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
https://velog.io/@hyeon930/BOJ-15653-%EA%B5%AC%EC%8A%AC-%ED%83%88%EC%B6%9C4-Java
// https://www.acmicpc.net/problem/15653
package org.tryAgain;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
public class test15653 {
static class Node {
int r, c, time;
char type;
Node(int r, int c, char type, int time) {
this.r = r;
this.c = c;
this.type = type;
this.time = time;
}
}
static Queue<Node> q;
static boolean[][][][] visited;
static int[][] dir = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
static char[][] map;
static int blueR, blueC, redR, redC;
static int N, M;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
N = Integer.parseInt(st.nextToken());
M = Integer.parseInt(st.nextToken());
q = new LinkedList<>();
visited = new boolean[N][M][N][M];
map = new char[N][M];
for(int r = 0 ; r < N ; ++r) {
char[] line = br.readLine().toCharArray();
for(int c = 0 ; c < M ; ++c) {
if(line[c] == 'R') {
map[r][c] = '.';
redR = r;
redC= c;
q.offer(new Node(r, c, line[c], 0));
} else if(line[c] == 'B') {
map[r][c] = '.';
blueR = r;
blueC = c;
q.offer(new Node(r, c, line[c], 0));
}else {
map[r][c] = line[c];
}
}
}
visited[redR][redC][blueR][blueC] = true;
System.out.println(bfs());
}
private static int bfs() {
while(!q.isEmpty()) {
Node blue, red;
if(q.peek().type == 'B') {
blue = q.poll();
red = q.poll();
} else {
red = q.poll();
blue = q.poll();
}
boolean blueInHole, redInHole, afterRed;
int bcr, bcc, rcr, rcc;
int bnr, bnc, rnr, rnc;
for(int d = 0 ; d < 4 ; ++d) {
blueInHole = redInHole = afterRed = false;
bcr = blue.r;
bcc = blue.c;
rcr = red.r;
rcc = red.c;
// 파랑 구슬 이동
while(true) {
bnr = bcr + dir[d][0];
bnc = bcc + dir[d][1];
if(bnr == rcr && bnc == rcc) afterRed = true;
if(map[bnr][bnc] == '#') break;
if(map[bnr][bnc] == 'O') {
blueInHole = true;
break;
}
bcr = bnr;
bcc = bnc;
}
// 빨강 구슬 이동
while(true) {
rnr = rcr + dir[d][0];
rnc = rcc + dir[d][1];
if(map[rnr][rnc] == '#') break;
if(map[rnr][rnc] == 'O') {
redInHole = true;
break;
}
rcr = rnr;
rcc = rnc;
}
// 파란구슬이 들어갔을 때
if(blueInHole) continue;
// 빨간구슬이 들어갔을 때
if(redInHole) return red.time + 1;
// 구슬이 겹쳤을 때
if(bcr == rcr && bcc == rcc) {
// 빨간구슬 다음에 파란구슬이 올 때
if(afterRed) {
bcr -= dir[d][0];
bcc -= dir[d][1];
// 파란구슬 다음에 빨간구슬이 올 때
} else {
rcr -= dir[d][0];
rcc -= dir[d][1];
}
}
// 방문체크
if(visited[rcr][rcc][bcr][bcc]) continue;
visited[rcr][rcc][bcr][bcc] = true;
q.offer(new Node(bcr, bcc, 'B', blue.time + 1));
q.offer(new Node(rcr, rcc, 'R', red.time + 1));
}
}
return -1;
}
}