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:T44d,#include #include #include #include using namespace std; vector> map; vector>visited; queue>q; int t,m,n,k, y, x,cnt; const int dy[4] = { -1,0,1,0 }; const int dx[4] = { 0,1,0,-1 }; void bfs(int a, int b) { visited[a][b]++; q.push({ a,b }); while (!q.empty()) { tie(y, x) = q.front(); q.pop(); for (int i = 0; i<4; i++) { int ny = dy[i] + y; int nx = dx[i] + x; if (nx < 0 || nx >= m || ny < 0 || ny >= n)continue; if (visited[ny][nx] || !map[ny][nx])continue; visited[ny][nx]++; q.push({ ny,nx }); } } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> t; while (t--) { cnt = 0; cin >> m>>n>>k; map.resize(m + 1, vector(n + 1)); visited.resize(m + 1, vector(n + 1)); for (int i = 0; i < k; i++) { int a, b;

제출 #16947

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: