DFS TLE#1悬关求调

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int dx[]={0,0,1,-1};
const int dy[]={1,-1,0,0};
int a[15][15],ans=1e9,n,m,gx,gy;
void dfs(int x,int y,int xue,int times){
	if(xue==0 || times>m*n || times>ans) return ;
	if(a[x][y]==4) xue=6;
	if(x==gx && y==gy) ans=min(ans,times);
	else{
		for(int i=0;i<4;i++){
			int idx=x+dx[i],idy=y+dy[i];
			if(idx<1 || idx>n || idy<1 || idy>m || a[idx][idy]==0) continue;
			dfs(idx,idy,xue-1,times+1);
		}
	}
}
int main(){
	int fx,fy;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>a[i][j];
			if(a[i][j]==2){
				fx=i,fy=j;
			}
			if(a[i][j]==3){
				gx=i,gy=j;
			}
		}
	}
	int xue=6,times=0;
	dfs(fx,fy,xue,times);
	if(ans==1e9) cout<<-1;
	else cout<<ans;
	return 0;
}