Submission #1238145

#	Time	Username	Problem	Language	Result	Execution time	Memory
1238145		vicvic	Dango Maker (JOI18_dango_maker)	C++20	100 / 100	96 ms	45384 KiB

dango_maker

#include <bits/stdc++.h>

using namespace std;
const int NMAX=3e3;
string a[NMAX+5];
int n, m, used[NMAX+5][NMAX+5];
int main ()
{
    ios_base :: sync_with_stdio (0);
    cin.tie (nullptr);
    cin >> n >> m;
    for (int i=0;i<n;i++)
        cin >> a[i];
    int ans=0;
    for (int i=0;i<n;i++)
    {
        for (int j=0;j<m;j++)
        {
            if (a[i][j]!='R')
                continue;
            if (j<m-2 && used[i][j+1]+used[i][j+2]==0 && a[i][j+1]=='G' && a[i][j+2]=='W')
                ans++;
            else if (i<n-2 && a[i+1][j]=='G' && a[i+2][j]=='W' && used[i+1][j]+used[i+2][j]==0)
            {
                if (j>0 && j<m-1 && a[i+1][j-1]=='R' && a[i+1][j+1]=='W' && !used[i+1][j+1])
                    used[i+1][j]=1;
                else
                    used[i+2][j]=1;
                ans++;
            }
        }
    }
    cout << ans;
    return 0;
}

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