oj.uz

Submission #654293

# Submission time Handle Problem Language Result Execution time Memory
654293 2022-10-30T22:14:02 Z lunchbox1 Dango Maker (JOI18_dango_maker) C++17
100 / 100
 144 ms 19136 KB 
/*
 Dango Maker
 https://oj.uz/problem/view/JOI18_dango_maker
*/
#include <bits/stdc++.h>
using namespace std;

const int N = 3e3;

int main() {
 ios::sync_with_stdio(0), cin.tie(0);
 int n, m; cin >> n >> m;
 static string s[N];
 for (int i = 0; i < n; i++) cin >> s[i];
 static int f[N][3];
 int ans = 0;
 for (int k = 0; k < n + m - 1; k++) {
  int p = -1;
  for (int i = 0; i < n; i++) {
   int j = k - i;
   if (j < 0 || j >= m) continue;
   f[i][0] = f[i][1] = f[i][2] = 0;
   if (p == -1) {
    if (j > 0 && j < m - 1 && s[i][j - 1] == 'R' && s[i][j] == 'G' && s[i][j + 1] == 'W')
     f[i][1] = 1;
    if (i > 0 && i < n - 1 && s[i - 1][j] == 'R' && s[i][j] == 'G' && s[i + 1][j] == 'W')
     f[i][2] = 1;
   } else {
    f[i][0] = max({f[p][0], f[p][1], f[p][2]});
    if (j > 0 && j < m - 1 && s[i][j - 1] == 'R' && s[i][j] == 'G' && s[i][j + 1] == 'W')
     f[i][1] = max(f[p][0], f[p][1]) + 1;
    if (i > 0 && i < n - 1 && s[i - 1][j] == 'R' && s[i][j] == 'G' && s[i + 1][j] == 'W')
     f[i][2] = max(f[p][0], f[p][2]) + 1;
   }
   p = i;
  }
  ans += max({f[p][0], f[p][1], f[p][2]});
 }
 cout << ans << '\n';
 return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 324 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 316 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 320 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 320 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 328 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 320 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 0 ms 328 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 316 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 320 KB Output is correct
40 Correct 0 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 320 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 328 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 0 ms 320 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 0 ms 328 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 12 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 6 ms 340 KB Output is correct
58 Correct 15 ms 2468 KB Output is correct
59 Correct 144 ms 18852 KB Output is correct
60 Correct 140 ms 19036 KB Output is correct
61 Correct 144 ms 18916 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 136 ms 18180 KB Output is correct
64 Correct 88 ms 18956 KB Output is correct
65 Correct 89 ms 18916 KB Output is correct
66 Correct 86 ms 18860 KB Output is correct
67 Correct 88 ms 19136 KB Output is correct
68 Correct 89 ms 18940 KB Output is correct
69 Correct 92 ms 18892 KB Output is correct
70 Correct 9 ms 2388 KB Output is correct
71 Correct 9 ms 2388 KB Output is correct
72 Correct 10 ms 2388 KB Output is correct
73 Correct 9 ms 2452 KB Output is correct
74 Correct 10 ms 2340 KB Output is correct
75 Correct 8 ms 2388 KB Output is correct
76 Correct 9 ms 2360 KB Output is correct
77 Correct 9 ms 2380 KB Output is correct
78 Correct 9 ms 2344 KB Output is correct
79 Correct 9 ms 2388 KB Output is correct
80 Correct 9 ms 2388 KB Output is correct
81 Correct 9 ms 2356 KB Output is correct
82 Correct 9 ms 2456 KB Output is correct
83 Correct 9 ms 2376 KB Output is correct
84 Correct 9 ms 2356 KB Output is correct
85 Correct 9 ms 2388 KB Output is correct
86 Correct 9 ms 2360 KB Output is correct
87 Correct 9 ms 2388 KB Output is correct
88 Correct 9 ms 2460 KB Output is correct
89 Correct 9 ms 2388 KB Output is correct
90 Correct 11 ms 2388 KB Output is correct