题解

#include<bits/stdc++.h>
using namespace std;
int n,m,sx,sy,fx,fy,Map[16][16];
int x_move[4]={0,-1,0,1},y_move[4]={-1,0,1,0};
bool vis[16][16]={0},flag=0;
struct node{
    int x,y;
};
vector<node> v;
bool check(int next_x,int next_y){
    return next_x>=1&&next_x<=n&&next_y>=1&&next_y<=m&&!vis[next_x][next_y];
}
void dfs(int x,int y){
    if(x==fx&&y==fy){
        flag=1;
        cout<<"("<<v[0].x<<","<<v[0].y<<")";
    	for(int i=1;i<v.size();i++)
    		cout<<"->("<<v[i].x<<","<<v[i].y<<")";
        cout<<endl;
        return;
    }
    for(int i=0;i<4;i++){
        int next_x=x+x_move[i],next_y=y+y_move[i];
        if(check(next_x,next_y)&&Map[next_x][next_y]==1){
            vis[next_x][next_y]=1;
            v.push_back({next_x,next_y});
            dfs(next_x,next_y);
            vis[next_x][next_y]=0;
            v.pop_back();
        }
    }
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            cin>>Map[i][j];
    cin>>sx>>sy>>fx>>fy;
    vis[sx][sy]=1;
    v.push_back({sx,sy});
    dfs(sx,sy);
    if(flag==0)
        cout<<"-1";
    return 0;
}