橙题求调

#include <bits/stdc++.h>
using namespace std;
int n,m,t,sx,sy,fx,fy,a[15][15],book[15][15],ans,dx[]={0,0,1,-1},dy[]={1,-1,0,0};
void dfs(int x,int y)
{
	if(x==sx&&y==sy)
	{
		ans++;
		return;
	}else
	{
		for(int i=0;i<=3;i++)
		{
			if(book[x+dx[i]][y+dy[i]]==a[x+dx[i]][y+dy[i]])
			{
				book[x][y]=1;
				dfs(x+dx[i],y+dy[i]);
				book[x][y]=0;
			}
		}
	}
}
signed main()
{
	cin>>n>>m>>t>>sx>>sy>>fx>>fy;
	for(int i=1;i<=t;i++)
	{
		int x,y;
		cin>>x>>y;
		a[x][y]=-1;
	}
	dfs(sx,sy);
	cout<<ans;
	return 0;
}