19:I[48803,["6079","static/chunks/363642f4-4672ca396f99db0d.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","2298","static/chunks/2298-6fcb566ac5ccd13f.js","8720","static/chunks/8720-56867bcc82acef59.js","7336","static/chunks/7336-86bf28e4cf7ec55b.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-cf9cea09ed04fbaf.js"],"CodeViewer"] 1b:I[48988,["6079","static/chunks/363642f4-4672ca396f99db0d.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","2298","static/chunks/2298-6fcb566ac5ccd13f.js","8720","static/chunks/8720-56867bcc82acef59.js","7336","static/chunks/7336-86bf28e4cf7ec55b.js","9211","static/chunks/9211-d3f977dbde988018.js","9791","static/chunks/app/submission/%5Bid%5D/page-cf9cea09ed04fbaf.js"],"TestCaseDisplay"] 1a:T536,#include #include #include #include #include #include #include #include #include #include #include using namespace std; const int dy[4] = { -1, 0, 1, 0 }; const int dx[4] = { 0, 1, 0, -1 }; int n, cnt = 0; int apart[30][30]; int visited[30][30]; int dfs(int y, int x) { visited[y][x] = cnt; int count = 1; for (int i = 0; i < 4; ++i) { int ny = y + dy[i]; int nx = x + dx[i]; if (ny < 0 || nx < 0 || ny >= n || nx >= n) continue; if (apart[ny][nx] == 1 && !visited[ny][nx]) { // 단지 번호를 부여하고 인근 탐색 count += dfs(ny, nx); } } return count; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j) scanf("%1d", &apart[i][j]); } vector res; for (int i = 0; i < n; ++i) { for (int j = 0; j < n; ++j)

제출 #52235

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: