oj.uz

Submission #544887

# Submission time Handle Problem Language Result Execution time Memory
544887 2022-04-03T04:17:17 Z pokmui9909 Dango Maker (JOI18_dango_maker) C++17
100 / 100
 239 ms 18172 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll N, M;
char A[3005][3005];
ll D[6005][3];

int main(){
    cin.tie(0) -> sync_with_stdio(false);

    cin >> N >> M;
    for(int i = 1; i <= N; i++){
        for(int j = 1; j <= M; j++){
            cin >> A[i][j];
        }
    }
    ll ans = 0;
    for(int k = 1; k <= N + M; k++){
        memset(D, 0, sizeof(D));
        int t = 0;
        for(int i = 1; i <= N; i++){
            int j = k - i;
            if(j < 1 || j > M) continue;
            D[i][0] = max({D[i - 1][0], D[i - 1][1], D[i - 1][2]});
            if(A[i][j] == 'G' && A[i - 1][j] == 'R' && A[i + 1][j] == 'W') D[i][1] = max(D[i - 1][0], D[i - 1][1]) + 1;
            if(A[i][j] == 'G' && A[i][j - 1] == 'R' && A[i][j + 1] == 'W') D[i][2] = max(D[i - 1][0], D[i - 1][2]) + 1;
            t = i;
        }
        ans += max({D[t][0], D[t][1], D[t][2]});
    }
    cout << ans;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 456 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 456 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 452 KB Output is correct
29 Correct 1 ms 448 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 468 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 1 ms 468 KB Output is correct
53 Correct 1 ms 456 KB Output is correct
54 Correct 11 ms 476 KB Output is correct
55 Correct 22 ms 9276 KB Output is correct
56 Correct 11 ms 504 KB Output is correct
57 Correct 14 ms 6364 KB Output is correct
58 Correct 30 ms 4376 KB Output is correct
59 Correct 235 ms 18072 KB Output is correct
60 Correct 239 ms 18084 KB Output is correct
61 Correct 231 ms 18092 KB Output is correct
62 Correct 9 ms 468 KB Output is correct
63 Correct 224 ms 17792 KB Output is correct
64 Correct 184 ms 18172 KB Output is correct
65 Correct 189 ms 18092 KB Output is correct
66 Correct 204 ms 17992 KB Output is correct
67 Correct 175 ms 18092 KB Output is correct
68 Correct 185 ms 18076 KB Output is correct
69 Correct 191 ms 18060 KB Output is correct
70 Correct 27 ms 4312 KB Output is correct
71 Correct 26 ms 4352 KB Output is correct
72 Correct 26 ms 4300 KB Output is correct
73 Correct 27 ms 4336 KB Output is correct
74 Correct 27 ms 4388 KB Output is correct
75 Correct 25 ms 4352 KB Output is correct
76 Correct 26 ms 4324 KB Output is correct
77 Correct 27 ms 4376 KB Output is correct
78 Correct 27 ms 4376 KB Output is correct
79 Correct 26 ms 4312 KB Output is correct
80 Correct 26 ms 4328 KB Output is correct
81 Correct 28 ms 4264 KB Output is correct
82 Correct 28 ms 4300 KB Output is correct
83 Correct 25 ms 4304 KB Output is correct
84 Correct 26 ms 4308 KB Output is correct
85 Correct 28 ms 4316 KB Output is correct
86 Correct 24 ms 4344 KB Output is correct
87 Correct 24 ms 4388 KB Output is correct
88 Correct 25 ms 4340 KB Output is correct
89 Correct 25 ms 4308 KB Output is correct
90 Correct 26 ms 4336 KB Output is correct