Submission #491547

# Submission time Handle Problem Language Result Execution time Memory
491547 2021-12-03T02:53:00 Z Joo Dango Maker (JOI18_dango_maker) C++17
100 / 100
269 ms 123992 KB
#include <bits/stdc++.h>
using namespace std;

const int N = 3e3+10;

char ta[N][N];
int dp[N][N][3], R, C;

int main(void){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> R >> C;
    for(int i = 1; i <= R; i++){
        for(int j = 1; j <= C; j++){
            cin >> ta[i][j];
        }
    }
    
    int ans = 0;
    for(int i = 1; i <= R; i++){
        for(int j = 1; j <= C; j++){
            dp[i][j][0] = max({dp[i-1][j+1][0], dp[i-1][j+1][1], dp[i-1][j+1][2]});
            if(ta[i][j-1] == 'R' and ta[i][j] == 'G' and ta[i][j+1] == 'W') dp[i][j][1] = 1 + max(dp[i-1][j+1][0], dp[i-1][j+1][1]);
            if(ta[i-1][j] == 'R' and ta[i][j] == 'G' and ta[i+1][j] == 'W') dp[i][j][2] = 1 + max(dp[i-1][j+1][0], dp[i-1][j+1][2]);

            if(j == 1 or i == R) ans += max({dp[i][j][0], dp[i][j][1], dp[i][j][2]});
        }
    }

    cout << ans << "\n";
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 320 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 0 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 316 KB Output is correct
44 Correct 0 ms 332 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 0 ms 320 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 0 ms 320 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 0 ms 332 KB Output is correct
40 Correct 0 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 316 KB Output is correct
44 Correct 0 ms 332 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 0 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 0 ms 320 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 8 ms 21324 KB Output is correct
56 Correct 1 ms 588 KB Output is correct
57 Correct 7 ms 14540 KB Output is correct
58 Correct 41 ms 20016 KB Output is correct
59 Correct 269 ms 123884 KB Output is correct
60 Correct 245 ms 123872 KB Output is correct
61 Correct 269 ms 123992 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 230 ms 123584 KB Output is correct
64 Correct 166 ms 123928 KB Output is correct
65 Correct 183 ms 123880 KB Output is correct
66 Correct 162 ms 123940 KB Output is correct
67 Correct 159 ms 123976 KB Output is correct
68 Correct 197 ms 123872 KB Output is correct
69 Correct 177 ms 123872 KB Output is correct
70 Correct 20 ms 19912 KB Output is correct
71 Correct 20 ms 19916 KB Output is correct
72 Correct 24 ms 19984 KB Output is correct
73 Correct 21 ms 19932 KB Output is correct
74 Correct 22 ms 20032 KB Output is correct
75 Correct 20 ms 19960 KB Output is correct
76 Correct 31 ms 20012 KB Output is correct
77 Correct 30 ms 19908 KB Output is correct
78 Correct 28 ms 20016 KB Output is correct
79 Correct 22 ms 19960 KB Output is correct
80 Correct 21 ms 20016 KB Output is correct
81 Correct 21 ms 19924 KB Output is correct
82 Correct 21 ms 20004 KB Output is correct
83 Correct 22 ms 19948 KB Output is correct
84 Correct 22 ms 20028 KB Output is correct
85 Correct 21 ms 20044 KB Output is correct
86 Correct 21 ms 19944 KB Output is correct
87 Correct 21 ms 19988 KB Output is correct
88 Correct 26 ms 19940 KB Output is correct
89 Correct 24 ms 19992 KB Output is correct
90 Correct 22 ms 19948 KB Output is correct