19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","8720","static/chunks/8720-56867bcc82acef59.js","7336","static/chunks/7336-86bf28e4cf7ec55b.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-cf9cea09ed04fbaf.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-b96c40fff0826c8c.js","7412","static/chunks/7412-44bfc7df6d166700.js","9362","static/chunks/9362-6e86a7341ceee1cd.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","8720","static/chunks/8720-56867bcc82acef59.js","7336","static/chunks/7336-86bf28e4cf7ec55b.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-cf9cea09ed04fbaf.js"],"TestCaseDisplay"] 1a:T7b5,#include #include using namespace std; char board[1001][1001]; int vis[1001][1001]; int fire[1001][1001]; int dx[4] = { 1, 0, -1, 0 }; int dy[4] = { 0, 1, 0, -1 }; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); for (int i = 0; i < 1001; i++) { fill(board[i], board[i] + 1001, '#'); } int n, m, s, ans = 1001; bool possible = false; string tmp; queue> Q; cin >> n >> m; for (int i = 0;i < n;i++) { cin >> tmp; int j = 0; for (auto x : tmp) { board[i][j] = x; j++; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (board[i][j] == 'F') { fire[i][j] = 1; Q.push({ i, j }); } } } while (!Q.empty()) { pair cur = Q.front(); Q.pop(); for (int dir = 0; dir < 4; dir++) { int nx = cur.first + dx[dir]; int ny = cur.second + dy[dir]; if (nx < 0 || nx >= n || ny < 0 || ny >= m) continue; if (fire[nx][ny] != 0 ||

제출 #50354

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: