Submission #554800

#	Time	Username	Problem	Language	Result	Execution time	Memory
554800		Rafi22	Dango Maker (JOI18_dango_maker)	C++14	13 / 100	1 ms	340 KiB

dango_maker

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

char a[6107][6107];
int DP[6107][3][3];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>a[i][j];
    int ans=0;
    for(int i=1;i<=n+m-1;i++)
    {
        for(int c=1;c<=i;c++)
        {
            int x=c,y=i-c+1;
            for(int X=0;X<3;X++)
            {
                for(int Y=0;Y<3;Y++)
                {
                    DP[c][X][Y]=DP[c-1][X][Y];
                    if(X>0) DP[c][X][Y]=max(DP[c][X][Y],DP[c-1][X-1][Y]);
                    if(Y>0) DP[c][X][Y]=max(DP[c][X][Y],DP[c-1][X][Y-1]);
                    if(X>0&&Y>0) DP[c][X][Y]=max(DP[c][X][Y],DP[c-1][X-1][Y-1]);
                    if(X==0&&a[x][y]=='R'&&a[x][y+1]=='G'&&a[x][y+2]=='W')
                    {
                        int b=max({DP[c-1][0][2],DP[c-1][1][2],DP[c-1][2][2]});
                        DP[c][X][Y]=max(DP[c][X][Y],b+1);
                    }
                    if(Y==0&&a[x][y]=='R'&&a[x+1][y]=='G'&&a[x+2][y]=='W')
                    {
                        int b=max({DP[c-1][2][0],DP[c-1][2][1],DP[c-1][2][2]});
                        DP[c][X][Y]=max(DP[c][X][Y],b+1);
                    }
                }
            }
        }
        int mx=0;
        for(int X=0;X<3;X++)
        {
            for(int Y=0;Y<3;Y++)
            {
                mx=max(mx,DP[i][X][Y]);
            }
        }
        ans+=mx;
    }
    cout<<ans;

    return 0;
}

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