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:T650,#include #include using namespace std; short room[51][51] = {0}; short N, M = 0; short r, c, d = 0; short dx[4] = {-1, 0, 1, 0}; short dy[4] = {0, -1, 0, 1}; struct Movement { pair pos; short dir; }; queue q; int ans = 0; bool isValid(int x, int y) { return x >= 0 && y >= 0; } void clean() { while (!q.empty()) { bool canClean = false; Movement mvmt = q.front(); q.pop(); // cout << mvmt.pos.first << mvmt.pos.second << mvmt.dir << endl; if (room[mvmt.pos.first][mvmt.pos.second] == 0) { room[mvmt.pos.first][mvmt.pos.second] = 2; // Clean ans++; } for (int idx = 1; idx < 5; idx++) { short dir = (mvmt.dir + idx) % 4; // Turn ctr clockwise short x = mvmt.pos.first + dx[dir]; short y = mvmt.pos.second + dy[dir]; if (isValid(x, y) && room[x][y]

제출 #18877

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: