Submission #3568321

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#define maxn 505

char c[maxn][maxn];
bool vis[maxn][maxn];
int n,m,x,y,ans;

inline int read(){
	int w=0,x=0;char ch=0;
	while(!isdigit(ch)) w|=ch=='-',ch=getchar();
	while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return w?-x:x;
}

void dfs(int x,int y){
	vis[x][y]=1;
	if(c[x][y]=='g')  ans=1;
	if(c[x+1][y]!='^'&&c[x+1][y]!='s'&&c[x+1][y]!='#'&&vis[x+1][y]==0) dfs(x+1,y);
	if(c[x-1][y]!='^'&&c[x-1][y]!='s'&&c[x-1][y]!='#'&&vis[x-1][y]==0) dfs(x-1,y);
	if(c[x][y+1]!='^'&&c[x][y+1]!='s'&&c[x][y+1]!='#'&&vis[x][y+1]==0) dfs(x,y+1);
	if(c[x][y-1]!='^'&&c[x][y-1]!='s'&&c[x][y-1]!='#'&&vis[x][y-1]==0) dfs(x,y-1);
	vis[x][y]=0;
} 

int main(){
	n=read(),m=read();
	for(int i=0;i<=maxn;i++){
		for(int j=0;j<=maxn;j++){
			c[i][j]='^';
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>c[i][j];
			if(c[i][j]=='s') x=i,y=j;
		}
	}
	dfs(x,y);
	if(ans) cout<<"Yes";
	else cout<<"No";
	return 0;
} 

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:32:15: warning: iteration 505u invokes undefined behavior [-Waggressive-loop-optimizations]
    c[i][j]='^';
               ^
./Main.cpp:31:16: note: containing loop
   for(int j=0;j<=maxn;j++){
                ^

Judge Result