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:T67a,#include #include #include #include using namespace std; struct node { int y, x; int dist; }; vector> map; queue> fireq; queue stq; int w, h; int dy[] = { -1,1,0,0 }; int dx[] = { 0,0,-1,1 }; int in_range(int y, int x) { return y >= 0 && y < h && x >= 0 && x < w; } void fire() { int size = fireq.size(); while (size--) { paircur = fireq.front(); fireq.pop(); for (int i = 0;i < 4;i++) { int ny = cur.first + dy[i]; int nx = cur.second + dx[i]; if (!in_range(ny, nx)) continue; if (map[ny][nx] == 'F' || map[ny][nx] == '#') continue; fireq.push({ ny,nx }); map[ny][nx] = 'F'; } } } void go() { while (!stq.empty()) { int size = stq.size(); fire(); while (size--) { node cur = stq.front(); stq.pop(); for (int i = 0;i < 4;i++) { int

제출 #24722

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: