oj.uz

Submission #332845

# Submission time Handle Problem Language Result Execution time Memory
332845 2020-12-03T17:08:41 Z parsabahrami Dango Maker (JOI18_dango_maker) C++17
100 / 100
 192 ms 18156 KB 
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 3e3 + 10, MOD = 1e9 + 7;
int n, m, dp[2][N], R = 0;
char S[N][N];

int pain(int i, int j) {
	return (S[i][j] == 'R' && S[i + 1][j] == 'G' && S[i + 2][j] == 'W' && i + 2 <= n);
}

int rast(int i, int j) {
	return (S[i][j] == 'R' && S[i][j + 1] == 'G' && S[i][j + 2] == 'W' && j + 2 <= m);
}

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%s", S[i] + 1);
	}
	for (int _ = 2; _ <= n + m; _++) {
		fill(dp[0], dp[0] + N, 0); int res = 0;
		fill(dp[1], dp[1] + N, 0);
		for (int i = 1, j; i <= n && i <= _ - 1; i++) {
			j = _ - i;
			if (j > m) continue;
			if (i >= 2) dp[0][i] = max(dp[0][i - 1], dp[1][i - 2]);
			dp[1][i] = dp[1][i - 1];
			if (pain(i, j)) dp[1][i] = max({dp[1][i], dp[0][i - 1] + 1, dp[1][i - 1] + 1});
			if (rast(i, j)) dp[0][i] = max(dp[0][i], dp[0][i - 1] + 1);
			res = max({res, dp[0][i], dp[1][i]});
		}
		R += res;
	}
	printf("%d\n", R);
	return 0;
}

Compilation message

dango_maker.cpp: In function 'int main()':
dango_maker.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
dango_maker.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |   scanf("%s", S[i] + 1);
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 236 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 380 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 32 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 37 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 22 ms 364 KB Output is correct
55 Correct 24 ms 9196 KB Output is correct
56 Correct 15 ms 384 KB Output is correct
57 Correct 15 ms 6272 KB Output is correct
58 Correct 27 ms 4332 KB Output is correct
59 Correct 189 ms 18028 KB Output is correct
60 Correct 189 ms 18032 KB Output is correct
61 Correct 192 ms 18028 KB Output is correct
62 Correct 14 ms 508 KB Output is correct
63 Correct 184 ms 17644 KB Output is correct
64 Correct 156 ms 18028 KB Output is correct
65 Correct 145 ms 18156 KB Output is correct
66 Correct 147 ms 18028 KB Output is correct
67 Correct 153 ms 18156 KB Output is correct
68 Correct 145 ms 18044 KB Output is correct
69 Correct 157 ms 18028 KB Output is correct
70 Correct 22 ms 4332 KB Output is correct
71 Correct 22 ms 4332 KB Output is correct
72 Correct 22 ms 4332 KB Output is correct
73 Correct 22 ms 4332 KB Output is correct
74 Correct 22 ms 4332 KB Output is correct
75 Correct 22 ms 4332 KB Output is correct
76 Correct 21 ms 4332 KB Output is correct
77 Correct 22 ms 4332 KB Output is correct
78 Correct 22 ms 4332 KB Output is correct
79 Correct 22 ms 4332 KB Output is correct
80 Correct 22 ms 4332 KB Output is correct
81 Correct 22 ms 4332 KB Output is correct
82 Correct 22 ms 4332 KB Output is correct
83 Correct 22 ms 4332 KB Output is correct
84 Correct 21 ms 4332 KB Output is correct
85 Correct 22 ms 4332 KB Output is correct
86 Correct 22 ms 4332 KB Output is correct
87 Correct 25 ms 4332 KB Output is correct
88 Correct 22 ms 4332 KB Output is correct
89 Correct 22 ms 4332 KB Output is correct
90 Correct 22 ms 4332 KB Output is correct