Submission #1115252

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115252		staszic_ojuz	Dango Maker (JOI18_dango_maker)	C++17	100 / 100	290 ms	44488 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin>>n>>m;
    int b[n][m];
    for(int i =0 ;i<n;i++)
    {
        for(int j = 0;j<m;j++)
        {
            char c;
            cin>>c;
            if(c == 'R')
            {
                b[i][j] = 1;
            }
            else if (c == 'G')
            {
                b[i][j] =  2;
            }
            else
            {
                b[i][j] = 3;
            }
        }
    }
    int ans = 0;
    for(int i =0 ;i<n;i++)
    {
        for(int j = 0;j<m;j++)
        {
            if((j<m-2 &&b[i][j] == 1) && (b[i][j+1] == 2 && b[i][j+2] == 3))
            {
                if(i!=0 && i < n-2 && b[i-1][j+1] == 1 && b[i+1][j+1] == 3 && b[i][j+1] == 2&&b[i][j+2] == 3)
                {
                    ans++;
                    b[i][j+1] = 0;
                    b[i-1][j+1] = 0;
                    b[i][j+2] = 0;
                }
                else
                {
                    b[i][j] = 0;
                    b[i][j+1] = 0;
                    b[i][j+2] = 0;
                    ans++;
                }
            }
            else if (i!= 0 && i!= n-1 &&b[i][j] == 2)
            {
                if(b[i-1][j] == 1 && b[i+1][j] == 3)
                {
                    b[i][j] = 0;b[i-1][j] = 0;b[i+1][j] = 0;
                    ans++;
                }
            }
        }
    }
    cout<<ans;
}

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