oj.uz

Submission #380446

# Submission time Handle Problem Language Result Execution time Memory
380446 2021-03-21T20:56:01 Z NintsiChkhaidze Dango Maker (JOI18_dango_maker) C++14
100 / 100
 318 ms 123884 KB 
#include <bits/stdc++.h>
using namespace std;
char a[3005][3005];
int dp[3][3005][3005];
int main(){
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
    int n,m;
    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 i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            dp[0][i][j] = max(dp[0][i - 1][j+1],max(dp[1][i-1][j+1],dp[2][i-1][j+1]));
            
            if (a[i][j]=='G') {
                if (a[i][j - 1] == 'R' && a[i][j + 1] == 'W') 
                    dp[1][i][j] = max(dp[1][i - 1][j + 1],dp[0][i - 1][j + 1]) + 1;
                if (a[i - 1][j] == 'R' && a[i + 1][j] == 'W')
                   dp[2][i][j] = max(dp[2][i - 1][j + 1],dp[0][i - 1][j + 1]) + 1;
            }
            
            if (i == n || j == 1) ans+=max(dp[0][i][j],max(dp[1][i][j],dp[2][i][j]));
        }
        
    }
    cout<<ans;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 1 ms 492 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 1 ms 492 KB Output is correct
43 Correct 1 ms 492 KB Output is correct
44 Correct 1 ms 492 KB Output is correct
45 Correct 1 ms 492 KB Output is correct
46 Correct 1 ms 492 KB Output is correct
47 Correct 1 ms 492 KB Output is correct
48 Correct 1 ms 492 KB Output is correct
49 Correct 1 ms 492 KB Output is correct
50 Correct 1 ms 492 KB Output is correct
51 Correct 1 ms 492 KB Output is correct
52 Correct 1 ms 492 KB Output is correct
53 Correct 1 ms 492 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 15 ms 21868 KB Output is correct
56 Correct 1 ms 492 KB Output is correct
57 Correct 20 ms 24300 KB Output is correct
58 Correct 46 ms 27884 KB Output is correct
59 Correct 267 ms 123884 KB Output is correct
60 Correct 280 ms 123884 KB Output is correct
61 Correct 318 ms 123884 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 262 ms 123600 KB Output is correct
64 Correct 211 ms 123884 KB Output is correct
65 Correct 210 ms 123884 KB Output is correct
66 Correct 214 ms 123884 KB Output is correct
67 Correct 203 ms 69100 KB Output is correct
68 Correct 187 ms 69356 KB Output is correct
69 Correct 196 ms 79288 KB Output is correct
70 Correct 32 ms 28012 KB Output is correct
71 Correct 33 ms 28012 KB Output is correct
72 Correct 33 ms 28012 KB Output is correct
73 Correct 33 ms 28012 KB Output is correct
74 Correct 35 ms 28012 KB Output is correct
75 Correct 34 ms 28012 KB Output is correct
76 Correct 33 ms 28012 KB Output is correct
77 Correct 33 ms 28012 KB Output is correct
78 Correct 33 ms 28012 KB Output is correct
79 Correct 34 ms 28012 KB Output is correct
80 Correct 33 ms 28012 KB Output is correct
81 Correct 33 ms 28012 KB Output is correct
82 Correct 33 ms 28012 KB Output is correct
83 Correct 37 ms 28032 KB Output is correct
84 Correct 32 ms 28012 KB Output is correct
85 Correct 33 ms 28012 KB Output is correct
86 Correct 33 ms 28012 KB Output is correct
87 Correct 34 ms 28140 KB Output is correct
88 Correct 33 ms 28012 KB Output is correct
89 Correct 36 ms 28012 KB Output is correct
90 Correct 33 ms 28012 KB Output is correct