oj.uz

Submission #771991

# Submission time Handle Problem Language Result Execution time Memory
771991 2023-07-03T13:22:29 Z 1bin Dango Maker (JOI18_dango_maker) C++14
100 / 100
 128 ms 19012 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(v) v.beign(), v.end()
typedef long long ll;
const int NMAX = 3005;
int n, m, ans, dp[NMAX][3], x, y;
string s[NMAX];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> m;
    for(int i = 0; i < n; i++) cin >> s[i];
    for(int i = 0; i < n + m - 1; i++){
        for(int j = 0; j < m; j++)
            for(int k = 0; k < 3; k++) dp[j][k] = 0;
        if(i < n) y = i, x = 0;
        else y = n - 1, x = i - n + 1;
        
        while(y >= 0 && x < m){
            if(x) dp[x][0] = max({dp[x - 1][0], dp[x - 1][1], dp[x - 1][2]});
            if(s[y][x] == 'G'){
                if(x && x + 1 < m && s[y][x - 1] == 'R' && s[y][x + 1] == 'W') dp[x][1] = max(dp[x - 1][0], dp[x - 1][1]) + 1;
                if(y && y + 1 < n && s[y - 1][x] == 'R' && s[y + 1][x] == 'W') {
                    if(!x) dp[x][2] = 1;
                    else dp[x][2] = max(dp[x - 1][0], dp[x - 1][2]) + 1;
                }
            }
            x++; y--;
        }
        x--;
        ans += max({dp[x][0], dp[x][1], dp[x][2]});
    }
    cout << ans;
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 412 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 416 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 416 KB Output is correct
13 Correct 1 ms 340 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 340 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 412 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 416 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 416 KB Output is correct
13 Correct 1 ms 340 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 340 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 0 ms 412 KB Output is correct
21 Correct 1 ms 416 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 420 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 412 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 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 340 KB Output is correct
39 Correct 0 ms 416 KB Output is correct
40 Correct 1 ms 416 KB Output is correct
41 Correct 1 ms 412 KB Output is correct
42 Correct 1 ms 420 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 416 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 416 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 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 412 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 416 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 416 KB Output is correct
13 Correct 1 ms 340 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 340 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 0 ms 412 KB Output is correct
21 Correct 1 ms 416 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 420 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 412 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 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 340 KB Output is correct
39 Correct 0 ms 416 KB Output is correct
40 Correct 1 ms 416 KB Output is correct
41 Correct 1 ms 412 KB Output is correct
42 Correct 1 ms 420 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 416 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 0 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 416 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 9 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 9 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 13 ms 2460 KB Output is correct
59 Correct 128 ms 19012 KB Output is correct
60 Correct 125 ms 18932 KB Output is correct
61 Correct 120 ms 18952 KB Output is correct
62 Correct 8 ms 460 KB Output is correct
63 Correct 114 ms 18200 KB Output is correct
64 Correct 77 ms 18948 KB Output is correct
65 Correct 84 ms 18848 KB Output is correct
66 Correct 94 ms 18952 KB Output is correct
67 Correct 83 ms 18948 KB Output is correct
68 Correct 74 ms 18956 KB Output is correct
69 Correct 79 ms 18948 KB Output is correct
70 Correct 9 ms 2356 KB Output is correct
71 Correct 9 ms 2472 KB Output is correct
72 Correct 9 ms 2356 KB Output is correct
73 Correct 9 ms 2388 KB Output is correct
74 Correct 9 ms 2476 KB Output is correct
75 Correct 9 ms 2432 KB Output is correct
76 Correct 9 ms 2388 KB Output is correct
77 Correct 9 ms 2348 KB Output is correct
78 Correct 9 ms 2460 KB Output is correct
79 Correct 9 ms 2360 KB Output is correct
80 Correct 9 ms 2344 KB Output is correct
81 Correct 9 ms 2476 KB Output is correct
82 Correct 9 ms 2388 KB Output is correct
83 Correct 9 ms 2388 KB Output is correct
84 Correct 10 ms 2388 KB Output is correct
85 Correct 9 ms 2464 KB Output is correct
86 Correct 10 ms 2388 KB Output is correct
87 Correct 9 ms 2464 KB Output is correct
88 Correct 9 ms 2432 KB Output is correct
89 Correct 9 ms 2388 KB Output is correct
90 Correct 9 ms 2356 KB Output is correct