WA救我!!!
在下不才,代码如下:
#include<stdio.h>
#include<iostream>
using namespace std;
char a[1005][1005];
bool bj[1005][1005];
const int dx[]={0,0,1,0,-1};
const int dy[]={0,1,0,-1,0};
bool flag;
int n,m,v,c,d,e;
void dfs(int x,int y){
if(x==v&&y==c){
flag=true;
return;
}
for(int i=1;i<=4;++i){
if(flag) return;
int xx=x+dx[i];
int yy=y+dy[i];
if(xx>v&&xx<=n&&yy>c&&yy<=m&&bj[xx][yy]==0&&a[xx][yy]=='.'){
bj[xx][yy]=1;
dfs(xx,yy);
}
}
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;++i){
for(int j=1;j<=m;j++){
cin>>a[i][j];
if(a[i][j]=='s'){
v=i;
c=j;
}else if(a[i][j]=='g'){
d=i;
e=j;
}
}
}
if(a[d][e]=='#'||a[v][c]=='#'){
printf("NO");
return 0;
}
bj[v][c]=1;
dfs(v,c);
if(flag){
printf("YES");
cout<<endl;
}else{
printf("NO");
cout<<endl;
}
return 0;
}