oj.uz

Submission #1015874

# Submission time Handle Problem Language Result Execution time Memory
1015874 2024-07-07T00:53:45 Z snpmrnhlol Dango Maker (JOI18_dango_maker) C++17
100 / 100
 505 ms 88404 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 3e3;
char v[N][N];
int n,m;
int ans = 0;
bool ok(int x,int y,int id){
    if(id == 0){
        return 0 <= x && x <= n - 1 && 0 <= y && y <= m - 3 && v[x][y] == 'R' && v[x][y + 1] == 'G' && v[x][y + 2] == 'W';
    }else{
        return 0 <= x && x <= n - 3 && 0 <= y && y <= m - 1 && v[x][y] == 'R' && v[x + 1][y] == 'G' && v[x + 2][y] == 'W';
    }
}
int dp[N][N][2];
int main(){
    cin>>n>>m;
    for(int i = 0;i < n;i++){
        for(int j = 0;j < m;j++){
            cin>>v[i][j];
        }
    }
    for(int i = n - 1;i >= 0;i--){
        for(int j = 0;j < m;j++){
            dp[i][j][0] = max(ok(i,j - 1,0) + (i + 1 < n && j - 1 >= 0?dp[i + 1][j - 1][0]:0),dp[i][j][0]);
            dp[i][j][0] = max(ok(i,j - 1,0) + (i + 2 < n && j - 2 >= 0?dp[i + 2][j - 2][1]:0),dp[i][j][0]);
            dp[i][j][1] = max(ok(i - 1,j,1) + (i + 1 < n && j - 1 >= 0?dp[i + 1][j - 1][1]:0),dp[i][j][1]);
            dp[i][j][1] = max(ok(i - 1,j,1) + (i + 2 < n && j - 2 >= 0?dp[i + 2][j - 2][0]:0),dp[i][j][1]);
            if(i == 0 || j == m - 1){
                ans+=max(dp[i][j][0],dp[i][j][1]);
            }
        }
    }
    cout<<ans<<'\n';
    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 0 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 0 ms 2396 KB Output is correct
27 Correct 0 ms 2496 KB Output is correct
28 Correct 0 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 0 ms 2396 KB Output is correct
31 Correct 0 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 0 ms 2396 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 0 ms 2396 KB Output is correct
41 Correct 0 ms 2396 KB Output is correct
42 Correct 0 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 1 ms 2396 KB Output is correct
45 Correct 1 ms 2476 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 1 ms 2396 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 0 ms 2448 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 1 ms 2396 KB Output is correct
54 Correct 1 ms 2392 KB Output is correct
55 Correct 6 ms 21748 KB Output is correct
56 Correct 1 ms 2396 KB Output is correct
57 Correct 5 ms 16732 KB Output is correct
58 Correct 53 ms 17240 KB Output is correct
59 Correct 459 ms 88220 KB Output is correct
60 Correct 448 ms 88356 KB Output is correct
61 Correct 450 ms 88400 KB Output is correct
62 Correct 1 ms 2392 KB Output is correct
63 Correct 505 ms 87964 KB Output is correct
64 Correct 403 ms 88400 KB Output is correct
65 Correct 363 ms 88348 KB Output is correct
66 Correct 371 ms 88404 KB Output is correct
67 Correct 402 ms 88400 KB Output is correct
68 Correct 371 ms 88400 KB Output is correct
69 Correct 363 ms 88400 KB Output is correct
70 Correct 44 ms 17232 KB Output is correct
71 Correct 52 ms 17488 KB Output is correct
72 Correct 44 ms 17232 KB Output is correct
73 Correct 45 ms 17236 KB Output is correct
74 Correct 44 ms 17068 KB Output is correct
75 Correct 43 ms 17304 KB Output is correct
76 Correct 44 ms 17236 KB Output is correct
77 Correct 57 ms 17240 KB Output is correct
78 Correct 46 ms 17232 KB Output is correct
79 Correct 49 ms 17100 KB Output is correct
80 Correct 44 ms 17276 KB Output is correct
81 Correct 43 ms 17232 KB Output is correct
82 Correct 45 ms 17236 KB Output is correct
83 Correct 53 ms 17232 KB Output is correct
84 Correct 44 ms 17236 KB Output is correct
85 Correct 44 ms 17236 KB Output is correct
86 Correct 43 ms 17236 KB Output is correct
87 Correct 44 ms 17488 KB Output is correct
88 Correct 42 ms 17064 KB Output is correct
89 Correct 46 ms 17084 KB Output is correct
90 Correct 44 ms 17192 KB Output is correct