oj.uz

Submission #330369

# Submission time Handle Problem Language Result Execution time Memory
330369 2020-11-25T02:56:05 Z casperwang Dango Maker (JOI18_dango_maker) C++14
100 / 100
 146 ms 18156 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 3000;
int n, m;
string str;
char mp[MAXN+2][MAXN+2];
int ans;

int check(int x, int y) {
  return 1 * (mp[x-1][y] == 'R') * (mp[x][y] == 'G') * (mp[x+1][y] == 'W')
       + 2 * (mp[x][y-1] == 'R') * (mp[x][y] == 'G') * (mp[x][y+1] == 'W');
}

signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> str;
    for (int j = 1; j <= m; j++)
      mp[i][j] = str[j-1];
  }
  for (int i = 1; i <= n+m-1; i++) {
    int x = min(i, n), y = max(1, i-n+1);
    int V = 0, H = 0, No = 0;
    while (x >= 1 && y <= m) {
      int t = check(x, y);
      int tmp = max(V, H);
      if (t & 1) V = max(V, No) + 1;
      if (t & 2) H = max(H, No) + 1;
      No = tmp;
      x--, y++;
    }
    ans += max({V, H, No});
  }
  cout << ans << "\n";
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 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 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 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 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 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 1 ms 364 KB Output is correct
18 Correct 1 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 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 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 512 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 400 KB Output is correct
34 Correct 1 ms 364 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 8 ms 364 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 376 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 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 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 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 1 ms 364 KB Output is correct
18 Correct 1 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 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 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 512 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 400 KB Output is correct
34 Correct 1 ms 364 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 8 ms 364 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 376 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 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 364 KB Output is correct
55 Correct 5 ms 9196 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 4 ms 6252 KB Output is correct
58 Correct 13 ms 4204 KB Output is correct
59 Correct 138 ms 17900 KB Output is correct
60 Correct 137 ms 17900 KB Output is correct
61 Correct 138 ms 18156 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 133 ms 17644 KB Output is correct
64 Correct 138 ms 18028 KB Output is correct
65 Correct 138 ms 17900 KB Output is correct
66 Correct 146 ms 17900 KB Output is correct
67 Correct 134 ms 17900 KB Output is correct
68 Correct 137 ms 18028 KB Output is correct
69 Correct 137 ms 17900 KB Output is correct
70 Correct 12 ms 4204 KB Output is correct
71 Correct 12 ms 4204 KB Output is correct
72 Correct 12 ms 4204 KB Output is correct
73 Correct 12 ms 4204 KB Output is correct
74 Correct 14 ms 4204 KB Output is correct
75 Correct 12 ms 4204 KB Output is correct
76 Correct 12 ms 4204 KB Output is correct
77 Correct 12 ms 4204 KB Output is correct
78 Correct 12 ms 4204 KB Output is correct
79 Correct 12 ms 4204 KB Output is correct
80 Correct 12 ms 4204 KB Output is correct
81 Correct 12 ms 4204 KB Output is correct
82 Correct 12 ms 4204 KB Output is correct
83 Correct 12 ms 4204 KB Output is correct
84 Correct 14 ms 4204 KB Output is correct
85 Correct 12 ms 4332 KB Output is correct
86 Correct 12 ms 4204 KB Output is correct
87 Correct 12 ms 4204 KB Output is correct
88 Correct 12 ms 4204 KB Output is correct
89 Correct 12 ms 4204 KB Output is correct
90 Correct 12 ms 4204 KB Output is correct