oj.uz

Submission #992693

# Submission time Handle Problem Language Result Execution time Memory
992693 2024-06-05T02:15:45 Z yellowtoad Dango Maker (JOI18_dango_maker) C++17
100 / 100
 320 ms 18108 KB 
#include <iostream>
using namespace std;

int n, m, dp[6010][3], sum, x, y, cnt;
char c[3010][3010];

int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) for (int j = 1; j <= m; j++) cin >> c[i][j];
	for (int i = 1; i <= 6010; i++) {
		x = i; y = 1; cnt = 0;
		while ((x >= 1) && (y <= m)) {
			++cnt;
			dp[cnt][0] = max(dp[cnt-1][0],max(dp[cnt-1][1],dp[cnt-1][2]));
			if ((x <= n) && (c[x][y] == 'G')) {
				if ((c[x-1][y] == 'R') && (c[x+1][y] == 'W')) dp[cnt][1] = max(dp[cnt-1][0],dp[cnt-1][1])+1;
				else dp[cnt][1] = 0;
				if ((c[x][y-1] == 'R') && (c[x][y+1] == 'W')) dp[cnt][2] = max(dp[cnt-1][0],dp[cnt-1][2])+1;
				else dp[cnt][2] = 0;
			} else dp[cnt][1] = dp[cnt][2] = 0;
			x--; y++;
		}
		sum += max(dp[cnt][0],max(dp[cnt][1],dp[cnt][2]));
	}
	cout << sum << endl;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 376 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 18 ms 348 KB Output is correct
55 Correct 1 ms 9052 KB Output is correct
56 Correct 19 ms 516 KB Output is correct
57 Correct 2 ms 6748 KB Output is correct
58 Correct 39 ms 5708 KB Output is correct
59 Correct 304 ms 18000 KB Output is correct
60 Correct 304 ms 18008 KB Output is correct
61 Correct 305 ms 18004 KB Output is correct
62 Correct 17 ms 344 KB Output is correct
63 Correct 304 ms 17776 KB Output is correct
64 Correct 268 ms 18108 KB Output is correct
65 Correct 261 ms 18000 KB Output is correct
66 Correct 320 ms 18000 KB Output is correct
67 Correct 259 ms 18000 KB Output is correct
68 Correct 262 ms 18000 KB Output is correct
69 Correct 271 ms 17876 KB Output is correct
70 Correct 45 ms 5696 KB Output is correct
71 Correct 45 ms 5600 KB Output is correct
72 Correct 35 ms 5724 KB Output is correct
73 Correct 35 ms 5456 KB Output is correct
74 Correct 35 ms 5712 KB Output is correct
75 Correct 36 ms 5724 KB Output is correct
76 Correct 35 ms 5472 KB Output is correct
77 Correct 35 ms 5712 KB Output is correct
78 Correct 36 ms 5468 KB Output is correct
79 Correct 35 ms 5700 KB Output is correct
80 Correct 37 ms 5468 KB Output is correct
81 Correct 37 ms 5596 KB Output is correct
82 Correct 35 ms 5604 KB Output is correct
83 Correct 35 ms 5724 KB Output is correct
84 Correct 36 ms 5468 KB Output is correct
85 Correct 36 ms 5472 KB Output is correct
86 Correct 36 ms 5456 KB Output is correct
87 Correct 38 ms 5456 KB Output is correct
88 Correct 38 ms 5468 KB Output is correct
89 Correct 35 ms 5468 KB Output is correct
90 Correct 35 ms 5600 KB Output is correct