제출 #207375

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
207375		Saboon	Dango Maker (JOI18_dango_maker)	C++14	13 / 100	5 ms	504 KiB

dango_maker

#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 = 1; j < m - 1; j++)
			if (s[i][j-1] == 'R' and s[i][j] == 'G' and s[i][j+1] == 'W' and !mark[i][j-1] and !mark[i][j] and !mark[i][j-1])
				answer ++, mark[i][j-1] = mark[i][j] = mark[i][j+1] = 1;
		if (i > 1){
			i --;
			for (int j = 0; j < m; j++)
				if (s[i-1][j] == 'R' and s[i][j] == 'G' and s[i+1][j] == 'W' and !mark[i-1][j] and !mark[i][j] and !mark[i+1][j])
					answer ++, mark[i-1][j] = mark[i][j] = mark[i+1][j] = 1;
			i ++;
		}
	}
	cout << answer << '\n';
}

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