oj.uz

Submission #1050467

# Submission time Handle Problem Language Result Execution time Memory
1050467 2024-08-09T09:54:49 Z vjudge1 Dango Maker (JOI18_dango_maker) C++17
100 / 100
 316 ms 230232 KB 
#include<algorithm>
#include<iostream>
#include<vector>
#include<queue>
#include<set>
using namespace std;
 
#define ll long long

const ll maxn=3011;

ll n,m,dp[maxn][maxn][3];
char c[maxn][maxn];

bool hor(ll i,ll j){
      return (c[i][j-1]=='R' and c[i][j]=='G' and c[i][j+1]=='W');
}

bool ver(ll i,ll j){
      return (c[i-1][j]=='R' and c[i][j]=='G' and c[i+1][j]=='W');
}

int main(){
      cin>>n>>m;
      for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                  cin>>c[i][j];
            }
      }
      for(ll i=1;i<=n;i++){
            for(ll j=1;j<=m;j++){
                  dp[i][j][0]=max({dp[i-1][j+1][0],dp[i-1][j+1][1],dp[i-1][j+1][2]});
                  dp[i][j][1]=max(dp[i-1][j+1][0],dp[i-1][j+1][1])+hor(i,j);
                  dp[i][j][2]=max(dp[i-1][j+1][0],dp[i-1][j+1][2])+ver(i,j);
            }
      }
      ll ans=0;
      for(ll i=1;i<=n;i++){
            ans+=max(dp[i][1][0],max(dp[i][1][1],dp[i][1][2]));
      }
      for(ll j=2;j<=m;j++){
            ans+=max(dp[n][j][0],max(dp[n][j][1],dp[n][j][2]));
      }
      cout<<ans;
      
      return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 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 344 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 1 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 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 344 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 1 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 0 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 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 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 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 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 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 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 344 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 1 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 0 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 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 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 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 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 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 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 11 ms 117852 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 10 ms 109840 KB Output is correct
58 Correct 35 ms 75864 KB Output is correct
59 Correct 302 ms 230180 KB Output is correct
60 Correct 306 ms 230232 KB Output is correct
61 Correct 300 ms 230228 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 316 ms 229832 KB Output is correct
64 Correct 288 ms 230104 KB Output is correct
65 Correct 310 ms 230228 KB Output is correct
66 Correct 297 ms 230224 KB Output is correct
67 Correct 253 ms 230088 KB Output is correct
68 Correct 277 ms 230080 KB Output is correct
69 Correct 276 ms 230096 KB Output is correct
70 Correct 36 ms 75860 KB Output is correct
71 Correct 36 ms 75860 KB Output is correct
72 Correct 32 ms 75860 KB Output is correct
73 Correct 30 ms 75860 KB Output is correct
74 Correct 30 ms 75860 KB Output is correct
75 Correct 30 ms 75860 KB Output is correct
76 Correct 30 ms 75972 KB Output is correct
77 Correct 30 ms 75988 KB Output is correct
78 Correct 31 ms 75868 KB Output is correct
79 Correct 32 ms 75840 KB Output is correct
80 Correct 31 ms 75856 KB Output is correct
81 Correct 30 ms 75856 KB Output is correct
82 Correct 30 ms 75864 KB Output is correct
83 Correct 30 ms 75864 KB Output is correct
84 Correct 30 ms 76028 KB Output is correct
85 Correct 50 ms 75852 KB Output is correct
86 Correct 39 ms 75852 KB Output is correct
87 Correct 30 ms 75992 KB Output is correct
88 Correct 36 ms 75856 KB Output is correct
89 Correct 40 ms 75860 KB Output is correct
90 Correct 31 ms 75856 KB Output is correct