100分
by LEle0309 @ 2023-10-14 13:35:03
```c++
#include<bits/stdc++.h>
using namespace std;
int n,m,t,cnt,sx,sy,fx,fy;
int mat[10][10];
int book[10][10];
int nxt[4][2]={-1,0,1,0,0,-1,0,1};
void dfs(int x,int y){
if(x==fx&&y==fy){
cnt++;
return;
}
for(int i=0;i<4;i++){
int nx=x+nxt[i][0];
int ny=y+nxt[i][1];
if(nx>=1&&ny>=1&&nx<=n&&ny<=m&&mat[nx][ny]!=1&&book[nx][ny]==0){
book[nx][ny]=1;
dfs(nx,ny);
book[nx][ny]=0;
}
}
}
int main(){
cin>>n>>m>>t;
cin>>sx>>sy>>fx>>fy;
int x,y;
for(int i=1;i<=t;i++){
cin>>x>>y;
mat[x][y]=1;
}
book[sx][sy]=1;
dfs(sx,sy);
cout<<cnt;
return 0;
}
```
dfs AC
by zhouyk0501 @ 2023-10-14 13:45:59