#include #include #include using namespace std; typedef long long ll; typedef pair pii; #define endl "\n" int n, m; char board[10][10]; pair b, r, o; char c; int dx[4] = { 0,0,1,-1 }; int dy[4] = { 1,-1,0,0 }; queue> q; map, bool> visited; bool crash, clear, fail; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> c; if (c == 'B') b = { i,j }; else if (c == 'R') r = { i,j }; else if (c == 'O') o = { i,j }; board[i][j] = c; } } q.push({ b,r, 1 }); visited[{{b.first, b.second}, { r.first, r.second }}] = true; while (!q.empty()) { auto [b, r, depth] = q.front(); //cout << b.first << " " << b.second << "," << r.first << " " << r.second << endl; if (depth > 10)break; pair pp = { b,r }; q.pop(); for (int i = 0; i < 4; i++) { b = pp.first; r = pp.second; crash = false; clear = false; fail = false; while (true) { pii next = { b.first + dx[i], b.second + dy[i] }; if (board[next.first][next.second] == '#') break; if (next == o) { fail = true; break; } if (board[next.first][next.second] == 'R') crash = true; b = next; } if (crash) { b.first -= dx[i]; b.second -= dy[i]; } while (!fail) { pii next = { r.first + dx[i], r.second + dy[i] }; if (board[next.first][next.second] == '#') break; if (next == o) { clear = true; break; } if (board[next.first][next.second] == 'B' && !crash) break; r = next; } if (!visited[{{b.first, b.second}, { r.first, r.second }}] && !fail && !clear) { q.push({ b,r, depth + 1 }); visited[{{b.first, b.second}, { r.first, r.second }}] = true; } if (clear) break; } if (clear) { cout << depth; return 0; } } cout << -1; return 0; }

제출 #109927

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: