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:T527,#include #include #include #include #include #include #include #include #include using namespace std; struct Node { int y, x; }; int n; int arr[25][25]; int dan[25][25] = {}; vectorhouse; int cnt = 0; int dy[] = { -1,1,0,0 }; int dx[] = { 0,0,-1,1 }; void func(int sy, int sx) { queueq; int housecnt = 0; q.push({ sy,sx }); dan[sy][sx] = ++cnt; housecnt++; while (!q.empty()) { Node now = q.front(); q.pop(); for (int i = 0;i < 4;i++) { int ny = now.y + dy[i]; int nx = now.x + dx[i]; if (ny < 0 || nx < 0 || ny >= n || nx >= n) continue; if (arr[ny][nx] == 0) continue; if (dan[ny][nx] != 0) continue; dan[ny][nx] = cnt; housecnt++; q.push({ ny,nx }); } } house.push_back(housecnt); } int main() { ios_base::sync_wit

제출 #28892

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: