oj.uz

Submission #264908

# Submission time Handle Problem Language Result Execution time Memory
264908 2020-08-14T11:05:18 Z sahil_k Dango Maker (JOI18_dango_maker) C++14
100 / 100
 364 ms 35960 KB 
#include <iostream>
using namespace std;
#define MAXN 3005
int n, m;
char grid[MAXN][MAXN];
bool l[MAXN][MAXN], u[MAXN][MAXN];
int dp[MAXN][3];
int o = 0;
int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> m;
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) {
			cin >> grid[i][j];
		}
	}
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) {
			if (grid[i][j] != 'G') continue;
			if (i > 0 && i < n-1 && grid[i-1][j] == 'R' && grid[i+1][j] == 'W') u[i][j] = true;
			if (j > 0 && j < m-1 && grid[i][j-1] == 'R' && grid[i][j+1] == 'W') l[i][j] = true;
		}
	}
	for (int i=0; i<m; i++) {
		int x = 0, y = i;
		int dist = min(i, n-1);
		dp[0][0] = 0;
		dp[0][1] = l[x][y];
		dp[0][2] = u[x][y];
		x++; y--;
		for (int j=1; j<=dist; j++) {
			dp[j][0] = max(dp[j-1][0], max(dp[j-1][1], dp[j-1][2]));
			dp[j][1] = max(dp[j-1][0], dp[j-1][1])+l[x][y];
			dp[j][2] = max(dp[j-1][0], dp[j-1][2])+u[x][y];
			x++; y--;
		}
		o += max(dp[dist][0], max(dp[dist][1], dp[dist][2]));
	}
	for (int i=n-2; i>=0; i--) {
		int x=n-i-1, y = m-1;
		int dist = min(i, m-1);
		dp[0][0] = 0;
		dp[0][1] = l[x][y];
		dp[0][2] = u[x][y];
		x++; y--;
		for (int j=1; j<=dist; j++) {
			dp[j][0] = max(dp[j-1][0], max(dp[j-1][1], dp[j-1][2]));
			dp[j][1] = max(dp[j-1][0], dp[j-1][1])+l[x][y];
			dp[j][2] = max(dp[j-1][0], dp[j-1][2])+u[x][y];
			x++; y--;
		}
		o += max(dp[dist][0], max(dp[dist][1], dp[dist][2]));
	}
	cout << o << endl;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 416 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 416 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 488 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 0 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 384 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 416 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 488 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 0 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 384 KB Output is correct
54 Correct 1 ms 384 KB Output is correct
55 Correct 9 ms 9600 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 9 ms 14464 KB Output is correct
58 Correct 40 ms 10232 KB Output is correct
59 Correct 364 ms 35588 KB Output is correct
60 Correct 355 ms 35704 KB Output is correct
61 Correct 356 ms 35836 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 340 ms 35576 KB Output is correct
64 Correct 309 ms 35680 KB Output is correct
65 Correct 298 ms 35960 KB Output is correct
66 Correct 302 ms 35704 KB Output is correct
67 Correct 268 ms 24996 KB Output is correct
68 Correct 257 ms 25080 KB Output is correct
69 Correct 278 ms 31480 KB Output is correct
70 Correct 29 ms 10228 KB Output is correct
71 Correct 29 ms 10160 KB Output is correct
72 Correct 29 ms 10112 KB Output is correct
73 Correct 29 ms 10112 KB Output is correct
74 Correct 28 ms 10112 KB Output is correct
75 Correct 29 ms 10112 KB Output is correct
76 Correct 31 ms 10240 KB Output is correct
77 Correct 28 ms 10112 KB Output is correct
78 Correct 29 ms 10104 KB Output is correct
79 Correct 29 ms 10232 KB Output is correct
80 Correct 28 ms 10112 KB Output is correct
81 Correct 28 ms 10112 KB Output is correct
82 Correct 37 ms 10104 KB Output is correct
83 Correct 28 ms 10240 KB Output is correct
84 Correct 29 ms 10104 KB Output is correct
85 Correct 34 ms 10104 KB Output is correct
86 Correct 29 ms 10104 KB Output is correct
87 Correct 28 ms 10112 KB Output is correct
88 Correct 28 ms 10112 KB Output is correct
89 Correct 28 ms 10104 KB Output is correct
90 Correct 30 ms 10112 KB Output is correct