제출 #1095574

#제출 시각아이디문제언어결과실행 시간메모리
1095574formidablechief27Dango Maker (JOI18_dango_maker)C++14
13 / 100
1 ms508 KiB
#include <bits/stdc++.h>
using namespace std;

void solve() {
	int n, m;
	cin >> n >> m;
	vector<string> grid(n);
	for(int i=0;i<n;i++) cin >> grid[i];
	int ans = 0;
	for(int i=0;i<n;i++) {
		for(int j=0;j<m;j++) {
			if(i + 2 < n && grid[i][j] == 'R' && grid[i+1][j] == 'G' && grid[i+2][j] == 'W') {
				grid[i][j] = 'P';
				grid[i+1][j] = 'P';
				grid[i+2][j] = 'P';
				ans++;
			}
			if(j + 2 < m && grid[i][j] == 'R' && grid[i][j+1] == 'G' && grid[i][j+2] == 'W') {
				grid[i][j] = 'P';
				grid[i][j+1] = 'P';
				grid[i][j+2] = 'P';
				ans++;
			}
		}
	}
	cout << ans;
}

int main() {
	solve();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...