제출 #1341589

#제출 시각아이디문제언어결과실행 시간메모리
1341589NipphitchDango Maker (JOI18_dango_maker)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
using namespace std;
const int N=3005;

int n,m,dp[N][N];
char c[N][N];

signed 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];
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
            if(i>=3 && c[i][j]=='W' && c[i-1][j]=='G' && c[i-2][j]=='R'){
                dp[i][j]=max(dp[i][j],1+dp[i-3][j]+dp[i][j-1]-dp[i-3][j-1]);
            }
            if(j>=3 && c[i][j]=='W' && c[i][j-1]=='G' && c[i][j-2]=='R'){
                dp[i][j]=max(dp[i][j],1+dp[i][j-3]+dp[i-1][j]-dp[i-1][j-3]);
            }
        }
    }
    cout << dp[n][m];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...