Submission #420227

---

Source Code Expand

// #include C {
#include<cstring>
#include<cassert>
#include<cstdio>
#include<cctype>
#include<cmath>
// }

// #include C++ {
#include<functional>
#include<algorithm>
#include<iostream>
#include<numeric>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<list>
#include<map>
#include<set>
// }
using namespace std;
// #typedef {
typedef long long int64;
typedef unsigned long long uint64;
typedef pair <int, int> PII;
typedef pair <char, char> PCC;
typedef pair <int64, int64> PLL;
typedef pair <double, double> PDD;
// }

// #parameter{
#ifdef DEBUG_MODE

#define TYPE decltype
#define RF(filename) {freopen((filename), "r", stdin);}
#define WF(filename) {freopen((filename), "w", stdout);}
#define DEBUG printf

#else

#define TYPE __typeof
#define RF(filename) {;}
#define WF(filename) {;}
#define DEBUG(...)

#endif

// #define {
#define SZ(a) ((int)(a).size())
#define X first
#define Y second
#define MP make_pair
#define L(x) ((x)<<1)
#define R(x) ((x)<<1 | 1)
#define max3(x, y, z) (max(max((x), (y)), (z)))
#define min3(x, y, z) (min(min((x), (y)), (z)))
#define BIT(x, i) (((x) >> (i)) & 1)
#define ALL(it) (it).begin(), (it).end()
#define FILL(__space, __val) memset(__space, __val, sizeof(__space))
#define MOVE(__spaceTo, __spaceFrom) memmove(__spaceTo, __spaceFrom, sizeof(__spaceTo))
#define FOR(it, c) for( TYPE((c).begin()) it = (c).begin(); it != (c).end(); it++)
/////////////////////////////////////////////////////////////
const double PI = acos(-1.0);
const double EPS = 1e-6;

#define MAX_N 505
#define MAX_M 4005
#define MAX_L 3005
#define MAXX 0x3f
#define UPPER 2147483647LL
#define INF ((1 << 30) - 1)
#define BINF ((1LL << 62) - 1LL)
#define NONE -1
#define NIL 0
// }

/////////////////////////////////////////////////////////////
const int OFFR[] = { 1, 0, -1, 0 };
const int OFFC[] = { 0, 1, 0, -1 };
char mapp[MAX_N][MAX_N];
bool G[MAX_N][MAX_N];
int H, W;
bool FloodFill(PII s, PII t){
	queue <PII> Q;
	Q.push(s);
	G[s.X][s.Y] = true;
	while (!Q.empty()){
		PII u = Q.front(); Q.pop();
		if (u == t)
			return true;
		for (int k = 0; k < 4; k++){
			int nr = u.X + OFFR[k];
			int nc = u.Y + OFFC[k];
			if (nr >= 0 && nr < H && nc >= 0 && nc < W && mapp[nr][nc] != '#'){
				if (!G[nr][nc]){
					G[nr][nc] = true;
					Q.push(PII(nr, nc));
				}
			}
		}
	}
	return false;
}
/////////////////////////////////////////////////////////////
int main(){
	RF("input.txt");
//	WF("output.txt");

	scanf("%d %d", &H, &W);
	for (int r = 0; r < H; r++) scanf("%s", mapp[r]);
	PII s, t;
	for (int r = 0; r < H; r++) for (int c = 0; c < W; c++){
		if (mapp[r][c] == 's')
			s = PII(r, c);
		if (mapp[r][c] == 'g')
			t = PII(r, c);
	}
	puts(FloodFill(s, t) ? "Yes" : "No");
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:112: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:113:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int r = 0; r < H; r++) scanf("%s", mapp[r]);
                                                  ^

Judge Result