Submission #1289585

#	Time	Username	Problem	Language	Result	Execution time	Memory
1289585		faruk2012ek	Dango Maker (JOI18_dango_maker)	C++20	0 / 100	1 ms	576 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp <<" "<<
int inf = 2e18;

void solve()
{
    int n=0,m=0;
    cin>>n>>m;
    char dizi[n][m];
    if(n<3||m<3)
    {
        cout<<0;
        return;
    }
    for(int i=0;i<n;i++)
    {
        for(int j =0;j<m;j++)
        {
            cin>>dizi[i][j];
        }
    }
    int semboller=0;
    for(int i=0;i<n;i++)
    {
        for(int j =0;j<m;j++)
        {
            int y=0,q=0;
            if(dizi[i][j]=='R')
            {
                if(n-i>2)if(dizi[i+1][j]=='G'&&dizi[i+2][j]=='W')
                {
                    q=1;
                    semboller++;
                }
                if(m-j>2)if(dizi[i][j+1]=='G'&&dizi[i][j+2]=='W')
                {
                    y=1;
                    semboller++;
                }
            }
            if(q==1)
            {
                dizi[i][j]='0';
                dizi[i+1][j]='0';
                dizi[i+2][j]='0';
            }
            if(y==1)
            {
                dizi[i][j]='0';
                dizi[i][j+1]='0';
                dizi[i][j+2]='0';
            }
        }
    }
    cout<<semboller;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

#ifdef faruk
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif

    int t = 1;
    //cin>>t;
    while (t--) solve();
    return 0;
}

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