oj.uz

답안 #531590

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
531590 2022-03-01T04:46:36 Z erke Dango Maker (JOI18_dango_maker) C++11
100 / 100
 275 ms 18068 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 3010;

int n, m;
char a[N][N];

bool chcol(int x, int y) {
  if (a[x][y] == 'R' && a[x + 1][y] == 'G' && a[x + 2][y] == 'W') return true;
  return false;
}

bool chrow(int x, int y) {
  if (a[x][y] == 'R' && a[x][y + 1] == 'G' && a[x][y + 2] == 'W') return true;
  return false;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++)
  for (int j = 1; j <= m; j++) {
    cin >> a[i][j];
  }
  int ans = 0;
  for (int t = 2; t <= n + m - 2; t++) {
    vector<vector<int>> dp(3, vector<int>(3));
    int pos = 0;
    for (int j = t > n ? t - n : 1; j < min(t, m + 1); j++) {
      int i = t - j;
      pos++;
      int cur = pos % 3, prv = (pos - 1 + 3) % 3, PRV = (pos - 2 + 3) % 3;
      dp[cur][0] = max({dp[prv][0], dp[prv][1], dp[prv][2]});
      if (chrow(i, j)) dp[cur][1] = max({dp[prv][0], dp[prv][1], dp[prv][2]}) + 1;
      if (chcol(i, j)) dp[cur][2] = max({dp[PRV][0], dp[PRV][2], dp[prv][2]}) + 1;
    }
    int cur = pos % 3;
    ans += max({dp[cur][0], dp[cur][1], dp[cur][2]});
  }
  cout << ans << '\n';
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 420 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 0 ms 332 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 0 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 0 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 0 ms 332 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 420 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 0 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 0 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 0 ms 332 KB Output is correct
36 Correct 0 ms 332 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 0 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 0 ms 332 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 0 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 0 ms 332 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 0 ms 332 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 4 ms 9036 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 3 ms 6092 KB Output is correct
58 Correct 29 ms 3148 KB Output is correct
59 Correct 275 ms 9136 KB Output is correct
60 Correct 232 ms 17976 KB Output is correct
61 Correct 232 ms 17920 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 226 ms 17644 KB Output is correct
64 Correct 184 ms 17816 KB Output is correct
65 Correct 201 ms 18000 KB Output is correct
66 Correct 208 ms 17852 KB Output is correct
67 Correct 186 ms 18068 KB Output is correct
68 Correct 188 ms 17952 KB Output is correct
69 Correct 174 ms 17860 KB Output is correct
70 Correct 20 ms 4200 KB Output is correct
71 Correct 21 ms 4164 KB Output is correct
72 Correct 21 ms 4168 KB Output is correct
73 Correct 21 ms 4204 KB Output is correct
74 Correct 21 ms 4144 KB Output is correct
75 Correct 19 ms 4172 KB Output is correct
76 Correct 24 ms 4196 KB Output is correct
77 Correct 23 ms 4232 KB Output is correct
78 Correct 25 ms 4172 KB Output is correct
79 Correct 29 ms 4172 KB Output is correct
80 Correct 25 ms 4252 KB Output is correct
81 Correct 27 ms 4164 KB Output is correct
82 Correct 20 ms 4224 KB Output is correct
83 Correct 26 ms 4192 KB Output is correct
84 Correct 21 ms 4112 KB Output is correct
85 Correct 20 ms 4164 KB Output is correct
86 Correct 22 ms 4192 KB Output is correct
87 Correct 22 ms 4116 KB Output is correct
88 Correct 21 ms 4244 KB Output is correct
89 Correct 19 ms 4212 KB Output is correct
90 Correct 20 ms 4208 KB Output is correct