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:T7ef,#include #include #include #include #include using namespace std; int dy[4] = { 0, 1,0 ,-1 }; int dx[4] = { 1, 0, -1, 0 }; int n, l, r; vector>v; vector>dist; int visit[54][54]; int ret = 0; int temp = 0; int sum = 0; bool flag = 0; void dfs(int y, int x, int num) { //cout << y << " " << x <<" "; temp++; sum += v[y][x]; visit[y][x] = num; //cout << visit[y][x] << "\n"; for (int i = 0; i < 4; i++) { int ny = y + dy[i]; int nx = x + dx[i]; if (ny >= n || ny < 0 || nx >= n || nx < 0) { continue; } if (visit[ny][nx] == num) { continue; } int cnt = abs(v[ny][nx] - v[y][x]); if (cnt >= l && cnt <= r) { flag = 1; //cout << v[y][x] <<" " << v[ny][nx] << " " << cnt << " " << ny << " " << nx << " "; dfs(ny, nx, num); } } } void dfs2(int y, int x, int num, int cnt) { dist[y][x] = num; for (int i = 0; i < 4; i++) { int ny = y + dy[i]; int

제출 #107091

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: