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:T6cf,#include #include #include #include #include #include #define MOVE_MAX 4 using namespace std; int move_x[MOVE_MAX] = { -1,1,0,0 }; int move_y[MOVE_MAX] = { 0,0,-1,1 }; int BFS(vector& board, int n, int m) { int min_count = INT_MAX; bool visited[1001][1001][2] = { false, }; queue, pair>> q; q.push({ {0,0},{1,1} }); visited[0][0][1] = true; while (1) { if (q.empty()) { break; } int cur_x = q.front().first.second; int cur_y = q.front().first.first; int cur_break_count = q.front().second.first; int cur_move_count = q.front().second.second; q.pop(); if (cur_x == m - 1 && cur_y == n - 1) { min_count = min(min_count, cur_move_count); } for (int i = 0; i < MOVE_MAX; i++) { int next_x = cur_x + move_x[i]; int next_y = cur_y + move_y[i]; if (next_x >= 0 && next_x < m && next_y >= 0 && next_y < n) { if (cu

제출 #51712

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: