-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path13460.cpp
More file actions
78 lines (78 loc) · 2.04 KB
/
13460.cpp
File metadata and controls
78 lines (78 loc) · 2.04 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
#include <bits/stdc++.h>
#define X first
#define Y second
#define pii pair<int,int>
using namespace std;
int n, m;
bool flag;
pii red, blue, hole;
char board[11][11];
int dx[4] = {0, 0, -1, 1};
int dy[4] = {1, -1, 0, 0};
pair<pii,pii> go(pii r, pii b, int dir) {
while(1) {
int rnx = r.X + dx[dir];
int rny = r.Y + dy[dir];
if(board[rnx][rny] == 'O') {
flag = 1;
}
if(board[rnx][rny] == '#') break;
if(rnx == b.X && rny == b.Y) {
while(1) {
if(board[b.X + dx[dir]][b.Y + dy[dir]] == '#') break;
if(board[b.X + dx[dir]][b.Y + dy[dir]] == 'O') return {{-1,-1},{-1,-1}};
b.X += dx[dir];
b.Y += dy[dir];
}
r.X = b.X - dx[dir];
r.Y = b.Y - dy[dir];
break;
}
r.X = rnx;
r.Y = rny;
}
while(1) {
int bnx = b.X + dx[dir];
int bny = b.Y + dy[dir];
if(board[bnx][bny] == 'O') {
r = {-1, -1};
flag = 0;
return {r, b};
}
if(board[bnx][bny] == '#') break;
if(bnx == r.first && bny == r.second) break;
b.X = bnx;
b.Y = bny;
}
return {r, b};
}
int main() {
cin >> n >> m;
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
cin >> board[i][j];
if(board[i][j] == 'R') red = {i, j };
if(board[i][j] == 'B') blue = {i, j };
if(board[i][j] == 'O') hole = {i, j};
}
}
queue<tuple<pii, pii, int>> q;
q.push({red, blue, 0});
while(!q.empty()) {
auto [curR, curB, cnt] = q.front();
q.pop();
for(int i = 0; i < 4; i++) {
auto nxt = go(curR, curB, i);
auto rn = nxt.X;
auto rb = nxt.Y;
if(rn.X == -1) continue;
if(flag == 1) {
cout << cnt + 1;
return 0;
}
if(cnt + 1 == 10) continue;
q.push({rn, rb, cnt + 1});
}
}
cout << -1;
}