Submission #535113

# Submission time Handle Problem Language Result Execution time Memory
535113 2022-03-09T12:55:28 Z amunduzbaev Dango Maker (JOI18_dango_maker) C++17
100 / 100
266 ms 68728 KB
#include "bits/stdc++.h"
using namespace std;

#define ar array

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m; cin>>n>>m;
	vector<string> a(n);
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	
	vector<vector<int>> in(n + m);
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			in[i + j].push_back(i);
		}
	}
	
	auto can = [&](int i, int j){
		return (0 < j && j+1 < m && a[i][j-1] == 'R' && a[i][j] == 'G' && a[i][j+1] == 'W');
	};
	
	auto can_ = [&](int i, int j){
		return (0 < i && i+1 < n && a[i-1][j] == 'R' && a[i][j] == 'G' && a[i+1][j] == 'W');
	};
	
	int res = 0;
	for(int s=0;s<n+m;s++){
		int k = in[s].size();
		vector<ar<int, 3>> dp(k + 1);
		for(int l=1;l<=k;l++){
			int i = in[s][l-1], j = s - i;
			dp[l][0] = max({dp[l-1][0], dp[l-1][1], dp[l-1][2]});
			if(can(i, j)) dp[l][1] = max(dp[l-1][0], dp[l-1][1]) + 1;
			if(can_(i, j)) dp[l][2] = max(dp[l-1][0], dp[l-1][2]) + 1;
		}
		
		res += max({dp[k][0], dp[k][1], dp[k][2]});
		//~ cout<<s<<" "<<dp[k][0]<<"\n";
	}
	
	cout<<res<<"\n";
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 1 ms 316 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 308 KB Output is correct
40 Correct 1 ms 312 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 316 KB Output is correct
45 Correct 1 ms 312 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 0 ms 308 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 1 ms 316 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 308 KB Output is correct
40 Correct 1 ms 312 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 0 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 316 KB Output is correct
45 Correct 1 ms 312 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 0 ms 308 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 460 KB Output is correct
55 Correct 1 ms 576 KB Output is correct
56 Correct 1 ms 460 KB Output is correct
57 Correct 1 ms 444 KB Output is correct
58 Correct 25 ms 7748 KB Output is correct
59 Correct 266 ms 68728 KB Output is correct
60 Correct 247 ms 68548 KB Output is correct
61 Correct 259 ms 68616 KB Output is correct
62 Correct 1 ms 460 KB Output is correct
63 Correct 249 ms 66324 KB Output is correct
64 Correct 200 ms 68600 KB Output is correct
65 Correct 172 ms 68616 KB Output is correct
66 Correct 187 ms 68712 KB Output is correct
67 Correct 173 ms 68508 KB Output is correct
68 Correct 210 ms 68612 KB Output is correct
69 Correct 187 ms 68664 KB Output is correct
70 Correct 19 ms 7760 KB Output is correct
71 Correct 22 ms 7748 KB Output is correct
72 Correct 20 ms 7728 KB Output is correct
73 Correct 18 ms 7752 KB Output is correct
74 Correct 22 ms 7656 KB Output is correct
75 Correct 19 ms 7756 KB Output is correct
76 Correct 18 ms 7648 KB Output is correct
77 Correct 17 ms 7728 KB Output is correct
78 Correct 17 ms 7772 KB Output is correct
79 Correct 17 ms 7736 KB Output is correct
80 Correct 18 ms 7736 KB Output is correct
81 Correct 19 ms 7740 KB Output is correct
82 Correct 18 ms 7728 KB Output is correct
83 Correct 17 ms 7648 KB Output is correct
84 Correct 18 ms 7740 KB Output is correct
85 Correct 20 ms 7748 KB Output is correct
86 Correct 17 ms 7748 KB Output is correct
87 Correct 18 ms 7636 KB Output is correct
88 Correct 18 ms 7700 KB Output is correct
89 Correct 18 ms 7716 KB Output is correct
90 Correct 19 ms 7752 KB Output is correct