19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.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","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.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","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"TestCaseDisplay"] 1a:T70a,#include #include #include #include #define MAX 1001 using namespace std; queue> q; int r, c; char board[MAX][MAX]; int jh[MAX][MAX]; int fire[MAX][MAX]; void bfs() { int dx[4] = {0, 1, 0, -1}; int dy[4] = {1, 0, -1, 0}; while(!q.empty()) { auto[cx, cy, w] = q.front(); q.pop(); for (int i = 0; i < 4; i++) { int nx = cx + dx[i]; int ny = cy + dy[i]; // 개방된 벽에 다다름. if (nx < 0 || nx >= r || ny < 0 || ny >= c) { if (w == '*') continue; else { cout << jh[cx][cy] + 1 << '\n'; return; } } // 벽에 막힘. if (board[nx][ny] == '#') continue; // 이미 지나온 길. if (jh[nx][ny] != -1 || fire[nx][ny] != -1) continue; // 이동하면 불한테 잡힘. if ((jh[cx][cy] + 1 >= fire[nx][ny]) && fire[nx]

제출 #26145

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: