19:I[10086,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-5772593fb24fe823.js","7412","static/chunks/7412-44bfc7df6d166700.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","643","static/chunks/app/codes/%5Bid%5D/page-38137606830fba89.js"],"AdSenseInsert"] 1a:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5653","static/chunks/5653-e83dcf6c883f2fed.js","1394","static/chunks/1394-5772593fb24fe823.js","7412","static/chunks/7412-44bfc7df6d166700.js","2298","static/chunks/2298-6fcb566ac5ccd13f.js","643","static/chunks/app/codes/%5Bid%5D/page-38137606830fba89.js"],"CodeViewer"] 1b:T734,#include #include #include struct BufferType { int X, Y; bool BreakStatus; int Depth; }; int bMaze(std::vector>&, int, int); int main(int argc, char* argv[]){ int N = 0, M = 0; scanf("%d %d\n", &N, &M); std::vector> maze(N, std::vector(M, false)); for(int col = 0; col < N; col++){ for(int row = 0; row < M; row++){ char temp; scanf("%c", &temp); maze[col][row] = temp == '1' ? 1 : 0; } scanf("\n"); } printf("%d", bMaze(maze, N - 1, M - 1)); return 0; } int bMaze(std::vector>& maze, int col, int row) { std::queue buffer; std::vector>> visited(col + 1, std::vector>(row + 1, std::vector(2, false))); buffer.push ({0, 0, false, 0}); while (!buffer.empty()) { struct BufferType current = buffer.front(); buffer.pop(); if(current.X < 0 || current.Y < 0 || current.X > row || current.Y > col){ continue; } if(visited[current.Y][current.X][current.BreakStatus]){ continue; } if(maze[current.Y][current.X]){ if(current.BreakStatus){ continue; } current.BreakStatus = true; } if(current.X == row && current.Y =

코드 #1309