제출 #786072

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
786072		12345678	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	181 ms	123808 KiB

dango_maker

#include <bits/stdc++.h>

using namespace std;

const int nx=3e3+5;
int n, m, dp[nx][nx][3], ans;
char c[nx][nx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    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][0]=max({dp[i-1][j+1][0], dp[i-1][j+1][1], dp[i-1][j+1][2]});
            if (c[i][j]=='G'&&c[i+1][j]=='W'&&c[i-1][j]=='R') dp[i][j][1]=max(dp[i-1][j+1][0], dp[i-1][j+1][1])+1;
            if (c[i][j]=='G'&&c[i][j+1]=='W'&&c[i][j-1]=='R') dp[i][j][2]=max(dp[i-1][j+1][2], dp[i-1][j+1][0])+1;
        }
    }
    for (int i=1; i<=n; i++) ans+=max({dp[i][1][0], dp[i][1][1], dp[i][1][2]});
    for (int j=2; j<=m; j++) ans+=max({dp[n][j][0], dp[n][j][1], dp[n][j][2]});
    cout<<ans;
}

• Subtask 1: 13 / 13
• Subtask 2: 20 / 20
• Subtask 3: 67 / 67