Submission #1113776

# Submission time Handle Problem Language Result Execution time Memory
1113776 2024-11-17T12:02:54 Z Dan4Life Dango Maker (JOI18_dango_maker) C++17
100 / 100
205 ms 10576 KB
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
const int N = (int)3e3+2;
int n, m, ans;
string s[N];

int calc(int i, int j){
	int x = i, y = j;
	vector<array<int,2>> v; v.clear(); v.pb({x,y});
	while(x+1<n and y) x++, y--, v.pb({x,y});
	reverse(all(v)); int dp[sz(v)+1][3];
	for(int i = 0; i <= sz(v); i++) 
		for(int j = 0; j < 3; j++) dp[i][j]=-N*N;
	dp[0][0] = dp[0][1] = dp[0][2] = 0;
	for(i = 1; i <= sz(v); i++){
		dp[i][0] = max({dp[i-1][0],dp[i-1][1],dp[i-1][2]});
		auto [x,y] = v[i-1];
		if(y+2<m and s[x][y]=='R' and s[x][y+1]=='G' and s[x][y+2]=='W')
			dp[i][1] = max({dp[i-1][0],dp[i-1][1],dp[i-1][2]})+1;
		if(x+2<n and s[x][y]=='R' and s[x+1][y]=='G' and s[x+2][y]=='W'){
			dp[i][2] = dp[i-1][2]+1;
			if(i>=2) dp[i][2] = max(dp[i][2], max(dp[i-2][0],dp[i-2][2])+1);
		}
	}
	return max({dp[sz(v)][0],dp[sz(v)][1],dp[sz(v)][2]});
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> m;
	for(int i = 0; i < n; i++) cin >> s[i];
	for(int j = 0; j < m; j++) ans+=calc(0,j);
	for(int i = 1; i < n; i++) ans+=calc(i,m-1);
	cout << ans << "\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 504 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 504 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 504 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 508 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 1 ms 500 KB Output is correct
46 Correct 1 ms 504 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 564 KB Output is correct
52 Correct 1 ms 504 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 504 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 504 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 508 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 336 KB Output is correct
29 Correct 1 ms 336 KB Output is correct
30 Correct 1 ms 336 KB Output is correct
31 Correct 1 ms 336 KB Output is correct
32 Correct 1 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 1 ms 336 KB Output is correct
35 Correct 1 ms 336 KB Output is correct
36 Correct 1 ms 336 KB Output is correct
37 Correct 1 ms 336 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 1 ms 336 KB Output is correct
45 Correct 1 ms 500 KB Output is correct
46 Correct 1 ms 504 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 564 KB Output is correct
52 Correct 1 ms 504 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 19 ms 1616 KB Output is correct
59 Correct 205 ms 10320 KB Output is correct
60 Correct 200 ms 10312 KB Output is correct
61 Correct 198 ms 10316 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 187 ms 9932 KB Output is correct
64 Correct 147 ms 10324 KB Output is correct
65 Correct 151 ms 10320 KB Output is correct
66 Correct 165 ms 10576 KB Output is correct
67 Correct 159 ms 10320 KB Output is correct
68 Correct 171 ms 10320 KB Output is correct
69 Correct 176 ms 10320 KB Output is correct
70 Correct 14 ms 1616 KB Output is correct
71 Correct 19 ms 1616 KB Output is correct
72 Correct 16 ms 1616 KB Output is correct
73 Correct 13 ms 1788 KB Output is correct
74 Correct 14 ms 1616 KB Output is correct
75 Correct 14 ms 1636 KB Output is correct
76 Correct 14 ms 1616 KB Output is correct
77 Correct 14 ms 1616 KB Output is correct
78 Correct 14 ms 1616 KB Output is correct
79 Correct 14 ms 1628 KB Output is correct
80 Correct 14 ms 1616 KB Output is correct
81 Correct 13 ms 1616 KB Output is correct
82 Correct 14 ms 1616 KB Output is correct
83 Correct 13 ms 1648 KB Output is correct
84 Correct 13 ms 1616 KB Output is correct
85 Correct 14 ms 1616 KB Output is correct
86 Correct 13 ms 1616 KB Output is correct
87 Correct 13 ms 1616 KB Output is correct
88 Correct 14 ms 1616 KB Output is correct
89 Correct 13 ms 1784 KB Output is correct
90 Correct 13 ms 1616 KB Output is correct