Submission #3438946


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define maxn 102
int n, m, XX, YY, ans; 
int a[maxn][maxn], b[maxn][maxn];
short f[maxn][maxn][maxn][maxn];

void Getmax(int &x, int y) { if(y > x) x = y; }
bool Mid(int K, int l, int r) { return (K >= l) && (K <= r); }

int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i ++)
        for(int j = 1; j <= m; j ++)
        {
            char c; cin >> c; int tem = 0;
            if(c == 'o') tem = 1;
            else if(c == 'E') XX = i, YY = j;
            a[i][j] = a[i][j - 1] + tem;
            b[j][i] = b[j][i - 1] + tem;
        }
    for(int u = 0; u < XX; u ++)
        for(int d = 0; d <= n - XX; d ++)
            for(int l = 0; l < YY; l ++)
                for(int r = 0; r <= m - YY; r ++)
                {
                    int ret = 0, tem1 = XX - u, tem2 = XX + d;
                    int tem3 = YY - l, tem4 = YY + r;
                    int p1 = min(YY + r, m - l), p2 = max(YY - l, r + 1); // line
                    int q1 = min(XX + d, n - u), q2 = max(XX - u, d + 1); // row
                    if(u) Getmax(ret, f[u - 1][d][l][r] + ((Mid(tem1, q2, q1)) ? max(a[tem1][p1] - a[tem1][p2 - 1], 0) : 0));
                    if(d) Getmax(ret, f[u][d - 1][l][r] + ((Mid(tem2, q2, q1)) ? max(a[tem2][p1] - a[tem2][p2 - 1], 0) : 0));
                    if(l) Getmax(ret, f[u][d][l - 1][r] + ((Mid(tem3, p2, p1)) ? max(b[tem3][q1] - b[tem3][q2 - 1], 0) : 0));
                    if(r) Getmax(ret, f[u][d][l][r - 1] + ((Mid(tem4, p2, p1)) ? max(b[tem4][q1] - b[tem4][q2 - 1], 0) : 0)); 
                    f[u][d][l][r] = ret;
                    ans = max(ans, (int) f[u][d][l][r]);
                }
    printf("%d\n", ans);
    return 0;
}

Submission Info

Submission Time
Task E - Salvage Robots
User Twilight_
Language C++14 (GCC 5.4.1)
Score 1400
Code Size 1767 Byte
Status AC
Exec Time 78 ms
Memory 205184 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1400 / 1400
Status
AC × 4
AC × 76
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 2304 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 2 ms 4352 KB
0_03.txt AC 2 ms 4352 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 2304 KB
1_03.txt AC 1 ms 2304 KB
1_04.txt AC 2 ms 768 KB
1_05.txt AC 2 ms 2304 KB
1_06.txt AC 41 ms 203136 KB
1_07.txt AC 41 ms 205184 KB
1_08.txt AC 68 ms 121600 KB
1_09.txt AC 34 ms 123392 KB
1_10.txt AC 10 ms 13184 KB
1_11.txt AC 51 ms 182656 KB
1_12.txt AC 33 ms 46720 KB
1_13.txt AC 23 ms 84480 KB
1_14.txt AC 53 ms 182656 KB
1_15.txt AC 9 ms 5760 KB
1_16.txt AC 48 ms 81024 KB
1_17.txt AC 18 ms 46720 KB
1_18.txt AC 43 ms 184704 KB
1_19.txt AC 44 ms 92800 KB
1_20.txt AC 51 ms 152064 KB
1_21.txt AC 61 ms 160384 KB
1_22.txt AC 50 ms 127488 KB
1_23.txt AC 44 ms 186752 KB
1_24.txt AC 40 ms 194944 KB
1_25.txt AC 41 ms 199040 KB
1_26.txt AC 4 ms 4864 KB
1_27.txt AC 4 ms 6400 KB
1_28.txt AC 37 ms 180608 KB
1_29.txt AC 42 ms 184704 KB
1_30.txt AC 35 ms 166400 KB
1_31.txt AC 37 ms 176512 KB
1_32.txt AC 39 ms 184704 KB
1_33.txt AC 3 ms 4352 KB
1_34.txt AC 41 ms 203136 KB
1_35.txt AC 42 ms 186880 KB
1_36.txt AC 6 ms 14464 KB
1_37.txt AC 2 ms 768 KB
1_38.txt AC 39 ms 194944 KB
1_39.txt AC 5 ms 8448 KB
1_40.txt AC 77 ms 107520 KB
1_41.txt AC 73 ms 107520 KB
1_42.txt AC 61 ms 101248 KB
1_43.txt AC 69 ms 95232 KB
1_44.txt AC 61 ms 88960 KB
1_45.txt AC 75 ms 123776 KB
1_46.txt AC 74 ms 95360 KB
1_47.txt AC 66 ms 97280 KB
1_48.txt AC 67 ms 91136 KB
1_49.txt AC 78 ms 105472 KB
1_50.txt AC 65 ms 97280 KB
1_51.txt AC 69 ms 109440 KB
1_52.txt AC 69 ms 91136 KB
1_53.txt AC 78 ms 109568 KB
1_54.txt AC 71 ms 107392 KB
1_55.txt AC 70 ms 97280 KB
1_56.txt AC 37 ms 50816 KB
1_57.txt AC 67 ms 150272 KB
1_58.txt AC 37 ms 52992 KB
1_59.txt AC 57 ms 152064 KB
1_60.txt AC 61 ms 154112 KB
1_61.txt AC 23 ms 35584 KB
1_62.txt AC 61 ms 154368 KB
1_63.txt AC 58 ms 148224 KB
1_64.txt AC 42 ms 121344 KB
1_65.txt AC 31 ms 44672 KB
1_66.txt AC 54 ms 144128 KB
1_67.txt AC 46 ms 123648 KB
1_68.txt AC 57 ms 146176 KB
1_69.txt AC 50 ms 140032 KB
1_70.txt AC 59 ms 145920 KB
1_71.txt AC 55 ms 145920 KB