#include #include #include using namespace std; int main() { char room[1001][1001] = {}; int cx[4] = { 0, 1, 0, -1 }, cy[4] = { 1, 0, -1, 0 }, r, c, time = 0, naga = 0; queue> fq, jq, cfq; cin >> r >> c; for (int i = 0; i < r; i++) { string str; cin >> str; for (int j = 0; j < c; j++) { room[i][j] = str[j]; if (room[i][j] == 'F') { fq.push({i,j}); } if (room[i][j] == 'J') { jq.push({i,j}); if (i == 0 || j == 0 || i == r - 1 || j == c - 1) naga = 1; } } } while (jq.empty() != 1) { pair curj = jq.front(); jq.pop(); if (naga == 1) { cout << time + 1; return 0; } //fire 먼저 while(fq.empty() != 1) { cfq.push(fq.front()); fq.pop(); } while(cfq.empty() != 1) { pair curf = cfq.front(); cfq.pop(); for (int chk = 0; chk < 4; chk++) { int dx = curf.first + cx[chk]; int dy = curf.second + cy[chk]; if (dx < 0 || dy < 0 || dx >= r || dy >= c) continue; if (room[dx][dy] == '#' || room[dx][dy] == 'F') continue; fq.push({ dx,dy }); room[dx][dy] = 'F'; } } //그 다음 jihun for (int chk = 0; chk < 4; chk++) { int dx = curj.first + cx[chk]; int dy = curj.second + cy[chk]; if (dx < 0 || dy < 0 || dx >= r || dy >= c) continue; if (room[dx][dy] == 'F' || room[dx][dy] == '#' || room[dx][dy] == 'J') continue; jq.push({ dx,dy }); room[dx][dy] = 'J'; if (dx == 0 || dy == 0 || dx == r - 1 || dx == c - 1) naga = 1; } time++; /* for (int i = 0; i < r; i++) { for (int j = 0; j < c; j++) { cout << room[i][j] << " "; } cout << "\n"; } */ } cout << "IMPOSSIBLE"; }

제출 #76449

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: