oj.uz

Submission #704349

# Submission time Handle Problem Language Result Execution time Memory
704349 2023-03-02T04:03:20 Z 1075508020060209tc Dango Maker (JOI18_dango_maker) C++14
100 / 100
 406 ms 230220 KB 
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;int m;
string gr[5010];
int dp[3010][3010][3];
int fans[6010];
signed main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
    cin>>gr[i];
    gr[i]="*"+gr[i];
    gr[i]+="*";
}
gr[0]=gr[1];
gr[n+1]=gr[n+1];

for(int i=n;i>=1;i--){
    for(int 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]});
        if(gr[i][j]=='G'&&gr[i-1][j]=='R'&&gr[i+1][j]=='W'){
            dp[i][j][1]=max(dp[i+1][j-1][0]+1,dp[i+1][j-1][1]+1);
        }
        if(gr[i][j]=='G'&&gr[i][j-1]=='R'&&gr[i][j+1]=='W'){
            dp[i][j][2]=max(dp[i+1][j-1][0]+1,dp[i+1][j-1][2]+1);
        }
        fans[i+j]=max({fans[i+j],dp[i][j][0],dp[i][j][1],dp[i][j][2]});
    }
}
int ans=0;
for(int i=0;i<=n+m;i++){
    ans+=fans[i];
}
cout<<ans<<endl;

}

Subtask #1
13.0 / 13.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 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 0 ms 468 KB Output is correct
23 Correct 0 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 0 ms 468 KB Output is correct
32 Correct 0 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 0 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 0 ms 480 KB Output is correct
38 Correct 0 ms 468 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 0 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 0 ms 468 KB Output is correct
45 Correct 0 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 0 ms 468 KB Output is correct
49 Correct 0 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 0 ms 468 KB Output is correct

Subtask #3
67.0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 0 ms 468 KB Output is correct
12 Correct 0 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 0 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 0 ms 468 KB Output is correct
23 Correct 0 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 0 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 0 ms 468 KB Output is correct
32 Correct 0 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 0 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 0 ms 480 KB Output is correct
38 Correct 0 ms 468 KB Output is correct
39 Correct 0 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 0 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 0 ms 468 KB Output is correct
45 Correct 0 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 0 ms 468 KB Output is correct
49 Correct 0 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 0 ms 468 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 6 ms 12884 KB Output is correct
56 Correct 1 ms 852 KB Output is correct
57 Correct 4 ms 9044 KB Output is correct
58 Correct 49 ms 29956 KB Output is correct
59 Correct 406 ms 230212 KB Output is correct
60 Correct 344 ms 230092 KB Output is correct
61 Correct 348 ms 230212 KB Output is correct
62 Correct 1 ms 596 KB Output is correct
63 Correct 348 ms 229620 KB Output is correct
64 Correct 302 ms 230200 KB Output is correct
65 Correct 297 ms 230184 KB Output is correct
66 Correct 303 ms 230216 KB Output is correct
67 Correct 298 ms 230136 KB Output is correct
68 Correct 319 ms 230220 KB Output is correct
69 Correct 299 ms 230180 KB Output is correct
70 Correct 43 ms 29884 KB Output is correct
71 Correct 39 ms 29940 KB Output is correct
72 Correct 36 ms 29928 KB Output is correct
73 Correct 35 ms 29916 KB Output is correct
74 Correct 36 ms 29908 KB Output is correct
75 Correct 36 ms 29912 KB Output is correct
76 Correct 35 ms 29900 KB Output is correct
77 Correct 36 ms 29980 KB Output is correct
78 Correct 44 ms 29984 KB Output is correct
79 Correct 39 ms 29980 KB Output is correct
80 Correct 36 ms 29944 KB Output is correct
81 Correct 35 ms 29896 KB Output is correct
82 Correct 37 ms 29940 KB Output is correct
83 Correct 37 ms 30020 KB Output is correct
84 Correct 37 ms 29940 KB Output is correct
85 Correct 37 ms 29896 KB Output is correct
86 Correct 37 ms 29948 KB Output is correct
87 Correct 42 ms 29912 KB Output is correct
88 Correct 38 ms 29884 KB Output is correct
89 Correct 37 ms 29944 KB Output is correct
90 Correct 36 ms 29988 KB Output is correct