oj.uz

답안 #897361

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897361 2024-01-03T02:15:54 Z box Dango Maker (JOI18_dango_maker) C++17
100 / 100
 126 ms 19352 KB 
#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

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 456 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 600 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 456 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 464 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 600 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 8 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 5 ms 604 KB Output is correct
58 Correct 12 ms 2396 KB Output is correct
59 Correct 123 ms 18976 KB Output is correct
60 Correct 120 ms 19024 KB Output is correct
61 Correct 126 ms 19352 KB Output is correct
62 Correct 1 ms 600 KB Output is correct
63 Correct 111 ms 18260 KB Output is correct
64 Correct 77 ms 19280 KB Output is correct
65 Correct 82 ms 19264 KB Output is correct
66 Correct 83 ms 18888 KB Output is correct
67 Correct 77 ms 18868 KB Output is correct
68 Correct 81 ms 19076 KB Output is correct
69 Correct 85 ms 19108 KB Output is correct
70 Correct 8 ms 2392 KB Output is correct
71 Correct 8 ms 2396 KB Output is correct
72 Correct 8 ms 2396 KB Output is correct
73 Correct 10 ms 2360 KB Output is correct
74 Correct 8 ms 2612 KB Output is correct
75 Correct 8 ms 2364 KB Output is correct
76 Correct 7 ms 2396 KB Output is correct
77 Correct 8 ms 2604 KB Output is correct
78 Correct 8 ms 2392 KB Output is correct
79 Correct 8 ms 2392 KB Output is correct
80 Correct 7 ms 2396 KB Output is correct
81 Correct 8 ms 2396 KB Output is correct
82 Correct 8 ms 2596 KB Output is correct
83 Correct 8 ms 2396 KB Output is correct
84 Correct 8 ms 2392 KB Output is correct
85 Correct 8 ms 2392 KB Output is correct
86 Correct 7 ms 2396 KB Output is correct
87 Correct 8 ms 2396 KB Output is correct
88 Correct 8 ms 2520 KB Output is correct
89 Correct 8 ms 2396 KB Output is correct
90 Correct 8 ms 2396 KB Output is correct