Submission #2530363

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>

using namespace std;
typedef pair<int, int> P;
int main()
{
	int h, w;
	scanf("%d %d", &h, &w);
	char c[500][500];
	for(int i=0; i<h; i++){
		scanf("%s", c[i]);
	}
	int sx, sy, gx, gy;
	for(int i=0; i<h; i++){
		for(int j=0; j<w; j++){
			if(c[i][j]=='s') sx=i, sy=j;
			if(c[i][j]=='g') gx=i, gy=j;
		}
	}
	vector<P> d;
	d.push_back(P(sx, sy));
	int used[500][500]={};
	used[sx][sy]=1;
	while(!d.empty()){
		P p=d.back();
		d.pop_back();
		int i=p.first, j=p.second;
		if(i==gx && j==gy){
			printf("%s\n", "Yes");
			return 0;
		}
		if(i-1>=0 && used[i-1][j]==0 && c[i-1][j]!='#'){
			d.push_back(P(i-1, j));
			used[i-1][j]=1;
		}
		if(j-1>=0 && used[i][j-1]==0 && c[i][j-1]!='#'){
			d.push_back(P(i, j-1));
			used[i][j-1]=1;
		}
		if(i+1<h && used[i+1][j]==0 && c[i+1][j]!='#'){
			d.push_back(P(i+1, j));
			used[i+1][j]=1;
		}
		if(j+1<w && used[i][j+1]==0 && c[i][j+1]!='#'){
			d.push_back(P(i, j+1));
			used[i][j+1]=1;
		}
	}
	printf("%s\n", "No");		
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &h, &w);
                        ^
./Main.cpp:21:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", c[i]);
                    ^

Judge Result