Submission #364973

# Submission time Handle Problem Language Result Execution time Memory
364973 2021-02-10T16:26:49 Z tushar_2658 Dango Maker (JOI18_dango_maker) C++14
100 / 100
442 ms 221804 KB
#include "bits/stdc++.h"
using namespace std;

const int maxn = 3005;
using ll = long long;

char s[maxn][maxn];
int n, m;
ll dp[maxn][maxn][3];
ll corner[maxn + maxn];

int main(int argc, char const *argv[])
{
  ios::sync_with_stdio(false);
  cin.tie(0);

  cin >> n >> m;
  for(int i = 1; i <= n; ++i){
    for(int j = 1; j <= m; ++j){
      cin >> s[i][j];
      if(s[i][j] == 'R')s[i][j] = 'A';
      else if(s[i][j] == 'G')s[i][j] = 'B';
      else s[i][j] = 'C';
    } 
  }

  for(int i = 1; i <= n; ++i){
    for(int j = 1; j <= m; ++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(s[i][j] == 'B'){
        if(s[i][j - 1] == 'A' && s[i][j + 1] == 'C'){
          dp[i][j][1] = max({dp[i][j][1], dp[i - 1][j + 1][0] + 1, dp[i - 1][j + 1][1] + 1});
        }
        if(s[i + 1][j] == 'C' && s[i - 1][j] == 'A'){
          dp[i][j][2] = max({dp[i][j][2], dp[i - 1][j + 1][0] + 1, dp[i - 1][j + 1][2] + 1});
        }
      }
      corner[i + j] = max({corner[i + j], dp[i][j][1], dp[i][j][2], dp[i][j][0]});
    }
  }
  ll ans = 0;
  for(int i = 1; i <= n + m; ++i){
    ans += corner[i];
  }
  cout << ans << '\n';

  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 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 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 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
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 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 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 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 0 ms 364 KB Output is correct
18 Correct 0 ms 364 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 0 ms 364 KB Output is correct
23 Correct 0 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 0 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 508 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 384 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 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 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 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 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 0 ms 364 KB Output is correct
18 Correct 0 ms 364 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 0 ms 364 KB Output is correct
23 Correct 0 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 0 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 508 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 384 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 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 492 KB Output is correct
55 Correct 14 ms 21612 KB Output is correct
56 Correct 1 ms 748 KB Output is correct
57 Correct 10 ms 14956 KB Output is correct
58 Correct 51 ms 30828 KB Output is correct
59 Correct 432 ms 221088 KB Output is correct
60 Correct 414 ms 221548 KB Output is correct
61 Correct 442 ms 221548 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 405 ms 221548 KB Output is correct
64 Correct 322 ms 221676 KB Output is correct
65 Correct 325 ms 221568 KB Output is correct
66 Correct 317 ms 221548 KB Output is correct
67 Correct 315 ms 221548 KB Output is correct
68 Correct 316 ms 221644 KB Output is correct
69 Correct 351 ms 221804 KB Output is correct
70 Correct 40 ms 31596 KB Output is correct
71 Correct 42 ms 31596 KB Output is correct
72 Correct 41 ms 31596 KB Output is correct
73 Correct 41 ms 31596 KB Output is correct
74 Correct 40 ms 31724 KB Output is correct
75 Correct 41 ms 31596 KB Output is correct
76 Correct 40 ms 31596 KB Output is correct
77 Correct 41 ms 31596 KB Output is correct
78 Correct 49 ms 31596 KB Output is correct
79 Correct 48 ms 31596 KB Output is correct
80 Correct 41 ms 31596 KB Output is correct
81 Correct 41 ms 31596 KB Output is correct
82 Correct 41 ms 31596 KB Output is correct
83 Correct 41 ms 31596 KB Output is correct
84 Correct 41 ms 31596 KB Output is correct
85 Correct 42 ms 31724 KB Output is correct
86 Correct 48 ms 31596 KB Output is correct
87 Correct 41 ms 31596 KB Output is correct
88 Correct 41 ms 31596 KB Output is correct
89 Correct 41 ms 31596 KB Output is correct
90 Correct 41 ms 31596 KB Output is correct