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:T422,#define _CRT_SECURE_NO_WARNINGS #include #include using namespace std; queue, pair>> q; int arr[1002][1002] = { 0, }; int visit[1002][1002] = { 0, }; int main(void) { int n, m; scanf("%d %d", &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { scanf("%1d", &arr[i][j]); } } visit[1][1] = 1; q.push({ {false,1},{1,1}}); while (q.size() != 0) { int y = q.front().second.first; int x = q.front().second.second; bool s = q.front().first.first; int len = q.front().first.second; q.pop(); int dy[] = { 1,0,-1,0 }; int dx[] = { 0,1,0,-1 }; for (int d = 0; d < 4; d++) { int Y = y + dy[d]; int X = x + dx[d]; if (Y<1 || Y>n || X<1 || X>m || visit[Y][X] != 0) continue; if (arr[Y][X] == 1) { if (s == false) { visit[Y][X] = len; q.push({ {true ,len + 1},{Y,X} }); } } else { visit[Y][X] = len; q.push({ {s,len + 1},{Y,X

제출 #141556

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: