Submission #1692498

---

Source Code Expand

#include <bits/stdc++.h>

#define For(i, j, k) for(int i = j; i <= k; i++)
#define Forr(i, j, k) for(int i = j; i >= k; i--)

using namespace std;

const int N = 105;

short n, m, X, Y;
short dp[N][N][N][N], cntx[N][N], cnty[N][N];
char S[N][N];

inline void chkmax(short& x, short v){
	x = x > v ? x : v;
}

int main(){

	scanf("%hd%hd", &n, &m);
	For(i, 1, n) scanf("%s", S[i] + 1);
	For(i, 1, n) For(j, 1, m) cntx[i][j] = cntx[i][j - 1] + (S[i][j] == 'o');
	For(i, 1, m) For(j, 1, n) cnty[i][j] = cnty[i][j - 1] + (S[j][i] == 'o');
	For(i, 1, n) For(j, 1, m) if(S[i][j] == 'E') X = i, Y = j;

	short ans = 0;
	For(a, 0, n) For(b, 0, m) Forr(c, n, a) Forr(d, m, b){
		short v = dp[a][b][c][d];
		short r = min(b + Y, d), l = max(d - (m + 1 - Y), b),
			  t = min(a + X, c), s = max(c - (n + 1 - X), a);
		
	//	printf("dp[%d][%d][%d][%d] = %d [%d, %d] [%d, %d]\n", a, b, c, d, v, l, r, s, t);

		short nx = X + a + 1;
		if(l <= r && nx <= c) chkmax(dp[a + 1][b][c][d], cntx[nx][r] - cntx[nx][l] + v);
		nx = c - (n + 1 - X);
		if(l <= r && nx > a) chkmax(dp[a][b][c - 1][d], cntx[nx][r] - cntx[nx][l] + v);
		nx = Y + b + 1;
		if(s <= t && nx <= d) chkmax(dp[a][b + 1][c][d], cnty[nx][t] - cnty[nx][s] + v);
		nx = d - (m + 1 - Y);
		if(s <= t && nx > b) chkmax(dp[a][b][c][d - 1], cnty[nx][t] - cnty[nx][s] + v);
		chkmax(ans, v);
	}

	printf("%hd\n", ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%hd%hd", &n, &m);
                         ^
./Main.cpp:21:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  For(i, 1, n) scanf("%s", S[i] + 1);
                                    ^

Judge Result