Submission #1494761

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int **dp[128][128], part[128][128];
char str[128][128];

int calc (int x, int y, int a, int b)
{
    return part[a][b] - part[a][y - 1] - part[x - 1][b] + part[x - 1][y - 1];
}

int main ()
{
   // freopen ("file.in", "r", stdin);

    int n, m;
    scanf ("%d %d\n", &n, &m);

    int x, y;
    for (int i = 1; i <= n; ++i)
    {
        fgets (str[i] + 1, 128, stdin);

        for (int j = 1; j <= m; ++j)
        {
            part[i][j] = part[i - 1][j] + part[i][j - 1] - part[i - 1][j - 1] + (str[i][j] == 'o');
            if (str[i][j] == 'E') x = i, y = j;
        }
    }

    for (int i = 0; i <= y + 1; ++i)
        for (int j = 0; j <= m - y + 2; ++j)
        {
            dp[i][j] = new int* [x + 5];

            for (int h = 0; h <= x + 3; ++h)
            {
                dp[i][j][h] = new int [n - x + 2];
                for (int k = 0; k <= n - x; ++k)
                    dp[i][j][h][k] = 0;
            }
        }

    for (int l = 0; l <= y - 1; ++l)
        for (int r = 0; r <= m - y; ++r)
            for (int u = 0; u <= x - 1; ++u)
                for (int d = 0; d <= n - x; ++d)
                {
                    if (y + r + 1 < m - l + 1) dp[l][r + 1][u][d] = max (dp[l][r + 1][u][d], dp[l][r][u][d] + calc (max (x - u, d + 1), y + r + 1, min (x + d, n - u), y + r + 1));
                    else dp[l][r + 1][u][d] = max (dp[l][r + 1][u][d], dp[l][r][u][d]);

                    if (y - l - 1 > r) dp[l + 1][r][u][d] = max (dp[l + 1][r][u][d], dp[l][r][u][d] + calc (max (x - u, d + 1), y - l - 1, min (x + d, n - u), y - l - 1));
                    else dp[l + 1][r][u][d] = max (dp[l + 1][r][u][d], dp[l][r][u][d]);

                    if (x + d + 1 < n - u + 1) dp[l][r][u][d + 1] = max (dp[l][r][u][d + 1], dp[l][r][u][d] + calc (x + d + 1, max (y - l, r + 1), x + d + 1, min (y + r, m - l)));
                    else dp[l][r][u][d + 1] = max (dp[l][r][u][d + 1], dp[l][r][u][d]);

                    if (x - u - 1 > d) dp[l][r][u + 1][d] = max (dp[l][r][u + 1][d], dp[l][r][u][d] + calc (x - u - 1, max (y - l, r + 1), x - u - 1, min (y + r, m - l)));
                    else dp[l][r][u + 1][d] = max (dp[l][r][u + 1][d], dp[l][r][u][d]);
                }

    printf ("%d\n", dp[y - 1][m - y][x - 1][n - x]);

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d %d\n", &n, &m);
                              ^
./Main.cpp:25:39: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
         fgets (str[i] + 1, 128, stdin);
                                       ^

Judge Result