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:T7ff,#include #include using namespace std; char board[1000][1000]; int moved[1000][1000]; int dx[4] = { 1, 0, -1, 0 }; int dy[4] = { 0, 1, 0, -1 }; int main() { ios::sync_with_stdio(0); cin.tie(0); queue> q; queue> tempQ; int R, C; cin >> R >> C; for (int i = 0; i < R; i++) { string input; cin >> input; for (int j = 0; j < C; j++) { board[i][j] = input[j]; if (board[i][j] == 'J') { moved[i][j] = 1; q.push({ i, j }); } else if (board[i][j] == 'F') { tempQ.push({ i, j }); } } } while (!tempQ.empty()) { q.push(tempQ.front()); tempQ.pop(); } bool flag = true; bool success = false; int count = 0; while (!q.empty()) { if (success) break; pair cur = q.front(); q.pop(); if (board[cur.first][cur.second] == 'J') { for (int dir = 0; dir < 4; d

제출 #11818

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: