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:T791,#include #include #include #include #include using namespace std; int length, width; vector grid; queue> que; vector drow = { -1,0,1,0 }; vector dcol = { 0,1,0,-1 }; bool IsInbound(const int &row, const int &col) { return (row >= 0 && row < length && col >= 0 && col < width); } void Bfs() { while(!que.empty()) { // for (int row = 0; row < length; row++) { // cout << grid[row] << "\n"; // } // cout << "-----\n"; auto [type, tick, row, col] = que.front(); que.pop(); // if (type == '@' && ((row == 0 || row == length - 1) || (col == 0 || col == width - 1))) { // cout << tick + 1 << "\n"; // return; // } for (int d = 0; d < 4; d++) { int nrow = row + drow[d]; int ncol = col + dcol[d]; if (IsInbound(nrow, ncol)) { if (type == '@')

제출 #32355

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: