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:T6bd,#include #include #include using namespace std; int Max = 0; int dx[] = { 0, 0, 1, -1 }; int dy[] = { 1, -1, 0, 0 }; vector> paper; vector> visit; void Tetromino(int n, int m, int i, int j, int sum, int cnt) { sum += paper[i][j]; if (cnt == 3) { Max = max(sum, Max); return; } else { for (int d = 0; d < 4; d++) { if (i + dx[d] >= 0 && i + dx[d] < n && j + dy[d] >= 0 && j + dy[d] < m && visit[i + dx[d]][j + dy[d]] == 0) { visit[i+dx[d]][j+dy[d]]++; Tetromino(n, m, i + dx[d], j + dy[d], sum, cnt + 1); visit[i + dx[d]][j + dy[d]]--; } } } } void T_block(int n, int m, int i, int j) { int t; if (i - 1 >= 0 && i + 1 < n && j - 1 > 0) { t = paper[i][j] + paper[i - 1][j - 1] + paper[i][j - 1] + paper[i + 1][j - 1]; Max = max(t, Max); } if (i - 1 >= 0 && i + 1 <

제출 #21266

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: