제출 #521535

#제출 시각아이디문제언어결과실행 시간메모리
521535AdamGSDango Maker (JOI18_dango_maker)C++17
13 / 100
1 ms412 KiB
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=3e3+7;
string T[LIM];
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, m;
	cin >> n >> m;
	int ans=0;
	rep(i, n) {
		cin >> T[i];
		rep(j, m-2) if(T[i][j]=='R' && T[i][j+1]=='G' && T[i][j+2]=='W') {
			T[i][j]=T[i][j+1]=T[i][j+2]='.';
			++ans;
		}
	}
	rep(j, m) rep(i, n-2) if(T[i][j]=='R' && T[i+1][j]=='G' && T[i+2][j]=='W') {
		T[i][j]=T[i+1][j]=T[i+2][j]='.';
		++ans;
	}
	cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...