제출 #678553

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
678553		Hiennoob123	Dango Maker (JOI18_dango_maker)	C++14	0 / 100	1 ms	340 KiB

dango_maker

#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define cd complex<ld>
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pld pair<ld,ld>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll n, m;
char c[3005][3005];
ll dp[2][3005][3005];
ll dpk[2][3005][3005];
ll ans[3005][3005];
bool chk[2][3005][3005];
void solve()
{
    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 = 3; j<= m; j++)
        {
            if(c[i][j-1]=='G'&&c[i][j-1]!=c[i][j-2]&&c[i][j-2]!=c[i][j]&&c[i][j]!=c[i][j-1]) chk[0][i][j] = 1;
        }
    }
    for(int i = 3 ;i<= n; i++)
    {
        for(int j = 1; j<= m; j++)
        {
            if(c[i-1][j]=='G'&&c[i-1][j]!=c[i-2][j]&&c[i][j]!=c[i-2][j]&&c[i][j]!=c[i-1][j]) chk[1][i][j] = 1;
        }
    }
    for(int i = 3; i<= n; i++)
    {
        for(int j = 3; j<= m; j++)
        {
            dp[0][i][j] = dp[0][i][j-1]+chk[1][i][j];
            dp[0][i][j] = max(dp[0][i][j], dp[0][i][j-3]+chk[0][i][j]+chk[0][i-1][j]+chk[0][i-2][j]);
            dp[1][i][j] = dp[1][i-1][j]+chk[0][i][j];
            dp[1][i][j] = max(dp[1][i][j], dp[1][i-3][j]+chk[1][i][j]+chk[1][i][j-1]+chk[1][i][j-2]);
        }
    }
    for(int i = 1; i<= n; i++)
    {
        for(int j = 1; j<= m; j++)
        {
            dpk[0][i][j] = dp[0][i][j-1];
            dpk[1][i][j] = dp[1][i-1][j];
            if(j>=3)
            {
                dpk[0][i][j] = max(dpk[0][i][j],dpk[0][i][j-3]+chk[0][i][j]);
            }
            if(i>=3)
            {
                dpk[1][i][j] = max(dpk[1][i][j],dpk[1][i-3][j]+chk[1][i][j]);
            }
            //cout << i << " " << j << " " << dpk[0][i][j] << " " << dpk[1][i][j] << "\n";
        }
    }
    for(int i = 1; i<= n; i++)
    {
        for(int j = 1; j<= m;j++)
        {
            ans[i][j] = max(ans[i][j], ans[i-1][j]+dpk[0][i][j]);
            ans[i][j] = max(ans[i][j], ans[i][j-1]+dpk[1][i][j]);
            if(i>=3)
            {
                ans[i][j] = max(ans[i][j], ans[i-3][j]+dp[0][i][j]);
            }
            else if(j>=3)
            {
                ans[i][j] = max(ans[i][j], ans[i][j-3]+dp[1][i][j]);
            }
            //cout << i << " " << j << " " << ans[i][j] << "\n";
        }
    }
    cout << ans[n][m];
}
signed main()
{
    //freopen("IN.txt","r",stdin);
    //freopen("OUT.txt","w",stdout);
    ios_base::sync_with_stdio(NULL) ; cin.tie(nullptr) ; cout.tie(nullptr);
    ll t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
        cout << "\n";
    }
}

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