Submission #610892

# Submission time Handle Problem Language Result Execution time Memory
610892 2022-07-28T17:17:34 Z Urvuk3 Dango Maker (JOI18_dango_maker) C++17
33 / 100
222 ms 262144 KB
#include <bits/stdc++.h>

using namespace std;

#define ll long long
ll INF=1e9,LINF=1e18,MOD=1e9+7; const ll MAXN=1e3+1,MAXS=2*MAXN;
#define fi first
#define se second
#define pii pair<int,int>
#define mid ((l+r)/2)
#define sz(a) (int((a).size()))
#define all(a) a.begin(),a.end()
#define endl "\n"
#define PRINT(x) cerr<<#x<<'-'<<x<<endl<<flush;
#define pb push_back
#define PRINTvec(x) { cerr<<#x<<"-"; for(auto i_:x) cerr<<i_<<" "; cerr<<endl; }

vector<vector<vector<int>>> dp(MAXN+1,vector<vector<int>>(2,vector<int>(2)));
vector<vector<vector<bool>>> start(MAXS+1,vector<vector<bool>>(MAXN+1,(vector<bool>(2))));

void Solve(){
    int N,M; cin>>N>>M;
    vector<vector<char>> a(N+3,vector<char>(M+3,'@'));
    for(int i=1;i<=N;i++){
        string s; cin>>s;
        for(int j=1;j<=M;j++){
            a[i][j]=s[j-1];
        }
    }

    for(int i=1;i<=N;i++){
        for(int j=1;j<=M;j++){
            if(a[i][j]=='R' && a[i+1][j]=='G' && a[i+2][j]=='W') start[i+j][i][1]=true;
            if(a[i][j]=='R' && a[i][j+1]=='G' && a[i][j+2]=='W') start[i+j][i][0]=true;
        }
    }

    function<void(int&,int)> Smax=[&](int& a,int b){
        a=max(a,b);
    };

    function<void()> Build=[&](){
        for(int i=1;i<=N;i++){
            for(int j=0;j<2;j++){
                for(int k=0;k<2;k++){
                    dp[i][j][k]=-INF;
                }
            }
        }
    };

    int res=0;
    for(int z=2;z<=N+M;z++){
        Build();
        dp[0][0][0]=0;
        for(int i=1;i<=N;i++){
            for(int x=0;x<2;x++){
                for(int y=0;y<2;y++){
                    Smax(dp[i][0][x],dp[i-1][x][y]);
                    if(start[z][i][0] && x==0 && y==0) Smax(dp[i][0][x],dp[i-1][x][y]+1);
                    if(start[z][i][1]) Smax(dp[i][1][x],dp[i-1][x][y]+1);
                }
            }
        }
        int tmp=0;
        for(int i=0;i<2;i++){
            for(int j=0;j<2;j++){
                tmp=max(tmp,dp[N][i][j]);
            }
        }
        res+=tmp;
    }
    cout<<res<<endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t; t=1;
    //cin>>t;
    while(t--){
        Solve();
    }
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 141 ms 141900 KB Output is correct
2 Correct 149 ms 141980 KB Output is correct
3 Correct 156 ms 141976 KB Output is correct
4 Correct 147 ms 141860 KB Output is correct
5 Correct 141 ms 141888 KB Output is correct
6 Correct 150 ms 141900 KB Output is correct
7 Correct 150 ms 141972 KB Output is correct
8 Correct 143 ms 141968 KB Output is correct
9 Correct 170 ms 142004 KB Output is correct
10 Correct 159 ms 142140 KB Output is correct
11 Correct 140 ms 141900 KB Output is correct
12 Correct 143 ms 141896 KB Output is correct
13 Correct 149 ms 141892 KB Output is correct
14 Correct 151 ms 142080 KB Output is correct
15 Correct 142 ms 141932 KB Output is correct
16 Correct 154 ms 141928 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 141 ms 141900 KB Output is correct
2 Correct 149 ms 141980 KB Output is correct
3 Correct 156 ms 141976 KB Output is correct
4 Correct 147 ms 141860 KB Output is correct
5 Correct 141 ms 141888 KB Output is correct
6 Correct 150 ms 141900 KB Output is correct
7 Correct 150 ms 141972 KB Output is correct
8 Correct 143 ms 141968 KB Output is correct
9 Correct 170 ms 142004 KB Output is correct
10 Correct 159 ms 142140 KB Output is correct
11 Correct 140 ms 141900 KB Output is correct
12 Correct 143 ms 141896 KB Output is correct
13 Correct 149 ms 141892 KB Output is correct
14 Correct 151 ms 142080 KB Output is correct
15 Correct 142 ms 141932 KB Output is correct
16 Correct 154 ms 141928 KB Output is correct
17 Correct 152 ms 141900 KB Output is correct
18 Correct 150 ms 142040 KB Output is correct
19 Correct 143 ms 142036 KB Output is correct
20 Correct 145 ms 141976 KB Output is correct
21 Correct 143 ms 141896 KB Output is correct
22 Correct 171 ms 141972 KB Output is correct
23 Correct 146 ms 141976 KB Output is correct
24 Correct 149 ms 141932 KB Output is correct
25 Correct 147 ms 141892 KB Output is correct
26 Correct 143 ms 141972 KB Output is correct
27 Correct 150 ms 141928 KB Output is correct
28 Correct 146 ms 141916 KB Output is correct
29 Correct 143 ms 141976 KB Output is correct
30 Correct 146 ms 141964 KB Output is correct
31 Correct 153 ms 141980 KB Output is correct
32 Correct 145 ms 141936 KB Output is correct
33 Correct 158 ms 141932 KB Output is correct
34 Correct 145 ms 141900 KB Output is correct
35 Correct 146 ms 141960 KB Output is correct
36 Correct 148 ms 141860 KB Output is correct
37 Correct 154 ms 141888 KB Output is correct
38 Correct 147 ms 141972 KB Output is correct
39 Correct 158 ms 141872 KB Output is correct
40 Correct 154 ms 141928 KB Output is correct
41 Correct 144 ms 141864 KB Output is correct
42 Correct 143 ms 142000 KB Output is correct
43 Correct 150 ms 141888 KB Output is correct
44 Correct 184 ms 141900 KB Output is correct
45 Correct 142 ms 141980 KB Output is correct
46 Correct 150 ms 142028 KB Output is correct
47 Correct 142 ms 141848 KB Output is correct
48 Correct 148 ms 141972 KB Output is correct
49 Correct 143 ms 141980 KB Output is correct
50 Correct 162 ms 141892 KB Output is correct
51 Correct 185 ms 141964 KB Output is correct
52 Correct 139 ms 141932 KB Output is correct
53 Correct 143 ms 141976 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 141 ms 141900 KB Output is correct
2 Correct 149 ms 141980 KB Output is correct
3 Correct 156 ms 141976 KB Output is correct
4 Correct 147 ms 141860 KB Output is correct
5 Correct 141 ms 141888 KB Output is correct
6 Correct 150 ms 141900 KB Output is correct
7 Correct 150 ms 141972 KB Output is correct
8 Correct 143 ms 141968 KB Output is correct
9 Correct 170 ms 142004 KB Output is correct
10 Correct 159 ms 142140 KB Output is correct
11 Correct 140 ms 141900 KB Output is correct
12 Correct 143 ms 141896 KB Output is correct
13 Correct 149 ms 141892 KB Output is correct
14 Correct 151 ms 142080 KB Output is correct
15 Correct 142 ms 141932 KB Output is correct
16 Correct 154 ms 141928 KB Output is correct
17 Correct 152 ms 141900 KB Output is correct
18 Correct 150 ms 142040 KB Output is correct
19 Correct 143 ms 142036 KB Output is correct
20 Correct 145 ms 141976 KB Output is correct
21 Correct 143 ms 141896 KB Output is correct
22 Correct 171 ms 141972 KB Output is correct
23 Correct 146 ms 141976 KB Output is correct
24 Correct 149 ms 141932 KB Output is correct
25 Correct 147 ms 141892 KB Output is correct
26 Correct 143 ms 141972 KB Output is correct
27 Correct 150 ms 141928 KB Output is correct
28 Correct 146 ms 141916 KB Output is correct
29 Correct 143 ms 141976 KB Output is correct
30 Correct 146 ms 141964 KB Output is correct
31 Correct 153 ms 141980 KB Output is correct
32 Correct 145 ms 141936 KB Output is correct
33 Correct 158 ms 141932 KB Output is correct
34 Correct 145 ms 141900 KB Output is correct
35 Correct 146 ms 141960 KB Output is correct
36 Correct 148 ms 141860 KB Output is correct
37 Correct 154 ms 141888 KB Output is correct
38 Correct 147 ms 141972 KB Output is correct
39 Correct 158 ms 141872 KB Output is correct
40 Correct 154 ms 141928 KB Output is correct
41 Correct 144 ms 141864 KB Output is correct
42 Correct 143 ms 142000 KB Output is correct
43 Correct 150 ms 141888 KB Output is correct
44 Correct 184 ms 141900 KB Output is correct
45 Correct 142 ms 141980 KB Output is correct
46 Correct 150 ms 142028 KB Output is correct
47 Correct 142 ms 141848 KB Output is correct
48 Correct 148 ms 141972 KB Output is correct
49 Correct 143 ms 141980 KB Output is correct
50 Correct 162 ms 141892 KB Output is correct
51 Correct 185 ms 141964 KB Output is correct
52 Correct 139 ms 141932 KB Output is correct
53 Correct 143 ms 141976 KB Output is correct
54 Runtime error 222 ms 262144 KB Execution killed with signal 11
55 Halted 0 ms 0 KB -