1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T660,#include #include #include #include using namespace std; int M, N; const int dx[4] = {0,1,0,-1}; const int dy[4] = {1,0,-1,0}; struct Load { vector> Map; vector> visited; priority_queue, greater> result; queue> Path; bool ooB(array coord) {return coord[0] < 0 || coord[0] >= M || coord[1] < 0 || coord[1] >= N; } void Init(int M, int N) { Map.resize(M, vector(N)); visited.resize(M, vector(N)); } int FindPath() { if(Map[0][0] == -1) return -1; Path.push({0,0,Map[0][0]}); visited[0][0] = true; while(!Path.empty()) { auto cur = Path.front(); visited[cur[0]][cur[1]] = true; Path.pop(); for(int i = 0; i < 4; i++) { array pos = {cur[0] + dx[i], cur[1] + dy[i]}; if(ooB(pos) || visited[pos[0]][pos[1]] || Map[pos[0]][pos[1]] == -1 ) continue; else if(pos[0] == M - 1 && pos[1] == N -

제출 #108657

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: