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:T683,#include #include #include #include using namespace std; typedef long long int ll; int n, m; ll arr[504][504]; int dy[4] = { -1, 0, 1, 0 }; int dx[4] = { 0, 1, 0, -1 }; vector> v; int visited[504][504]; ll ret = 0; void go(int y, int x, int num) { if (num == 0) { v.push_back({ y, x }); } if (num == 4) { ll tmp = 0; for (int i = 0; i < 4; i++) { tmp += arr[v[i].first][v[i].second]; } ret = max(tmp, ret); return; } for (int i = 0; i < 4; i++) { int ny = y + dy[i]; int nx = x + dx[i]; if (0 > ny || ny >= n || 0 > nx || nx >= m) continue; if (visited[ny][nx]) continue; v.push_back({ ny, nx }); visited[ny][nx] = 1; go(ny, nx, num + 1); visited[ny][nx] = 0; v.pop_back(); } //return } int main() { cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> arr[i][j]; } } ll cnt = 0; for (int i = 0; i < n;

제출 #103557

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: