```
#include<bits/stdc++.h>
using namespace std;
int a,b;
int bzw;
int ans=0;
int n;
struct node{
int x,y;
}z;
int wzx[2]={0,1};
int wzy[2]={1,0};
int gzd[100][100];
int main()
{
memset(gzd,0,sizeof(gzd));
cin>>a>>b;
cin>>n;
for(int i=1;i<=n;i++){
int nx,ny;
cin>>nx>>ny;
gzd[nx][ny]=1;
}
queue<node> q;
z.x=1;
z.y=1;
q.push(z);
while(!q.empty()){
node dlt=q.front();
q.pop();
for(int i=0;i<2;i++){
int newx=dlt.x+wzx[i];
int newy=dlt.y+wzy[i];
z.x=newx;
z.y=newy;
if(newx<1 || newy<1 || newx>n || newy>n || gzd[newx][newy]==1){
continue;
}
if(newx==a && newy==b){
ans++;
continue;
}
q.push(z);
}
}
cout<<ans;
return 0;
}
```
by wscmh @ 2023-11-04 13:31:24
~~注：~~深搜不会用~~~~
by wscmh @ 2023-11-04 13:35:44
这里不是n，应该是a，b。
```cpp
if(newx<1 || newy<1 || newx>n || newy>n || gzd[newx][newy]==1)
```
by Miss_SGT @ 2023-11-04 14:04:28
@[wscmh](/user/1017173) 还有这道题搜索过不了
by Miss_SGT @ 2023-11-04 14:04:58
newx>n || newy>n
不是n吧
by Bruce20110709 @ 2023-11-04 14:19:54
@[zhouchenqiao1](/user/705012) @[Bruce20110709](/user/798942)
谢谢
by wscmh @ 2023-11-04 17:40:56
@[zhouchenqiao1](/user/705012)
我这是广搜
by wscmh @ 2023-11-04 17:41:42
全部已关
by wscmh @ 2023-11-04 17:42:05
@[wscmh](/user/1017173) 我知道，但是你这样时间是阶乘的，会TLE
by Miss_SGT @ 2023-11-04 19:40:36
@[zhouchenqiao1](/user/705012)
搜索过得了
我就改了那个n的问题
AC了
by wscmh @ 2023-11-05 07:28:42