Submission #3016172


Source Code Expand

#include <algorithm>
#include <cstdio>
char str[105][105];
int row_pre[105][105], col_pre[105][105], dp[105][105][105][105];
int main()
{
	// freopen("AGC004-E.in", "r", stdin);
	int n, m, x, y;
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i++)
	{
		scanf("%s", str[i]);
		for (int j = 0; j < m; j++)
		{
			row_pre[i][j] = j ? row_pre[i][j - 1] : 0;
			col_pre[i][j] = i ? col_pre[i - 1][j] : 0;
			if (str[i][j] == 'E')
			{
				x = i;
				y = j;
			}
			if (str[i][j] == 'o')
			{
				row_pre[i][j]++;
				col_pre[i][j]++;
			}
		}
	}
	auto calc_y = [&] (int idx, int l, int r)
	{
		int ll = std::max(l, r - y), rr = std::min(r, m - 1 - y + r);
		if (ll > rr)
			return 0;
		return row_pre[idx][rr] - (ll ? row_pre[idx][ll - 1] : 0);
	};
	auto calc_x = [&] (int idx, int l, int r)
	{
		int ll = std::max(l, r - x), rr = std::min(r, n - 1 - x + l);
		if (ll > rr)
			return 0;
		return col_pre[rr][idx] - (ll ? col_pre[ll - 1][idx] : 0);
	};
	auto upd = [&] (int &a, const int &b)
	{
		if (a < b)
			a = b;
	};
	for (int i = 0; i <= x; i++)
	{
		for (int j = n - 1; j >= x; j--)
		{
			for (int k = 0; k <= y; k++)
			{
				for (int t = m - 1; t >= y; t--)
				{
					if (i > j - x)
						upd(dp[i][j][k][t], dp[i - 1][j][k][t] + calc_y(i - 1, k, t));
					if (j < n - 1 - x + i)
						upd(dp[i][j][k][t], dp[i][j + 1][k][t] + calc_y(j + 1, k, t));
					if (k > t - y)
						upd(dp[i][j][k][t], dp[i][j][k - 1][t] + calc_x(k - 1, i, j));
					if (t < m - 1 - y + k)
						upd(dp[i][j][k][t], dp[i][j][k][t + 1] + calc_x(t + 1, i, j));
				}
			}
		}
	}
	printf("%d\n", dp[x][x][y][y]);
	return 0;
}

Submission Info

Submission Time
Task E - Salvage Robots
User diamond_duke
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1674 Byte
Status WA
Exec Time 92 ms
Memory 235776 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1400
Status
AC × 4
AC × 44
WA × 32
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 2176 KB
0_01.txt AC 1 ms 128 KB
0_02.txt AC 1 ms 4224 KB
0_03.txt AC 1 ms 4352 KB
1_00.txt AC 0 ms 128 KB
1_01.txt WA 1 ms 128 KB
1_02.txt AC 1 ms 2176 KB
1_03.txt WA 1 ms 2176 KB
1_04.txt AC 1 ms 4608 KB
1_05.txt WA 3 ms 6400 KB
1_06.txt AC 40 ms 205056 KB
1_07.txt WA 41 ms 209152 KB
1_08.txt AC 82 ms 225536 KB
1_09.txt AC 47 ms 203008 KB
1_10.txt AC 12 ms 31360 KB
1_11.txt WA 54 ms 213248 KB
1_12.txt WA 42 ms 103552 KB
1_13.txt AC 33 ms 145664 KB
1_14.txt AC 56 ms 217344 KB
1_15.txt AC 9 ms 13696 KB
1_16.txt WA 61 ms 162304 KB
1_17.txt WA 27 ms 103680 KB
1_18.txt WA 45 ms 205056 KB
1_19.txt AC 59 ms 192768 KB
1_20.txt AC 57 ms 196864 KB
1_21.txt WA 68 ms 223488 KB
1_22.txt AC 64 ms 221440 KB
1_23.txt AC 45 ms 200960 KB
1_24.txt AC 39 ms 198912 KB
1_25.txt WA 42 ms 211200 KB
1_26.txt AC 4 ms 12800 KB
1_27.txt WA 5 ms 14464 KB
1_28.txt AC 44 ms 223488 KB
1_29.txt AC 46 ms 215296 KB
1_30.txt WA 38 ms 190720 KB
1_31.txt AC 46 ms 227584 KB
1_32.txt AC 41 ms 200960 KB
1_33.txt WA 4 ms 10240 KB
1_34.txt AC 40 ms 205056 KB
1_35.txt WA 47 ms 221440 KB
1_36.txt WA 8 ms 32768 KB
1_37.txt AC 1 ms 2560 KB
1_38.txt AC 39 ms 198912 KB
1_39.txt WA 6 ms 18304 KB
1_40.txt WA 92 ms 215296 KB
1_41.txt WA 88 ms 215296 KB
1_42.txt AC 74 ms 192768 KB
1_43.txt AC 82 ms 194944 KB
1_44.txt AC 72 ms 174464 KB
1_45.txt AC 88 ms 223488 KB
1_46.txt WA 89 ms 199040 KB
1_47.txt WA 80 ms 194816 KB
1_48.txt AC 81 ms 194944 KB
1_49.txt WA 92 ms 213248 KB
1_50.txt AC 78 ms 194816 KB
1_51.txt AC 83 ms 211200 KB
1_52.txt AC 82 ms 186752 KB
1_53.txt AC 92 ms 217344 KB
1_54.txt AC 85 ms 215296 KB
1_55.txt AC 83 ms 194816 KB
1_56.txt WA 45 ms 107520 KB
1_57.txt WA 77 ms 227584 KB
1_58.txt WA 46 ms 113664 KB
1_59.txt AC 69 ms 235776 KB
1_60.txt AC 70 ms 229632 KB
1_61.txt AC 30 ms 80512 KB
1_62.txt WA 72 ms 233728 KB
1_63.txt WA 67 ms 221440 KB
1_64.txt AC 50 ms 182528 KB
1_65.txt WA 40 ms 99456 KB
1_66.txt WA 63 ms 211200 KB
1_67.txt WA 55 ms 184576 KB
1_68.txt WA 65 ms 213248 KB
1_69.txt WA 62 ms 217344 KB
1_70.txt AC 67 ms 215296 KB
1_71.txt AC 67 ms 227584 KB