Java P1605 迷宫

题目链接
这是一道dfs题目，注意回溯，我刚开始没有回溯只得了50分
import java.util.*;

import java.math.*;
public class Main {
	public static int m;
	public static int n;
	public static int ex;
	public static int ey;
	public static int res=0;
	public static int dx[]={1,-1,0,0},dy[]={0,0,-1,1};
    public static void main(String[] args){
    	Scanner sc=new Scanner(System.in);
    	m=sc.nextInt();
    	n=sc.nextInt();
    	int t=sc.nextInt();
    	int sx=sc.nextInt();
    	int sy=sc.nextInt();
    	ex=sc.nextInt();
    	ey=sc.nextInt();
    	int[][] maze=new int[m+1][n+1];
    	for(int i=0;i<t;i++)
    		maze[sc.nextInt()][sc.nextInt()]=1;
    	dfs(maze,sx,sy);
    	System.out.println(res);
    }
    public static void dfs(int[][] maze,int x,int y){
    	if(x==ex&&y==ey){
    	    res++;
    	    return;
    	}
    	maze[x][y]=1;
    	for(int i=0;i<4;i++){
    		int xx=x+dx[i];
    		int yy=y+dy[i];
    		if(xx<1||yy<1||xx>m||yy>n||maze[xx][yy]==1)
    			continue;
    		dfs(maze,xx,yy);
    		maze[xx][yy]=0;  //回溯
    	}
    }
}