oj.uz

Submission #941034

# Submission time Handle Problem Language Result Execution time Memory
941034 2024-03-08T05:25:24 Z carriewang Dango Maker (JOI18_dango_maker) C++17
100 / 100
 150 ms 18100 KB 
#include <bits/stdc++.h>
#define ll longlong
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sz(x) x.szie()
#define all(x) x.begin(),x.end()
#define F first
#define S second
using namespace std;
const int maxn=3005;
int n,m,dp[3][maxn];
char c[maxn][maxn];
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    cin >> n >> m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin >> c[i][j];
        }
    }
    int ans=0;
    for(int i=1;i<=n+m;i++){
        int ret=0;
        memset(dp,0,sizeof(dp));
        for(int x=1,y=i-1;x<=n;x++,y--){
            if(y>m) continue;
            if(y<1) break;
            dp[0][x]=max(dp[0][x-1],max(dp[1][x-1],dp[2][x-1]));
            if(c[x][y]!='G') continue;
            if(c[x][y-1]=='R' && c[x][y+1]=='W'){
                dp[1][x]=max(dp[0][x-1],dp[1][x-1])+1;
            }
            if(c[x-1][y]=='R' && c[x+1][y]=='W'){
                dp[2][x]=max(dp[0][x-1],dp[2][x-1])+1;
            }
            ret=max(max(ret,dp[0][x]),max(dp[1][x],dp[2][x]));
        }
        ans+=ret;
    }
    cout << ans << "\n";
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 348 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 464 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 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 1 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 348 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 464 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 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 1 ms 348 KB Output is correct
23 Correct 1 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 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 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 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 860 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 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 0 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 1 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 348 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 464 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 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 1 ms 348 KB Output is correct
23 Correct 1 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 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 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 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 860 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 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 0 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 2 ms 348 KB Output is correct
55 Correct 6 ms 9328 KB Output is correct
56 Correct 2 ms 348 KB Output is correct
57 Correct 3 ms 6748 KB Output is correct
58 Correct 24 ms 5728 KB Output is correct
59 Correct 150 ms 18100 KB Output is correct
60 Correct 148 ms 17904 KB Output is correct
61 Correct 146 ms 18000 KB Output is correct
62 Correct 2 ms 504 KB Output is correct
63 Correct 147 ms 17768 KB Output is correct
64 Correct 130 ms 17892 KB Output is correct
65 Correct 126 ms 18100 KB Output is correct
66 Correct 129 ms 18100 KB Output is correct
67 Correct 138 ms 18004 KB Output is correct
68 Correct 145 ms 18096 KB Output is correct
69 Correct 128 ms 17904 KB Output is correct
70 Correct 18 ms 5724 KB Output is correct
71 Correct 15 ms 5724 KB Output is correct
72 Correct 17 ms 5724 KB Output is correct
73 Correct 15 ms 5720 KB Output is correct
74 Correct 17 ms 5724 KB Output is correct
75 Correct 16 ms 5724 KB Output is correct
76 Correct 15 ms 5724 KB Output is correct
77 Correct 15 ms 5748 KB Output is correct
78 Correct 17 ms 5764 KB Output is correct
79 Correct 17 ms 5724 KB Output is correct
80 Correct 15 ms 5624 KB Output is correct
81 Correct 15 ms 5720 KB Output is correct
82 Correct 16 ms 5628 KB Output is correct
83 Correct 15 ms 5764 KB Output is correct
84 Correct 16 ms 5724 KB Output is correct
85 Correct 16 ms 5772 KB Output is correct
86 Correct 15 ms 5724 KB Output is correct
87 Correct 19 ms 5596 KB Output is correct
88 Correct 17 ms 5632 KB Output is correct
89 Correct 15 ms 5720 KB Output is correct
90 Correct 15 ms 5744 KB Output is correct