제출 #375640

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
375640		peijar	Dango Maker (JOI18_dango_maker)	C++17	13 / 100	1 ms	492 KiB

dango_maker

#include <bits/stdc++.h>
using namespace std;

const int MAXN =3000;
char couleur[MAXN][MAXN];
bool pris[MAXN][MAXN];

signed main(void)
{
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	
	int nbLig, nbCol;
	cin >> nbLig >> nbCol;
	for (int iLig(0); iLig < nbLig; ++iLig)
		for (int iCol(0); iCol < nbCol; ++iCol)
			cin >> couleur[iLig][iCol];
	int sol(0);
	for (int iLig(nbLig-1); iLig >= 0; --iLig)
		for (int iCol(0); iCol < nbCol; ++iCol)
			if (couleur[iLig][iCol] == 'R')
			{
				if (iLig + 2 < nbLig and couleur[iLig+1][iCol] == 'G'
						and couleur[iLig+2][iCol] == 'W' and !pris[iLig+1][iCol]
						and !pris[iLig+2][iCol])
					sol++;
				else if (iCol + 2 < nbCol and couleur[iLig][iCol+1] == 'G'
						and couleur[iLig][iCol+2] == 'W')
				{
					pris[iLig][iCol+1] = pris[iLig][iCol+2] = true;
					sol++;
				}
			}
	cout << sol << endl;
}

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