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:T6a5,#include #include #include #include using namespace std; queue> q; int ans[10000]; int arr[26][26]; int visited[26][26]; int n; int dx[4] = {1, -1, 0, 0}; int dy[4] = {0, 0, 1, -1}; void bfs(int a, int b, int c){ int cnt = 0; bool isZero = true; while(!q.empty()){ int x = q.front().second; int y = q.front().first; q.pop(); for(int i = 0; i<4; i++){ if((arr[y+dy[i]][x+dx[i]] != 0)) isZero = false; } if(isZero){ cnt = 1; break; } for(int i = 0; i<4; i++){ int X = x + dx[i]; int Y = y + dy[i]; if((X < 0) || (X > n) || (Y < 0) || (Y > n) || ((X == a) && (Y == b))) continue; else if(visited[Y][X] != 0) continue; else if(arr[Y][X] == 0) continue; else{ q.push(make_pair(Y, X)); visited[Y]

제출 #125462

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: