#include #include #include #include #include using namespace std; vector> checknum = { {1,2},{1,-2},{2,1},{2,-1},{-1,2},{-1,-2},{-2,-1},{-2,1} }; void bfs(vector>& board, vector>& numofhourse, vector>& stepnum,int n,int m){ int maxstep = board[n][m]; int step = 0; queue> que; que.push({ n,m }); vector> checkboard(board.size(), vector(board[0].size(), 0)); while (!que.empty() && step < maxstep) { int size = que.size(); for (int i = 0; i < size; i++) { int x = que.front().first; int y = que.front().second; que.pop(); stepnum[x][y] += step; numofhourse[x][y]++; checkboard[x][y] = 1; for (int j = 0; j < checknum.size(); j++) { int nx = x + checknum[j][0]; int ny = y + checknum[j][1]; if (nx >= 0 && nx < board.size() && ny >= 0 && ny < board[0].size() && checkboard[nx][ny] == 0) { checkboard[nx][ny] = 1; que.push({ nx,ny }); } } } step++; } } int main() { int row, col; cin >> row >> col; vector> board(row, vector(col, 0)); vector> numofhourse = board; vector> stepnum(row, vector(col, 0)); int counthourse = 0; for (int i = 0; i < row; i++) { for (int j = 0; j < col; j++) { string temp; cin >> temp; if (temp != ".") { board[i][j] = stoi(temp); counthourse++; } } } for (int i = 0; i < row; i++) { for (int j = 0; j < col; j++) { if (board[i][j] > 0) { bfs(board, numofhourse, stepnum, i, j); } } } int minstep = INT_MAX; for (int i = 0; i < row; i++) { for (int j = 0; j < col; j++) { if (numofhourse[i][j] == counthourse) { if (stepnum[i][j] < minstep) { minstep = stepnum[i][j]; } } } } if (minstep == INT_MAX) { cout << "0"; } else { cout << minstep; } return 0; }

NC33	合并两个排序的链表	2024-07-09	答案正确	3ms	556K	C++	题解
NC33	合并两个排序的链表	2024-07-04	答案正确	3ms	564K	C++	题解
NC21	链表内指定区间反转	2024-07-02	答案正确	5ms	444K	C++	题解
NC78	反转链表	2024-07-02	答案正确	3ms	412K	C++	题解