Submission #676940

# Submission time Handle Problem Language Result Execution time Memory
676940 2023-01-01T17:04:21 Z cristi_a Dango Maker (JOI18_dango_maker) C++17
100 / 100
612 ms 68796 KB
#include <bits/stdc++.h>
using namespace std;

int 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<vector<int>> dp(k+1, vector<int>(3));
    	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 << res << "\n";
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 316 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 316 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 320 KB Output is correct
35 Correct 0 ms 320 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 320 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 316 KB Output is correct
45 Correct 1 ms 320 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 320 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 0 ms 320 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 316 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 320 KB Output is correct
35 Correct 0 ms 320 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 320 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 316 KB Output is correct
45 Correct 1 ms 320 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 320 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 62 ms 7804 KB Output is correct
59 Correct 612 ms 68716 KB Output is correct
60 Correct 612 ms 68728 KB Output is correct
61 Correct 604 ms 68792 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 587 ms 66580 KB Output is correct
64 Correct 530 ms 68720 KB Output is correct
65 Correct 536 ms 68724 KB Output is correct
66 Correct 540 ms 68736 KB Output is correct
67 Correct 528 ms 68744 KB Output is correct
68 Correct 545 ms 68796 KB Output is correct
69 Correct 537 ms 68728 KB Output is correct
70 Correct 54 ms 7768 KB Output is correct
71 Correct 55 ms 7800 KB Output is correct
72 Correct 56 ms 7776 KB Output is correct
73 Correct 57 ms 7780 KB Output is correct
74 Correct 55 ms 7804 KB Output is correct
75 Correct 56 ms 7756 KB Output is correct
76 Correct 55 ms 7804 KB Output is correct
77 Correct 63 ms 7808 KB Output is correct
78 Correct 55 ms 7784 KB Output is correct
79 Correct 56 ms 7764 KB Output is correct
80 Correct 55 ms 7772 KB Output is correct
81 Correct 55 ms 7760 KB Output is correct
82 Correct 56 ms 7772 KB Output is correct
83 Correct 55 ms 7804 KB Output is correct
84 Correct 60 ms 7764 KB Output is correct
85 Correct 55 ms 7756 KB Output is correct
86 Correct 55 ms 7764 KB Output is correct
87 Correct 54 ms 7812 KB Output is correct
88 Correct 55 ms 7764 KB Output is correct
89 Correct 56 ms 7804 KB Output is correct
90 Correct 63 ms 7800 KB Output is correct