19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.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","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.js","5000","static/chunks/5000-a7bfe5b9669501e3.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","8720","static/chunks/8720-56867bcc82acef59.js","7881","static/chunks/7881-fa5bad7aa783c72e.js","3692","static/chunks/3692-317eca9943285a39.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-52998aeb8359bb9f.js"],"TestCaseDisplay"] 1a:T63f, // Online C++ Compiler - Build, Compile and Run your C++ programs online in your favorite browser #include #include #include using namespace std; int N; int M; vector> G; int ans = 0; int dx[4] = {-1, 1, 0, 0}; int dy[4] = {0, 0, 1, -1}; void search(int cx, int cy, int sum, int depth, vector> &visited) { if (depth == 4) { ans = max(ans, sum); return; } visited[cx][cy] = true; for (int i = 0; i < 4; i++) { int nx = cx + dx[i]; int ny = cy + dy[i]; if (nx < 0 || nx > N - 1 || ny < 0 || ny > M - 1 || visited[nx][ny]) { continue; } else { search(nx, ny, sum + G[nx][ny], depth + 1, visited); } } visited[cx][cy] = false; } void crs(int cx, int cy) { int sum = G[cx][cy]; vector p; for (int i = 0; i < 4; i++) { in

제출 #48605

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: