写在前面:
我可太牛了!第一次写就能得70分!信心倍增!
OMG!五分钟找出漏洞,我真是太棒啦!
这道题要注意,一定要将初始起点坐标状态设为true!
题目:
代码:
#include<algorithm>
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
int n,m;
int sx,sy,ex,ey;
int t;
char mp[10][10] = {'.'};
bool vis[10][10];
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
int cnt;
void dfs(int xx,int yy){
if(xx == ex && yy == ey){
cnt++;
return ;
}
for(int i=0;i<4;i++){
int nx = xx + dx[i];
int ny = yy + dy[i];
if(vis[nx][ny]) continue;
if(!vis[nx][ny] && mp[nx][ny] == '.'){
vis[nx][ny] = true;
dfs(nx,ny);
vis[nx][ny] = false;
}
}
return ;
}
int main()
{
scanf("%d%d%d",&n,&m,&t);
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
mp[i][j] = '.';
}
}
scanf("%d%d%d%d",&sx,&sy,&ex,&ey);
while(t--){
int x,y;
scanf("%d%d",&x,&y);
mp[x][y] = '#';
}
dfs(sx,sy);
printf("%d",cnt);
return 0;
}
结果:
AC代码:
#include<algorithm>
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
#include<cmath>
using namespace std;
int n,m;
int sx,sy,ex,ey;
int t;
char mp[20][20] = {'.'};
bool vis[20][20];
int dx[]={1,-1,0,0};
int dy[]={0,0,1,-1};
int cnt;
void dfs(int xx,int yy){
vis[xx][yy] = true;
if(xx == ex && yy == ey){
cnt++;
return ;
}
for(int i=0;i<4;i++){
int nx = xx + dx[i];
int ny = yy + dy[i];
if(vis[nx][ny]) continue;
if(nx <= 0 || nx > n || ny <= 0 || ny > m) continue;
if(mp[nx][ny] == '#') continue;
if(!vis[nx][ny] && mp[nx][ny] == '.'){
vis[nx][ny] = true;
dfs(nx,ny);
vis[nx][ny] = false;
}
}
return ;
}
int main()
{
scanf("%d%d%d",&n,&m,&t);
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
mp[i][j] = '.';
}
}
scanf("%d%d%d%d",&sx,&sy,&ex,&ey);
while(t--){
int x,y;
scanf("%d%d",&x,&y);
mp[x][y] = '#';
}
dfs(sx,sy);
printf("%d",cnt);
return 0;
}