제출 #207376

#제출 시각아이디문제언어결과실행 시간메모리
207376SaboonDango Maker (JOI18_dango_maker)C++14
13 / 100
6 ms508 KiB
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
 
const int maxn = 3000 + 10;
const int inf = 1e9;
 
bool mark[maxn][maxn];
string s[maxn];
 
int main(){
	ios_base::sync_with_stdio(false);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		cin >> s[i];
	int answer = 0;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			if (s[i][j] != 'G')
				continue;
			if (i > 0 and i < n - 1 and s[i - 1][j] == 'R' and s[i + 1][j] == 'W' and !mark[i - 1][j])
				answer ++, mark[i][j] = mark[i - 1][j] = mark[i + 1][j] = 1;
			else if (j > 0 and j < m - 1 and s[i][j - 1] == 'R' and s[i][j + 1] == 'W' and !mark[i][j + 1])
				answer ++, mark[i][j] = mark[i][j - 1] = mark[i][j + 1] = 1;
		}
	}
	cout << answer << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...