9.11 流利说 2AC

第一题 二进制的 1

第二题 猫鼠游戏

BFS 即可

#include <iostream>
#include <vector>
#include <sstream>
#include <queue>
using namespace std;
vector<int> getVec(string str) {
    vector<int> res;
    stringstream ss(str);
    int tem;
    while(ss >> tem)
        res.push_back(tem);
    return res;
}
int main() {
    string str;
    vector<vector<int>> grid;
    while(getline(cin, str)) 
        grid.push_back(getVec(str));
    int m = grid.size(), n = grid[0].size(), start, tar, step = 0;
    vector<vector<bool>> used(m, vector<bool>(n, false));
    for(int i=0; i<m; i++)
        for(int j=0; j<n; j++) {
            if(grid[i][j] == 2) start = i*n+j, used[i][j] = true;
            if(grid[i][j] == 3) tar = i*n+j;
        }
    queue<int> que;
    que.push(start);
    vector<int> dx{0, 0, 1, -1};
    vector<int> dy{1, -1, 0, 0};
    while(!que.empty()) {
        int len = que.size();
        for(int i=0; i<len; i++) {
            int cur = que.front();
            if(cur == tar) {
                cout << step << endl;
                return 0;
            }
            que.pop();
            for(int j=0; j<4; j++) {
                int x = cur/n + dx[j], y = cur%n + dy[j];
                if(x<0 || y<0 || x>=m || y>=n || grid[x][y] == 1 || used[x][y]) 
                    continue;
                used[x][y] = true;
                que.push(x*n+y);
            }
        }
        step++;
    }

    return 0;
}