Submission #1494737


Source Code Expand

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

using namespace std;

int dp[128][128][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 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

Submission Time
Task E - Salvage Robots
User Theodor1000
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2066 Byte
Status MLE
Exec Time 134 ms
Memory 288128 KB

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

Set Name Sample All
Score / Max Score 0 / 0 0 / 1400
Status
AC × 4
AC × 74
MLE × 2
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt, 1_70.txt, 1_71.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 4224 KB
0_01.txt AC 1 ms 2176 KB
0_02.txt AC 2 ms 8320 KB
0_03.txt AC 3 ms 12544 KB
1_00.txt AC 1 ms 2176 KB
1_01.txt AC 1 ms 4224 KB
1_02.txt AC 1 ms 2176 KB
1_03.txt AC 1 ms 4224 KB
1_04.txt AC 4 ms 14720 KB
1_05.txt AC 40 ms 205056 KB
1_06.txt AC 4 ms 16128 KB
1_07.txt AC 40 ms 205184 KB
1_08.txt AC 99 ms 150656 KB
1_09.txt AC 24 ms 42112 KB
1_10.txt AC 23 ms 72064 KB
1_11.txt AC 68 ms 212608 KB
1_12.txt AC 65 ms 150016 KB
1_13.txt AC 16 ms 35712 KB
1_14.txt AC 68 ms 200320 KB
1_15.txt AC 50 ms 207232 KB
1_16.txt AC 77 ms 138112 KB
1_17.txt AC 45 ms 184576 KB
1_18.txt AC 44 ms 167168 KB
1_19.txt AC 60 ms 103424 KB
1_20.txt AC 77 ms 220544 KB
1_21.txt MLE 101 ms 288128 KB
1_22.txt AC 58 ms 97536 KB
1_23.txt AC 55 ms 214656 KB
1_24.txt AC 9 ms 36608 KB
1_25.txt AC 35 ms 170496 KB
1_26.txt AC 9 ms 35200 KB
1_27.txt AC 38 ms 188672 KB
1_28.txt AC 5 ms 11904 KB
1_29.txt AC 19 ms 54912 KB
1_30.txt AC 34 ms 168320 KB
1_31.txt AC 8 ms 17920 KB
1_32.txt AC 13 ms 42624 KB
1_33.txt AC 35 ms 176384 KB
1_34.txt AC 6 ms 24320 KB
1_35.txt AC 44 ms 185088 KB
1_36.txt AC 39 ms 196864 KB
1_37.txt AC 3 ms 14720 KB
1_38.txt AC 6 ms 24320 KB
1_39.txt AC 35 ms 170240 KB
1_40.txt AC 134 ms 240768 KB
1_41.txt AC 123 ms 216192 KB
1_42.txt AC 101 ms 183296 KB
1_43.txt AC 117 ms 199680 KB
1_44.txt AC 103 ms 179072 KB
1_45.txt AC 119 ms 195840 KB
1_46.txt AC 131 ms 228352 KB
1_47.txt AC 115 ms 216064 KB
1_48.txt AC 114 ms 191488 KB
1_49.txt AC 132 ms 212096 KB
1_50.txt AC 109 ms 191488 KB
1_51.txt AC 110 ms 183424 KB
1_52.txt AC 120 ms 203776 KB
1_53.txt AC 129 ms 199808 KB
1_54.txt AC 119 ms 218240 KB
1_55.txt AC 120 ms 203776 KB
1_56.txt AC 68 ms 148096 KB
1_57.txt MLE 113 ms 273792 KB
1_58.txt AC 70 ms 158336 KB
1_59.txt AC 71 ms 146816 KB
1_60.txt AC 79 ms 159104 KB
1_61.txt AC 46 ms 121472 KB
1_62.txt AC 80 ms 154880 KB
1_63.txt AC 73 ms 144640 KB
1_64.txt AC 54 ms 134272 KB
1_65.txt AC 63 ms 158208 KB
1_66.txt AC 70 ms 152704 KB
1_67.txt AC 66 ms 162688 KB
1_68.txt AC 74 ms 152832 KB
1_69.txt AC 60 ms 132096 KB
1_70.txt AC 82 ms 177408 KB
1_71.txt AC 69 ms 140544 KB