华为机试：迷宫问题

#include <iostream>
#include <vector>
using namespace std;

vector<pair<int, int>> ans;
vector<pair<int, int>> road;

void dfs(vector<vector<int>> maze, int i, int j) {
    if (i < maze.size() && j < maze[0].size()) {
        if (maze[i][j] == 1) return;
        road.push_back(make_pair(i, j));
        maze[i][j] = 1;
        if (i == maze.size() - 1 && j == maze[0].size() - 1) {
            ans = road;
            return;
        }
        dfs(maze, i + 1, j);
        dfs(maze, i, j + 1);
        dfs(maze, i - 1, j);
        dfs(maze, i, j - 1);
        maze[i][j] = 0;
        road.pop_back();
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> maze;
    vector<int> temp;
    int tmp;
    for (int i = 0; i < n; i++) {
        temp.clear();
        for (int j = 0; j < m; j++) {
            cin >> tmp;
            temp.push_back(tmp);
        }
        maze.push_back(temp);
    }
    dfs(maze, 0, 0);
    for (auto it = ans.begin(); it != ans.end(); it++) {
        cout << '(' << it->first << ',' << it->second << ')' << endl;
    }
    return 0;
}